CS/ECE438 Homework #3

Fall 2016
Due: 11:30 a.m. on Nov 30 on Compass
1: Routing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 points
Consider the following network topology.

(a) Compute routing tables for nodes D, B and E using the distance vector algorithm.
The table rows should include a Destination, Distance, and Next Hop.
(b) Now consider a situation in which link between the D-C becomes congested and its
costs become 30. List a sequence of updates to routing tables at nodes B and D, in
order, until the routing tables converge.
2: DHCP and NAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 points
Alice and Bob are neighbors and they each buy a new home wireless router. After
connecting each of their laptops to the router they each enter the command hostname -i,
which prints out their IP address.
(a) Describe the process how they get the IP address.
1

(b) After doing this they find that they actually have the same IP address. How is this
possible?
(c) Give one reason that wide-spread deployment of IPv6 would let them get rid of
their NAT device.
(d) Give one reason that they might want to continue using their NAT even if they
could use IPv6.
(e) (Optional) Do you have IPv6 on your home wireless router? How does it work with
NAT?
3: Subnet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 points
Suppose a router has built up the routing table shown below. The router can deliver
packets directly over interfaces 0 and 1, or it can forward packets to routers R2, R3, or R4.

Subnet Number
128.96.39.0
128.96.39.128
128.96.40.0
192.4.153.0
default

Subnet Mask
Next hop
255.255.255.128 Interface 0
255.255.255.128 Interface 1
255.255.255.248
R2
255.255.255.192
R3
R4

Describe what the router does with a packet addressed to each of the following destinations:
1. 128.96.39.10
2. 128.9.40.12
3. 128.96.40.151
4. 192.4.153.17
5. 192.4.153.90
4: SDN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 points
Consider the SDN OpenFlow network shown below. Suppose we want switch s2 to
function as a firewall. Specify the flow table in s2 that implements the following firewall
behaviors(specify a different flow table for each of the four firewalling behaviors below) for
delivery of datagrams destined to h3 and h4. You do not need to specify the forwarding
behavior in s2 that forwards traffic to other routers.

Page 2

(a) Only traffic arriving from hosts h1 and h6 should be delivered to hosts h3 or h4.
(b) Only TCP traffic is allowed to be delivered to hosts h3 or h4.(i.e., that UDP traffic
is blocked.)
(c) Only traffic destined to h3 is to be delivered (i.e., all traffic to h4 is blocked.)
(d) Only UDP traffic from h1 and destined to h3 is to be delivered. All other traffic is
blocked.
5: BGP. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .10 points

Page 3

Above figure represents relationship between ASes. The vertices are individual ASes
and edges are links between them and IP is the prefix from AS X. Also suppose that
arrows represent customer-provider relationships where the customer points to its
provider. An edge without arrows represents a link between peers.
(a) Suppose all ASes follow local preference rules that enforce valley-free paths: any
path must follow a sequence of zero or more provider links, followed by at most one
peer link, followed by a sequence of customer links. List the routes that each As
will follow to reach X in a valley-free manner.
(b) Suppose AS V does not like AS W . Using only BGP, is it possible for AS V to
implement a policy stating that traffic outbound from my AS should not cross W
? Why or why not?
(c) Suppose AS W does not like AS X. Using only BGP, is it possible for AS W to
implement a policy to not forward traffic from X? Why or why not?
6: TCP windows . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 points
Consider a 1 Gbps link that has a 100 ms round-trip time.
(a) How long will it take for the TCP connection to reach (approximately) full utilization using slow start? Assume one MSS is 1500 bytes.
(b) How long would it take for it to reach full utilization if AIMD were used, starting
with a congestion window of 1 MSS?
Total: 38 points

Page 4