EE450 Fall 2011, Professor Zahid Homework #5 Due Tuesday, November 29

-----------------------------------------------------------------------------------------------------------All on-campus students must submit the homework to Professor Zahid before or during lecture class on the due date (no electronic submission whatsoever). DEN remote students have until Wednesday noon following the above due date, (i.e. November 30, 12pm) to submit to DEN via fax or email. For questions regarding HW problems, please see the TAs during office hours or contact them by email (with EE450 in your subject line) and CC the email to Professor.

-----------------------------------------------------------------------------------------------------------Reading Assignment: Chapter 4, sections 4.3 through 4.6. Also chapter 5, section 5.6 #1: Suppose the fragments of Figure 4.5 (b) all pass through another router onto a link with an MTU of 380 bytes, not counting the link header. Show the fragments produced. If the packet were originally fragmented for this MTU, how many fragments would be produced? (10 points)
(a) Start of Header Ident=x 0 Offset=0

Rest of Header 1400 data bytes (b) Start of Header Ident=x 1 Offset=0

Rest of Header 512 data bytes Start of Header Ident=x 1 Offset=64

Rest of Header 512 data bytes Start of Header Ident=x 0 Offset=128

Rest of Header 376 data bytes Figure 4.5 Header fields used in IP fragmentation: (a) unfragmented packet; (b) fragmented packets

#2: Construct a Spanning-tree topology computed by the spanning tree algorithm for the interconnected LAN shown below. Assume B1 is the Root Bridge. Go through the process in detail (Final answer alone without showing the steps of the process is of little importance). Note that the ports for each bridge are numbered as shown in the Figure.

You may assume equal and unit cost for ports of all bridges. Use the symbol R to indicate a Root Port and the Symbol D to indicate a Designated Port. (10 points) (The numbers in parenthesis next to ports are port numbers, NOT costs.)
LAN1

(1)

(1)

B1
(2)
LAN2

B2
(2) (1) (1)

B4
(2)
LAN3

B3
(2) (3) (1)

B5
(2)
LAN4

#3: 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:
Destination Address Range 11100000 00000000 00000000 00000000 through 11100000 11111111 11111111 11111111 11100001 00000000 00000000 00000000 through 11100001 00000000 11111111 11111111 11100001 00000001 00000000 00000000 through 11100001 11111111 11111111 11111111 otherwise Link Interface

a. Provide a forwarding table that has four entries, uses longest prefix matching and forwards packets to the correct link interfaces. (3 points) b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses: (3 points)
11001000 10010001 01010001 01010101 11100001 00000000 11000011 00111100 11100001 10000000 00010001 01110111

#4: Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table:
Prefix match 00 01 10 11 Interface 0 1 2 3

For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range. (8 points) #5: Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table:
Prefix match 1 11 111 otherwise Interface 0 1 2 3

For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range. (8 points)

#6: Consider a router that interconnects three subnets: Subnet1, Subnet2, and Subnet3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.1.17/24. Also suppose that Subnet1 is required to support up to 60 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints. (6 points) #7: Consider a subnet with prefix 101.101.101.64/26. Give an example of one IP address (of 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 four subnets? (8 points)

#8: Consider the following network.with the indicated link costs, use Dijkstras shortestpath algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to Table 4.3. (10 points)

6 1
F

8
B D 2

Figure for problems 9, 10 and 11

#9: For the above network, give global distance-vector tables when: a) Each node knows only the distances to its immediate neighbors. b) Each node has reported the information it had in the preceding step to its immediate neighbors. c) Step (b) happens a second time. (12 points) #10: For the above network, show how the link-state algorithm builds the routing table for node D. (10 points) #11: For the above network, suppose the forwarding tables are all established as in Exercise 9 and then the C-E link fails. Give a) The tables of A, B, D and F after C and E have reported the news. b) The tables of A and D after their next mutual exchange. c) The table of C after A exchanges with it. (12 points)