NWC203(04)

Which of following describe benefits of flooding, a specialized routing approach?

• 1 / 1 point
  a. Useful in propagating information to all nodes

• b. All of the above

• c. No routing table needed for routers

• d. Always reach the destination by the fastest path

A Virtual-Circuit Network (VCN) is normally implemented in the

• a. session layer

• b. data link layer

• c. network layer

• d. Physical layer

In routing approaches, which of the following statement is true for deflection routing (2 answers)

• a. Fixed, preset routing procedures

• b. No route synthesis

• c. Useful in starting up network

• d. Predefined source to destination route

To reduce size of routing table, routers do lookup table on MAC address

• T

• F

Flooding may easily swamp the network as one packet creates multiple packets, possibly in exponential growth rate. What are possible means to reduce resource consumption in the network?

• a. Use a time-to-live field in each packet to limit its lifetime

• b. Add a unique identifier to a packet for removing its duplicate

• c. Use address and sequence number to discard duplicates

• d. All of the above

What are possible metrics for routing?

• a. Hop count

• b. Delay

• c. Bandwidth

• d. All of the above

  
  

Consider the network as shown in the figure. We use the Bellman-Ford algorithm to find the set of shortest paths from all nodes to the destination node 2. Each node maintains an entry (n, cost) about the next node along the current shortest path and the current minimum cost from the node to the destination. Initially, each node has entry (-1, infinity).

In the first algorithm iteration, which nodes will update their entries and inform their neighbors? (2 answers)

• 1

• 2

• 5

• d. All of the above

Following the above question, in the second algorithm iteration, which nodes will update their entries and inform their neighbors?

• 3

• 4

• 6

• d. All of the above

Following the above question, in the third algorithm iteration, which nodes will update their entries and inform their neighbors?

• 3

• 4

• 6

• d. All of the above

n link state routing, after the construction of link state packets new routes are computed using

• a. Dijkstra's algorithm

• b. Bellman Ford algorithm

• c. Leaky bucket algorithm

• d. None of the above