Q. The _________ routing uses the Dijkstra algorithm to build a routing table.

View solution

Q. The Open Shortest Path First (OSPF) protocol is an intradomain routing protocol based on _______ routing.

View solution

Q. The _______ protocol allows the administrator to assign a cost, called the metric, to each route.

View solution

Q. In OSPF, a ________ link connects two routers without any other host or router in between.

View solution

Q. In OSPF, a _______ link is a network with several routers attached to it.

View solution

Q. In OSPF, a ________ link is a network is connected to only one router.

View solution

Q. In OSPF, when the link between two routers is broken, the administration may create a _________ link between them using a longer path that probably goes through several routers.

View solution

Q. In ________ routing, we assume that there is one node (or more) in each autonomous system that acts on behalf of the entire autonomous system.

View solution

Q. ___________ is an interdomain routing protocol using path vector routing.

View solution

Q. To create a neighborhood relationship, a router running BGP sends an ________ message.

View solution

Q. An area is _______.

View solution

Q. A one-to-all communication between one source and all hosts on a network is classified as a _______ communication.

View solution

Q. A one-to-many communication between one source and a specific group of hosts is classified as a _______ communication.

View solution

Q. A one-to-one communication between one source and one destination is classified as a _______ communication.

View solution

Q. In ______, the router forwards the received packet through only one of its interfaces.

View solution

Q. In _______, the router may forward the received packet through several of its interfaces.

View solution

Q. Emulation of ________ through ___________ is not efficient and may create long delays.

View solution

Q. In unicast routing, each router in the domain has a table that defines a ______ path tree to possible destinations.

View solution

Q. In multicast routing, each involved router needs to construct a ________ path tree for each group.

View solution

Q. In the _______ tree approach, each router needs to have one shortest path tree for each group.

View solution