1.

Consider sending a 1460 byte IP datagram into a link that has an MTU of 420
bytes. Determine the values of the length field and the offset field in each fragment.

2. Describe how loops in paths can be detected in BGP.

3. Consider a subnet with prefix 101.101.101.64/26. Give an example of one IP

address (of the form xxx.xxx.xxx.xxx) that can be assigned to this network. Suppose
an ISP owns the block of addresses of the form 101.101.128/17. Suppose it wants to
create four subnets from this block, with each block having the same number of IP
addresses. What are the prefixes (of form a.b.c.d/x) for the subnets?

4. Consider a network using the link state and consider that router E receives the
following link state packets from other routers in the network
Link-state packet from Neighbor nodes (Link Cost)

y v(1) t (4) x (6)

t v (9) y (4) s (1) u (2)

s t (1) u (4)

x y (6) v (3) w(1)

w x (1) v (1) u (3)

u w (3) v (1) t (2) s (4)

a) Construct the network topology from this table.
b) From the topology you have constructed, use Dijkstra’s algorithm to compute the
shortest path from node x to all other nodes in the network (Show your steps).
c) Assume now that router x received the same LSPs as node t. If x sends a TCP packet
to router t, does the ACK packet from t to x take the same path as the TCP packet?
Why?

5. Consider the network fragment shown below. Switch X has only two attached
neighbors, W and Y. W has a minimum-cost path to destination A (not shown) of 6,
and Y has a minimum-cost path to A of 5. The complete paths from W and Y to A
(and between W and Y) are not shown. All link costs in the network have strictly
positive integer values.
a) Give X’s distance table (row) entries for destinations W, Y, and A.
b) How to change c(X,W) or c(X,Y) will cause X to inform its neighbors of a new
minimum-cost to A as a result of executing lines 15 and 24 of the distance vector
algorithm in the textbook? Give the result of new minimum-cost and new minimum-
cost path.
c) How to change c(X,W) or c(X,Y) will not cause X to inform its neighbors of a new
minimum-cost to A as a result of executing lines 15 and 24 of the distance vector
algorithm in the textbook?