Q. The processes that keep track of hosts whose home is in the area, but who currently visiting another area is .................

View solution

Q. In ................... to send a multicast message a host sends it to the core, which then does the multicast along the spanning tree.

View solution

Q. Sending a packet to all destinations simultaneously is called ...................

View solution

Q. A normal Flooding technique is an example of ..................

View solution

Q. In Broadcast routing, if the router does not know anything all about spanning tree, ................... method is preferred.

View solution

Q. The method of Broadcast routing in which each packet contains either a list of destinations or a bit map indicating the desired destinations is ...................

View solution

Q. Sending a message to a well defined group that are numerically large in size but small compared to the network as a whole is called ...................

View solution

Q. ................ do not base their routing decisions on measurements or estimates of the current traffic and topology.

View solution

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

View solution

Q. In Hierarchical routing, the routers are divided into what is called as .................

View solution

Q. The regions in Hierarchical routing are grouped in to .................

View solution

Q. If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as .................

View solution

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