Question
a.
Bellman Ford algorithm
b.
DES algorithm
c.
Dijkstra's algorithm
d.
Leaky bucket algorithm
Posted under Networking
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. In link state routing, after the construction of link state packets new routes are computed using .....................
Similar Questions
Discover Related MCQs
Q. Count-to-Infinity problem occurs in .....................
View solution
Q. In distance vector routing algorithm, each router maintains a separate routing table with the following entries.
View solution
Q. Link state packets are built in ....................
View solution
Q. In which routing method do all the routers have a common database?
View solution
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
Suggested Topics
Are you eager to expand your knowledge beyond Networking? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!