(10 Points) Suppose datagrams are limited to 1,500 bytes between source Host A and destination Host B. Assuming that IP header is 20-byte and TCP header is 20-byte, how many datagrams would be required to send an MP3 consisting of 10 MB ? Explain how you computed your
(15 Points) Consider the topology shown in Figure. Denote the three subnets with hosts as Networks A, B, and C. Denote the subnets without hosts as Networks D, E, and
Assign network addresses to each of these six subnets, with the following constraints: All addresses must be allocated from 200.150.246/23; Subnet A should have enough addresses to support 250 interfaces; Subnet B should have enough addresses to support 120 interfaces; and Subnet C should have enough addresses to support 120 interfaces. Of course, subnets D, E and F (interior subnets for routers) should each be able to support two interfaces. For each subnet, the assignment should take the form b.c.d/x.
Using your answer to part (a), provide the forwarding tables (using longest prefix matching) for each of the three
(15 Points) Consider the SDN OpenFlow network shown in Figure .
Suppose that the desired forwarding behavior for datagrams arriving at s2 is as follows:
any datagrams arriving on input port 2 from hosts h5 or h6 that are destined to hosts h1 or h2 should be forwarded over output port 1;
any datagrams arriving on input port 1 from hosts h1 or h2 that are destined to hosts h5 or h6 should be forwarded over output port 1;
any arriving datagrams on input ports 1 or 2 and destined to hosts h3 or h4 should be delivered to the host specified;
hosts h3 and h4 should be able to send datagrams to each
Give the flow tables entries at packet switches s1 and s3, such that any arriving datagrams with a source address of h3 or h4 are routed to the destination hosts specified in the destination address field in the IP datagram. (Hint: Your forwarding table rules should include the cases that an arriving datagram is destined for a directly attached host or should be forwarded to a neighboring router for eventual host delivery
(15 Points) Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from x to t and u to Show how the algorithm works by computing a table similar to Table in the book. Define forwarding tables for x and u.
(15 Points) Consider the network shown below, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries at node z.
(15 Points) A router has the following entries in its routing table:
220.127.116.11/22 Interface 0
18.104.22.168/22 Interface 1
22.214.171.124/23 Interface 2
Default Interface 3
For each of the following IP addresses, what does the router do if a packet with that address arrives?
(15 Points) Consider the network shown below. Suppose AS1 AS3 AS2 and AS4 are running OSPF for their intra-AS routing protocol. Suppose eBGP and iBGP are used for the inter-AS routing protocol. Initially suppose there is no physical link between AS2 and AS4.
Router 3c learns about prefix x from which routing protocol?
Router 3b learns about x from which routing protocol?
Router 2a learns about x from which routing protocol?
Router 1d learns about x from which routing protocol ?
Once router 1d learns about x it will put an entry (x, I) in its forwarding table. Will I be equal to I1 or I2 for this entry? Explain
Now suppose that there 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 as via AS3. Will I be set to I1 or I2? Explain
DescriptionIn this final assignment, the students will demonstrate their ability to apply two majorconstructs of the C programming language – Fu
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of