Q. In shortest path routing algorithm, the path length is measured based on .................

View solution

Q. Flooding always choose the ....................

View solution

Q. In military applications where large number of routers may be blown to bits at any instant, we use ...................

View solution

Q. In distributed applications, it is sometimes necessary to update all the databases concurrently, we use .......................

View solution

Q. The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as .................

View solution

Q. Adaptive routing algorithms get their information from .............

View solution

Q. If the route from I to J is computed in advance, off line, and downloaded to the routers when the network is booted is called as ...................

View solution

Q. In Hierarchical routing for N router subnet, the optimal number of levels is ..............

View solution

Q. The router algorithm takes the decision to changes the route when .................

View solution

Q. If route from router I to router J is computed on line based on the current statistics, then it is called as ....................

View solution

Q. If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as.................

View solution

Q. ................. change their routing decisions to reflect changes in the topology.

View solution

Q. If router J is on the optimal path from router I to router K, then the path from J to K along the same route is ..................

View solution

Q. 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 ....................

View solution

Q. If a datagram router goes down then ..............

View solution

Q. In datagram subnet new route is chosen .....................

View solution

Q. The PSTN is an example of a ..................... network.

View solution

Q. Each packet is routed independently in ...................

View solution

Q. A station in a network forwards incoming packets by placing them on its shortest output queue. What routing algorithm is being used?

View solution

Q. Eight stations are competing for the use of a shared channel using the 'Adaptive tree Walk Protocol'. If the stations 7 and 8 are suddenly become ready at once, how many bit slots are needed to resolve the contention?

View solution