CS 549: Performance Analysis of Computer Networks

Theory Assignment 3

Assigned: April 4, 2024 Due: April 10, 2024

Write your answers by hand on plain paper, scan and submit on Moodle.
Descriptive answers must be written in your own words, copying verbatim from the
textbook will not fetch you any marks.
1. The connectivity digraph of a wireless multi-hop network is given below. Write
the graph theoretic representation G(N , E) of this network, giving the nodes
and the edges. Divide the edges into maximally independent sets that can be
used for link scheduling, and give the underlying link activation constraints.

1 2

3 4

2. Discuss how the hierarchical organization of the Internet has made it possible
to scale to billions of hosts. Justify your answer with calculations based on
approximate numbers.
3. Explain the count-to-infinity that problem with an example.
4. Visit a host that uses DHCP to obtain its IP address, network mask, default
router, and the IP address of its local DNS server. List these values.
5. For the following network, hand-simulate Dijkstra’s algorithm for node A. For
each iteration show the update in distance and predecessor for each node. Give
the shortest path from A to every node in the network.

b
3 4
2
1
a c e
1 3

1
6. Consider the network shown below, and assume that each node initially knows
the costs to each of its neighbours. Consider the distance-vector algorithm and
show the distance table entries at all the nodes after each iteration.

1
u v
6
2 3
2 z
y 3
x