CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Inventions during the Industrial Revolution

Consider a ne...

Question

Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram.

All the router use the distance vector base routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain an entry for each neighbour with the weight of the respective connecting link.
After all the routing tables stabilize, how many links in the network will never be used for carrying any data?

A

2

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

4

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

3

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

1

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A 2

So it is clear visualize from the all routing table construction what we never use the direct path
between
So two links never be used for carrying data.

Suggest Corrections

thumbs-up

2

Similar questions

Q. Consider a network with 6 routers R1 and R6 connected with links having weights as shown in the following diagram.

Suppose the weights of all unused links in the previous question are changed to 2 and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused?

Q. 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 updating interval, three tasks are performed.
(i) A node determines whether its neighbors in the graph are accessible. If so, it sets the tentative cost to each accessible neighbor as 1. Otherwise, the cost is set to

\infty

(ii) From each accessible neighbor, it gets the costs to relay to other nodes via that neighbor (as the next hop).
(iii) Each node updates it routing table based on the information received in the previous two steps by choosing the minimum cost.

For the graph given above, possible routing tables for various nodes after they have stabilized, are shown in the following options. Identify the correct table.

Q. For the network given in the figure below, the routing tables of the four nodes A, E, D and G are shown. Suppose that F has estimated its delay to its neighbors. A, E, D and G as 8, 10, 12 and 6 msec respectively and updates its routing table using distance vector routing technique.

Q. Consider a network with five nodes, N1 to N5, as shown below.

The network uses a Distance Vector Routing protocol. Once the routes have stabilized, the distance vectors at different nodes are as following.
N1: (0, 1, 7, 8, 4)
N2: (1, 0, 6, 7, 3)
N3: (7, 6, 0, 2, 6)
N4: (8, 7, 2, 0, 4)
N5: (4, 3, 6, 4, 0)
Each distance vector is the distance of the best known path at that instance to nodes, N1 to N5, where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both directions. In each round, all nodes exchange their distance vectors with their respective neighbors. Then all nodes update their distance vectors. In between two rounds any change in cost of a link will cause the two incident nodes to change only that entry in their distance vectors.

The cost of link N2-N3 reduces to 2(in both directions). After the next round of updates, what will be the new distance vector at node: N3?

Q. Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links.
S1: The computational overhead in link state protocols in higher than in distance vector protocols.
S2 : A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol.
S3 : After a topology change, a link state protocol will converge faster than a distance vector protocol.
Which one of the following is correct about S1, S2 and S3?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Inventions during the Industrial Revolution

HISTORY

Watch in App

explore_more_icon

Explore more

Inventions during the Industrial Revolution

Standard IX History

Join BYJU'S Learning Program

CrossIcon