Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 2

Q1. 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.
Centralized Routing Algorithm: A central entity makes routing decisions for all nodes based on complete network
knowledge.
Distributed Routing Algorithm: Nodes collaborate to make routing decisions based on local information.
Example:
Centralized: Border Gateway Protocol (BGP) used in the Internet for exchanging routing information between
Autonomous Systems (ASes).
Decentralized: Ad hoc On-Demand Distance Vector (AODV) routing protocol used in mobile ad hoc networks
(MANETs).

Q2. What is the “count to infinity” problem in distance vector routing?


Count to infinity" is a routing problem in distance vector protocols where nodes mistakenly believe they have the
shortest path to a destination, causing routing loops and an endless increase in metric values.
Q3. How is a least cost path calculated in a decentralized routing algorithm?
In a decentralized routing algorithm, like link state routing, a least cost path is calculated using Dijkstra's algorithm
based on the exchanged network topology information among nodes.
Q4. Why are different inter-AS and intra-AS protocols used in the Internet?
Different inter-AS and intra-AS protocols are used in the Internet due to scalability requirements, the need for policy
control, and the presence of administrative boundaries between autonomous systems
.Q5. True or false: When an OSPF route sends its link state information, it is sent only to those nodes directly
attached neighbors. Explain.
False. With OSPF, a router broadcasts its link-state information to all other routers in the autonomous system to
which it belongs, not just to its neighboring routers
Q6. Consider the network shown below. Assume that each node initially knows the costs to each of its neighbors.
Consider the distance-vector algorithm and show the distance table entries at node z.
Dz(u) Infinity
Dz(v) 3
Dz(x) 2
Dz(y) Infinity
Dz(z) 0

You might also like