Consider Again the Sdn Openflow Network Shown

Network Layer

Kurose & Ross, Affiliate four, Trouble P4.

Consider the switch shown below. Suppose that all datagrams have the same fixed length, that the switch operates in a slotted, synchronous manner, and that in 1 time slot a datagram can exist transferred from an input port to an output port. The switch fabric is a batten so that at most 1 datagram can be transferred to a given output port in a time slot, but dissimilar output ports can receive datagrams from different 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 whatever input queue scheduling order you want (i.east., it need not accept HOL blocking)? What is the largest number of slots needed, assuming the worst-case scheduling order y'all tin devise, bold that a non-empty input queue is never idle?
Kurose & Ross, Chapter 4, Problem P5.

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

a. Provide a forwarding table that has 5 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 4, Problem P8.

Consider a router that interconnects iii subnets: Subnet ane, Subnet 2, and Subnet iii. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.1.17/24. Also suppose that Subnet 1 is required to support at least 62 interfaces, Subnet ii is to support at least 95 interfaces, and Subnet three is to back up at least 16 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints.
Kurose & Ross, Chapter 4, 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 iv, Problem P19.

Consider the SDN OpenFlow network prove below.

Suppose that the desired forwarding behavior for datagrams arriving at s2 is every bit follows:
- any datagrams arriving on input port one from hosts h5 or h6 that are destinated to hosts h1 or h2 should be 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;
- whatsoever arriving datagrams on input ports ane or ii and destned to hosts h3 or h4 should exist deliverd to the host specified;
- hosts h3 and h4 shoul dbe able to send datagrams to each other.
Specify the period table entries in s2 that implement this forwarding behavior.
Kurose & Ross, Chapter 4, Trouble P22.

Consider again the SDN OpenFlow network shown above. Suppose nosotros want switch s2 to function equally a firewall. Specify the flow table in s2 that implements the post-obit firewall behaviors (specify a different flow table for each of the iv firewalling behaviors below) for delivery of datagrams destined to h3 and h4. Y'all do not demand to specify the forwarding beliefs in s2 that forwards traffic to other routers.

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

b. Merely TCP traffic is allowed to be 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. Only UDP traffic from h1 and destined to h3 is to be delivered. All other traffic is blocked.
Kurose & Ross, Chapter 5, Problem P8.

Consider the 3-node topology shown below. Rather than having the link costs shown in the figure, the link costs are c(10,y) = 3, c(y,z) = half dozen, c(z,10) = four. Compute the altitude tables subsequently the initialization step and after each iteration of a synchronous version of the distance-vector algorithm.
Kurose & Ross, Chapter 5, Trouble 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-Every bit routing protocol. Suppose eBGP and iBGP are used for the inter-Equally routing protocol. Initially suppose there is no concrete link betwixt AS2 and AS4.

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

b. Router 3a learns almost ten from which routing protocol?

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

d. Router 1d learns nearly x from which routing protocol?
Kurose & Ross, Affiliate 5, Problem P15.

Referring to the previous problem, once router 1d learns about $10$. It will put an entry $(x,I)$ in its forwarding table.

a. Will $I$ be equal to $I_1$ or $I_2$ for this entry? Explain why in ane 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 $10$ is attainable via AS2 also as via AS3. Will $I$ exist set to $I_1$ or $I_2$? Explain why in one sentence.

c. Now suppose there is another Equally, chosen AS5, which lies on the path betwixt AS2 and AS4 (not shown in diagram). Suppose router 1d learns that x is attainable via AS2 AS5 AS4 every bit well as via AS3 AS4. Will $I$ exist set up to $I_1$ or $I_2$ ? Explain why in i sentence.
Kurose & Ross, Chapter 5, Problem P16.

Consider the following network.

Isp B provides national courage service to regional Internet access provider A. Internet access provider C provides national backbone service to regional Internet service provider D. Each ISP consists of one AS. B and C peer with each other in two places using BGP. Consider traffic going from A to D. B would prefer to manus that traffic over to C on the West Coast (so that C would take to absorb the cost of carrying the traffic cross-country), while C would adopt to get the traffic via its East Coast peering betoken with B (and then that B would take carried the traffic across the country). What BGP machinery might C use, and then that B would mitt over A-to-D traffic at its East Coast peering point? To reply this question, yous will not demand to dig into the BGP specification.