Consider Again the Sdn Openflow Network Shown in Figure 430 Longest Prefix Match

Network Layer

Kurose & Ross, Chapter 4, Trouble P4.

Consider the switch shown below. Suppose that all datagrams take the same stock-still length, that the switch operates in a slotted, synchronous style, and that in one fourth dimension slot a datagram can be transferred from an input port to an output port. The switch fabric is a crossbar so that at near one datagram tin be transferred to a given output port in a fourth dimension slot, but unlike output ports tin receive datagrams from different input ports in a single fourth dimension slot. What is the minimal number of fourth dimension slots needd to transfer the packets shown from input ports to their output pots, assuming any input queue scheduling gild you want (i.due east., information technology need non have HOL blocking)? What is the largest number of slots needed, assuming the worst-example scheduling order you can devise, assuming 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 three, 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. Draw how your forwarding tabular array determines the advisable 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 2, and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.i.17/24. Too suppose that Subnet 1 is required to support at least 62 interfaces, Subnet 2 is to support at least 95 interfaces, and Subnet 3 is to support at least 16 interfaces. Provide iii network addresses (of the form a.b.c.d/10) that satisfy these constraints.
Kurose & Ross, Chapter 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(due south) generated related to fragmentation?
Kurose & Ross, Chapter 4, Problem P19.

Consider the SDN OpenFlow network show below.

Suppose that the desired forwarding behavior 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 be forwarded over output port two;
- any 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 ane;
- any arriving datagrams on input ports 1 or 2 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, Problem P22.

Consider again the SDN OpenFlow network shown to a higher place. Suppose we want switch s2 to office as a firewall. Specify the menstruation tabular array in s2 that implements the following firewall behaviors (specify a different flow tabular array for each of the four firewalling behaviors below) for delivery of datagrams destined to h3 and h4. Yous do not need to specify the forwarding behavior in s2 that forward traffic to other routers.

a. Simply 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 be delivered to hosts h3 or h4 (i.e., that UDP traffic is blocked).

c. But traffic destined to h3 is to exist 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, Affiliate 5, Problem P8.

Consider the 3-node topology shown beneath. Rather than having the link costs shown in the effigy, the link costs are c(x,y) = 3, c(y,z) = 6, c(z,ten) = 4. Compute the distance tables later on the initialization step and after each iteration of a synchronous version of the distance-vector algorithm.
Kurose & Ross, Chapter 5, 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-AS routing protocol. Initially suppose there is no concrete link between AS2 and AS4.

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

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

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

d. Router 1d learns about x from which routing protocol?
Kurose & Ross, Chapter five, Problem P15.

Referring to the previous problem, once router 1d learns almost $x$. It volition 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 one judgement.

b. Now suppose that in that location is a physical link between AS2 and AS4, shown by the dotted line. Suppose router $1d$ learns that $x$ is accessible via AS2 as well equally via AS3. Volition $I$ be set up to $I_1$ or $I_2$? Explicate why in ane judgement.

c. At present suppose there is another Equally, chosen AS5, which lies on the path between AS2 and AS4 (non shown in diagram). Suppose router 1d learns that x is accessible via AS2 AS5 AS4 equally well as via AS3 AS4. Will $I$ exist set up to $I_1$ or $I_2$ ? Explain why in one sentence.
Kurose & Ross, Chapter 5, Trouble P16.

Consider the following network.

Internet access provider B provides national backbone service to regional Isp A. Internet access provider C provides national courage service to regional Isp D. Each ISP consists of one Equally. B and C peer with each other in two places using BGP. Consider traffic going from A to D. B would prefer to hand that traffic over to C on the Westward Coast (so that C would have to absorb the toll of conveying the traffic cantankerous-land), while C would adopt to go the traffic via its East Coast peering bespeak with B (so that B would have carried the traffic across the country). What BGP mechanism might C use, so that B would hand over A-to-D traffic at its Due east Coast peering betoken? To answer this question, y'all will not need to dig into the BGP specification.