Q. In distance vector routing algorithm, the routing tables are updated .....................

View solution

Q. Distance vector routing algorithm is implemented in Internet as ........................

View solution

Q. Which of the following routing algorithm takes into account the current network load.

View solution

Q. In distance vector routing the delay metric is ...................

View solution

Q. In AODV routing algorithm for MANETs, the route is discovered at time

View solution

Q. In multicast routing with spanning tree method, a network with n groups, each with an average of m members, for each group we require ....................

View solution

Q. To do multicast routing, each router computes a .....................

View solution

Q. A well -defined groups that are numerically large in size but small compared to the network as a whole are used in .......................

View solution

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