Scribd
Upload
2 views2 pages

Problem Set 4

The document contains a problem set with five networking problems related to routing tables, IP address allocation, TCP message fragmentation, Dijkstra's shortest path algorithm, and distance vector routing. Each problem requires the application of networking concepts to determine routing actions, address assignments, IP header fields, shortest paths, and updated routing tables. The problems involve calculations and logical reasoning based on given parameters and network configurations.

Uploaded by

Rahul Das
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Problem Set 4

The document contains a problem set with five networking problems related to routing tables, IP address allocation, TCP message fragmentation, Dijkstra's shortest path algorithm, and distance vector routing. Each problem requires the application of networking concepts to determine routing actions, address assignments, IP header fields, shortest paths, and updated routing tables. The problems involve calculations and logical reasoning based on given parameters and network configurations.

Uploaded by

Rahul Das
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Problem Set-4

Problem.1 A router has the following (CIDR) entries in its routing table:

Address/mask Next hop


[Link]/22 Interface 0
[Link]/22 Interface 1
[Link]/23 Router 1
default Router 2
For each of the following IP addresses, what does the router do if a packet with that
address arrives?
a. [Link]
b. [Link]
c. [Link]
d. [Link]
e. [Link]

Problem.2 A large number of consecutive IP address are available starting at [Link].


Suppose that four organizations, A, B, C, and D, request 4000, 2000, 4000, and 8000 addresses,
respectively, and in that order. For each of these, give the first IP address assigned, the last IP
address assigned, and the mask in the w.x.y.z/s notation.

Problem.3 Suppose that host A is connected to a router R 1, R 1 is connected to another router,


R 2, and R 2 is connected to host B. Suppose that a TCP message that contains 900 bytes of data
and 20 bytes of TCP header is passed to the IP code at host A for delivery to B. Show the Total
length, Identification, DF, MF, and Fragment offset fields of the IP header in each packet
transmitted over the three links. Assume that link A-R1 can support a maximum frame size of
1024 bytes including a 14-byte frame header, link R1-R2 can support a maximum frame size of
512 bytes, including an 8-byte frame header, and link R2-B can support a maximum frame size
of 512 bytes including a 12-byte frame header.
Problem.4 Consider the network shown below, with the indicated link costs. Use Dijkstra's
shortest path algorithm to compute the shortest past from F to all network nodes. Show all the
iteration in different steps.

Figure-1

Problem.5 Consider the subnet of Fig. 2. Distance vector routing is used, and the following
vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and
from E: (7, 6, 3, 9, 0, 4). The measured delays to B, D, and E, are 6, 3, and 5, respectively. What
is C's new routing table? Give both the outgoing line to use and the expected delay.

Figure-2

You might also like