Consider Again the Sdn Openflow Network Shown in Figure 4.30

Network Layer

Kurose & Ross, Chapter 4, Problem P4.

Consider the switch shown below. Suppose that all datagrams have the same fixed length, that the switch operates in a slotted, synchronous fashion, and that in one time slot a datagram can be transferred from an input port to an output port. The switch fabric is a crossbar so that at most one datagram can be transferred to a given output port in a time slot, but different output ports can receive datagrams from unlike input ports in a unmarried fourth dimension slot. What is the minimal number of time slots needd to transfer the packets shown from input ports to their output pots, bold any input queue scheduling lodge you want (i.e., it need not take HOL blocking)? What is the largest number of slots needed, bold the worst-case scheduling social club you can devise, assuming that a non-empty input queue is never idle?
Kurose & Ross, Chapter 4, Trouble P5.

Consider a datagram network using 32-bit host addresses. Suppose a router has iv links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows:

a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces.

b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses:

11001000 10010001 01010001 01010101
11100001 01000000 11000011 00111100
11100001 10000000 00010001 01110111
Kurose & Ross, Chapter iv, Problem P8.

Consider a router that interconnects three subnets: Subnet 1, Subnet ii, and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to accept the prefix 223.ane.17/24. Also suppose that Subnet ane is required to support at least 62 interfaces, Subnet ii is to support at least 95 interfaces, and Subnet 3 is to support at least 16 interfaces. Provide 3 network addresses (of the form a.b.c.d/ten) that satisfy these constraints.
Kurose & Ross, Affiliate four, Problem P14.

Consider sending a 2400-byte datagram into a link that has an MTU of 700 bytes. Suppose the original datagram is stamped with the identification number 422. How many fragments are generated? What are the values in the various fields in the IP datagram(s) generated related to fragmentation?
Kurose & Ross, Chapter four, Trouble P19.

Consider the SDN OpenFlow network show beneath.

Suppose that the desired forwarding beliefs for datagrams arriving at s2 is as follows:
- any datagrams arriving on input port 1 from hosts h5 or h6 that are destinated to hosts h1 or h2 should exist forwarded over output port 2;
- whatsoever datagrams arriving on input port 2 from hosts h1 or h2 that are destined to hosts h5 or h6 should be forwarded over output port 1;
- whatever arriving datagrams on input ports one or 2 and destned to hosts h3 or h4 should be deliverd to the host specified;
- hosts h3 and h4 shoul dbe able to send datagrams to each other.
Specify the flow table entries in s2 that implement this forwarding behavior.
Kurose & Ross, Chapter iv, Trouble P22.

Consider once more the SDN OpenFlow network shown above. Suppose we desire switch s2 to office as a firewall. Specify the catamenia tabular array in s2 that implements the post-obit firewall behaviors (specify a different flow table for each of the four firewalling behaviors below) for delivery of datagrams destined to h3 and h4. You practice not need to specify the forwarding behavior in s2 that frontwards traffic to other routers.

a. Only traffic arriving from hosts h1 and h6 should be delivered to hosts h3 or h4 (i.e., that arriving traffic from hosts h2 and h5 is blocked).

b. Only TCP traffic is immune to exist delivered to hosts h3 or h4 (i.e., that UDP traffic is blocked).

c. Only traffic destined to h3 is to be delivered (i.e. all traffic to h4 is blocked).

d. But UDP traffic from h1 and destined to h3 is to be delivered. All other traffic is blocked.
Kurose & Ross, Chapter 5, Trouble P8.

Consider the iii-node topology shown beneath. Rather than having the link costs shown in the figure, the link costs are c(x,y) = 3, c(y,z) = vi, c(z,10) = 4. Compute the altitude tables subsequently the initialization step and later each iteration of a synchronous version of the distance-vector algorithm.
Kurose & Ross, Chapter v, Problem P14.

Consider the network shown below. SUppose AS3 and AS2 are running OSPF for their intra-AS routing protocol. Suppose AS1 and AS4 are running RIP for their intra-AS routing protocol. Suppose eBGP and iBGP are used for the inter-Every bit routing protocol. Initially suppose at that place is no physical link between AS2 and AS4.

a. Router 3c learns about prefix 10 from which routing protocol: OSPF, RIP, eBGP, or iBGP?

b. Router 3a learns about 10 from which routing protocol?

c. Router 1c learns about 10 from which routing protocol?

d. Router 1d learns well-nigh x from which routing protocol?
Kurose & Ross, Affiliate 5, Trouble P15.

Referring to the previous trouble, once router 1d learns about $x$. Information technology will put an entry $(x,I)$ in its forwarding tabular array.

a. Volition $I$ be equal to $I_1$ or $I_2$ for this entry? Explain why in one sentence.

b. Now suppose that at that place is a physical link between AS2 and AS4, shown by the dotted line. Suppose router $1d$ learns that $ten$ is attainable via AS2 also as via AS3. Will $I$ be fix to $I_1$ or $I_2$? Explicate why in 1 sentence.

c. Now suppose there is another As, called AS5, which lies on the path betwixt AS2 and AS4 (not shown in diagram). Suppose router 1d learns that x is accessible via AS2 AS5 AS4 as well as via AS3 AS4. Will $I$ be gear up to $I_1$ or $I_2$ ? Explicate why in one sentence.
Kurose & Ross, Affiliate five, Trouble P16.

Consider the following network.

ISP B provides national courage service to regional Internet access provider A. Isp C provides national backbone service to regional Internet service provider D. Each Internet service provider consists of ane AS. B and C peer with each other in ii places using BGP. Consider traffic going from A to D. B would prefer to paw that traffic over to C on the Westward Coast (and so that C would have to blot the toll of conveying the traffic cross-country), while C would prefer to get the traffic via its East Coast peering indicate with B (so that B would have carried the traffic across the country). What BGP machinery might C use, so that B would paw over A-to-D traffic at its East Coast peering point? To answer this question, y'all will not need to dig into the BGP specification.