Scribd
Upload
2 views

ProblemSetRouting

The document contains an assignment for EE 706, consisting of multiple questions related to network routing algorithms, including true/false statements about flooding and the Bellman-Ford algorithm, as well as practical problems involving Dijkstra's algorithm and minimum cost spanning trees. It also includes tasks that require examples to illustrate concepts such as the effect of adding a constant to edge costs and the count-to-infinity problem. Additionally, there are questions that involve analyzing specific network figures to determine shortest paths and broadcast behavior.

Uploaded by

bhavik
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

ProblemSetRouting

The document contains an assignment for EE 706, consisting of multiple questions related to network routing algorithms, including true/false statements about flooding and the Bellman-Ford algorithm, as well as practical problems involving Dijkstra's algorithm and minimum cost spanning trees. It also includes tasks that require examples to illustrate concepts such as the effect of adding a constant to edge costs and the count-to-infinity problem. Additionally, there are questions that involve analyzing specific network figures to determine shortest paths and broadcast behavior.

Uploaded by

bhavik
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Spring 2018

EE 706
Assignment 3

Q 1 State whether the following statements are true or false and justify your answer.
(a) Flooding is a very inefficient way to route packets and therefore it is never used.
(b) Flooding is an efficient way to route packets if the network topology does not have a loop, as
packets will never loop the network.
(c) If flooding is used in an IP network, loops can be avoided by decrementing the time-to-live (TTL)
field in the IP header and dropping packets whose TTL is 0.
(d) In a connected network (i.e., if there is a path between every pair of end hosts), flooding ensures
every destination sees every packet.
(e) If the longest loop free path in the network is N , then the Bellman Ford routing algorithm will
converge to the lowest cost spanning tree after N iterations.
(f) As an optimization in Bellman Ford, a router need not send any advertisements to its neighbors
after the distance drops from infinity to a finite value.
(g) For the Bellman Ford algorithm if we set “infinity” to be equal to 16. if the longest loop-free
path in the network is 25, the algorithm is guaranteed to converge to the correct solution.
(h) Unlike the Bellman Ford algorithm, Dijkstra’s algorithm does not suffer from the “count to
infinity” problem.

Q 2 Refer to Figure 1 to answer the following questions–


(a) What is the first node that is added to the shortest path tree starting at E?
(b) If E wants to reach A, what will its next hop be?

Figure 1: Figure for Q 2.

Q 3 Show by example that a shortest path between two given nodes in a directed graph with given
edge costs does not necessarily remain a shortest path if the same constant is added to every edge
cost.

Q 4 Let G = (N, E) be an undirected graph. Show that T is a minimum cost spanning tree (MST)
in G with edge costs c(e) : e ∈ E if and only if it is a MST in G with edge costs c(e) + k : e ∈ E,
where k is an arbitrary real number. Thus, an MST in a graph with given edge costs remains an
MST if the same constant k is added to every edge cost.

Q 5 Give an example of incorrect operation of Dijkstra’s algorithm in a network in which edge costs
are allowed to take negative values.

1
Figure 2: Figure for Q 6.

Q 6 For the network in Figure 2,


(a) Using Dijkstra’s algorithm, find minimum-cost paths to node 6 from every other node.
(b) Show the steps of applying Bellman-Ford algorithm with node 6 as the destination node.

Q 7 Give an example in which the Bellman-Ford algorithm with poisoned reverse is used and the
“count-to-infinity” problem still occurs. Assume that all edge costs are positive.

Q 8 Using Dijkstra’s algorithm, find minimum-cost paths to node D from every other node in the
network in Figure 3.

Figure 3: Figure for Q 8.

Q 9 Consider a network in which all nodes are connected to three other nodes. In a single time
step, a node can receive all transmitted broadcast packets from its neighbors, duplicate the packets,
and send them to all of its neighbors (except to the node that sent a given packet). At the next
time step, neighboring nodes can receive, duplicate, and forward these packets, and so on. Suppose
that uncontrolled flooding is used to provide broadcast in such a network. At time step t, how
many copies of the broadcast packet will be transmitted, assuming that during time step 1, a single
broadcast packet is transmitted by the source node to its three neighbors. (Kurose and Ross, 6th
edition, Chapter 4: P52)

You might also like