Consider a simple graph with unit edge costs. Each node in the graph…
GATE · 2005 · IT
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the routing table is empty. The routing table is synchronously updated as follows. In each updation interval, three tasks are performed.
A node determines whether its neighbours in the graph are accessible. If so, it sets the tentative cost to each accessible neighbour as 1. Otherwise, the cost is set to ∞.
From each accessible neighbour, it gets the costs to relay to other nodes via that neighbour (as the next hop).
Each node updates its routing table based on the information received in the previous two steps by choosing the minimum cost.
Continuing from the earlier problem, suppose at some time t, when the costs have stabilized, node A goes down. The cost from node F to node A at time (t+100) is :
- A.
>100 but finite
- B.
∞
- C.
3
- D.
>3 and ≤100
Attempted by 91 students.
Sign up free to check your answer
Sign up freeLoading lesson…