The method of network routing where every possible path between transmitting and receiving DTE is used is called ……………

Related MCQs

• In distance vector routing algorithm, each router maintains a separate routing table with the following entries.
• In distance vector routing algorithm, the routing tables are updated …………………
• If router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route is known as ………………..
• If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as……………..
• In Hierarchical routing, the routers are divided into what is called as ……………..
• ……………. do not base their routing decisions on measurements or estimates of the current traffic and topology.
• Adaptive routing algorithms get their information from ………….
• In Hierarchical routing for N router subnet, the optimal number of levels is …………..
• …………….. change their routing decisions to reflect changes in the topology.
• The regions in Hierarchical routing are grouped in to ……………..