COMPUTER NETWORKING CHAPTER 5 TEST
BANK 2026 FULLY SOLVED EDITION WITH
COMPLETE PROBLEMS AND DETAILED
EXPLANATIONS
◉What is meant by a control plane that is based on logically centralized
control? In such cases, are the data plane and the control plane
implemented within the same device or in separate devices? Explain.
Answer: Logically centralized control means that a logically central
routing controller computes and distributes the forwarding tables to be
used by each and every router, and each router does not compute its
forwarding table, unlike the per-router control. In the case of logically
centralized control, the data plane and control plane are implemented in
separate devices; the control plane is implemented in a central server or
multiple servers, and the data plane is implemented in each router.
◉Compare and contrast the properties of a centralized and a distributed
routing algorithm. Give an example of a routing protocol that takes a
centralized and a decentralized approach. Answer: A centralized routing
algorithm computes the least-cost path between a source and destination
, by using complete, global knowledge about the network. The algorithm
needs to have the complete knowledge of the connectivity between all
nodes and all links' costs. The actual calculation can be run at one site or
could be replicated in the routing component of each and every router. A
distributed routing algorithm calculates the lease-cost path in an
iterative, distributed manner by the routers. With a decentralized
algorithm, no node has the complete information about the costs of all
network links. Each node begins with only the knowledge of the costs of
its own directly attached links, and then through an iterative process of
calculation and information exchange with its neighboring nodes, a node
gradually calculates the least-cost path to a destination or a set of
destinations.
OSPF protocol is an example of centralized routing algorithm, and BGP
is an example of a distributed routing algorithm.
◉Compare and contrast link-state and distance-vector routing
algorithms. Answer: Link state algorithms: Computes the least-cost path
between source and destination using complete, global knowledge about
the network. Distance-vector routing: The calculation of the least-cost
path is carried out in an iterative, distributed manner. A node only knows
the neighbor to which it should forward a packet in order to reach given
destination along the least-cost path, and the cost of that path from itself
to the destination.
◉What is the "count to infinity" problem in distance vector routing?
Answer: The count-to-infinity problem refers to a problem of distance
vector routing. The problem means that it takes a long time for a
distance vector routing algorithm to converge when there is a link cost
BANK 2026 FULLY SOLVED EDITION WITH
COMPLETE PROBLEMS AND DETAILED
EXPLANATIONS
◉What is meant by a control plane that is based on logically centralized
control? In such cases, are the data plane and the control plane
implemented within the same device or in separate devices? Explain.
Answer: Logically centralized control means that a logically central
routing controller computes and distributes the forwarding tables to be
used by each and every router, and each router does not compute its
forwarding table, unlike the per-router control. In the case of logically
centralized control, the data plane and control plane are implemented in
separate devices; the control plane is implemented in a central server or
multiple servers, and the data plane is implemented in each router.
◉Compare and contrast the properties of a centralized and a distributed
routing algorithm. Give an example of a routing protocol that takes a
centralized and a decentralized approach. Answer: A centralized routing
algorithm computes the least-cost path between a source and destination
, by using complete, global knowledge about the network. The algorithm
needs to have the complete knowledge of the connectivity between all
nodes and all links' costs. The actual calculation can be run at one site or
could be replicated in the routing component of each and every router. A
distributed routing algorithm calculates the lease-cost path in an
iterative, distributed manner by the routers. With a decentralized
algorithm, no node has the complete information about the costs of all
network links. Each node begins with only the knowledge of the costs of
its own directly attached links, and then through an iterative process of
calculation and information exchange with its neighboring nodes, a node
gradually calculates the least-cost path to a destination or a set of
destinations.
OSPF protocol is an example of centralized routing algorithm, and BGP
is an example of a distributed routing algorithm.
◉Compare and contrast link-state and distance-vector routing
algorithms. Answer: Link state algorithms: Computes the least-cost path
between source and destination using complete, global knowledge about
the network. Distance-vector routing: The calculation of the least-cost
path is carried out in an iterative, distributed manner. A node only knows
the neighbor to which it should forward a packet in order to reach given
destination along the least-cost path, and the cost of that path from itself
to the destination.
◉What is the "count to infinity" problem in distance vector routing?
Answer: The count-to-infinity problem refers to a problem of distance
vector routing. The problem means that it takes a long time for a
distance vector routing algorithm to converge when there is a link cost
