“Routing” and “forwarding” are interchangeable terms.
True/False
False
Consider a source and destination host. Before packets leave the source host, the host needs to define the path over which the packets will travel to reach the destination host.
True/False
False
What does intradomain routing refer to?
Routing that takes place among routers that belong to the same administrative domain
What is interdomain routing?
Routing that takes place among routers that belong to different administrative domains
Consider the link-state routing protocol. The link costs are known to all nodes.
True/False
True
Consider the link-state routing protocol. The network topology is known to all nodes.
True/False
True
What is the goal of the link-state routing protocol algorithm from a source node u?
To compute the least-cost paths from the source node u to every other node in the network
How do we initialize the least-cost path in the link-state routing protocol from node u?
The cost of the direct links for directly attached neighbors, and infinity for non-directly attached neighbors
The distance vector (DV) routing algorithm continues iterating as long as what occurs?
Neighbors send new updates to each other
The distance vector (DV) routing algorithm is an example of a \______________ algorithm.
decentralized
The distance vector (DV) routing algorithm requires synchronization between routers.
True/False
False
In the distance vector (DV) routing algorithm, each node maintains and updates its own view of the network.
True/False
True
Which equation is used by each node to update the node’s distance vector in the DV routing algorithm?
The Bellman Ford equation
The count-to-infinity problem states that good news (e.g., a decrease in a link cost) propagates slowly among nodes in the network.
True/False
True
The poison reverse technique solves the count-to-infinity problem for all network topologies
True/False
False
The Routing Information Protocol (RIP) is based on which protocol?
The Distance Vector protocol
Open Shortest Path First (OSPF) is based on which type of routing algorithm?
The link state routing algorithm
The number of egress points that a network has is upper bounded, e.g., two or three egress points per network.
True/False
True
Consider a network with multiple egress points. Further consider that these egress points offer different paths to the same external destinations. Then these paths must have different costs.
True/False
False
According to the hot potato routing technique, it is in a network’s best interest to route the traffic so that it exits the network at the router geographically closest to the one from which it entered the network.
True/False
False
Assume a source and a destination host. As packets travel over a path from the source host to the destination host the packets are handled by multiple routers over that path. If these routers belong to different administrative domains, they need to run the same intradomain routing algorithm, since they are on the same path for that pair of hosts.
True/False
False
-
Module 1: Quiz10
-
Module 1: Practice Quiz5
-
Module 2: Quiz21
-
Module 2: Practice Quiz4
-
Module 3: Quiz21
-
Module 3: Practice Quiz14
-
Module 4: Quiz23
-
Module 4: Practice Quiz21
-
Module 5: Quiz13
-
Module 5: Practice Quiz27
-
Module 6: Quiz10
-
Module 7: Practice Quiz18
-
Module 7: Quiz13
-
Module 8: Practice Quiz33
-
Module 8: Quiz21
-
Module 9: Practice Quiz24
-
Module 9: Quiz16
-
Module 10: Practice Quiz13
-
Module 10: Quiz14
-
Module 11: Practice Quiz25
-
Module 11: Quiz15
-
Module 12: Quiz12
-
Module 7: AI11
-
Module 8: AI18
-
Module 9: AI23
-
Module 10: AI23
-
Module 11: AI28
-
Module 12: AI24
