distance routing algorithm

Question

statement : distance routing algorithm is adaptive algorithm which consider the load on the network

whether the given statement is true or not ?

Comments

Adaptive are

1.distance routing ---- not on load on the network

2. Link state packet --- consider load on the network

---

On what basis you are saying this???

---

On basis of " How the algorithms works.. "

I considered OSPF as link state algorithm, it can change the path based on the load on the network also..

---

One more point we can add Here that we do flooding in Link-state Routing and Bandwith required is high So , Load On the Network is high.

---

Actually the flooding we do for only HELLO packets but not with DATA PACKETS

---

Actually the flooding we do for only HELLO packets but not with DATA PACKETS

We do the Flooding for Data packets Because LSR is based on the Global Knowledge. At Initial State We do the flooding To make the Routing Table(Flood .all over the link state routers)Further, Also we do flooding.

---

then with the help of flooding itself, routing will complete, then why you call it as LSP?

---

@shaik

From your statement I concluded that the statement given in question is wrong

Means DVR does not consider load on network

---

yes, as per my knowledge the given statement is wrong.

Answer 1

The statement is false. Traditional distance routing algorithms, such as distance vector routing protocols like RIP (Routing Information Protocol), do not inherently consider the load on the network when making routing decisions. These algorithms typically focus on finding the shortest path based on metrics like hop count or distance, without taking into account factors like network congestion or link utilization