Routing Part1

Dijkstra’s Algorithm is used by which protocol?

• RIP

• OSPF

• BGP

When does Count-to-infinity happen?

• A shorter link cost is found

• A longer link cost is found

• A link is broken

Never advertise a destination through its next hop is the principle of which one?

• Poison Reverse

• Split Horizon

• Count-to-Infinity

• Convergence

Dijkstra's Algorithm is used for?

• Calculate the shortest path

• Reliable Flooding

• Avoid a broken link

• Three-node instability

In which mechanism, Router A will advertise the router that it knows from its neighbor back but specifying the infinity cost?

• Count-to-Infinity

• Split Hozion

• Poison Reverse

• Three-node Instability

Which protocol that each router must have the complete knowledge about all other routers in the same network?

• RIP

• OSPF

Which protocol takes the longer time until the convergence?

• RIP

• OSPF

Which protocol has the load balancing feature?

• RIP

• OSPF

• BGP