Fall 2016 CSE30264 Homework 4


Total Points: 60 points
Scope: Chapters 3
Due: November 28, 2016 by class time
Grouping: To be completed individually

Problems

Problem 1: [15 points] Suppose the fragments of the following figure all pass through another router onto a link with a MTU of 268 bytes. Show the fragments produced. If the packets were originally fragmented for this MTU, how many fragments would be produced? Note: The MTU includes the IP header (20 bytes) and the IP datagram payload.


Problem 2: [15 points, 3 points for each sub-question] Suppose a router has built up the routing table shown in the table below. The router can deliver packets directly over interfaces 0 and 1, or it can forward packets to routers R2, R3 or R4. Describe what the router does with a packet addressed to each of the following destinations:
  1. 128.64.72.71

  2. 128.65.73.61

  3. 128.64.72.151

  4. 192.143.155.7

  5. 192.143.155.80



Problem 3: [18 points, 6 points for each sub-question] For the network given as follows, give the global distance vector tables when using Distance Vector Routing Algorithm for the following three instances. (See tables 3.10 and 3.13 in the textbook as examples.)
  1. Each node knows only the distances to its immediate neighbors

  2. Each node has reported the information it had in the preceding step to its immediate neighbors

  3. Step (b) happens a second time



Problem 4: [12 points] For the network given as follows, show how the link-state algorithm builds the routing table for node A.


Submission Instructions

Create a PDF file containing your answers. Place your name at the beginning of the file. Copy the file into dropbox/hw4/hw4.pdf.