Content deleted Content added
Permuted the order. |
|||
Line 62:
'''End of proof.'''
== Applications in routing ==▼
A distributed variant of Bellman-Ford algorithm is used in the [[Routing Information Protocol]] (RIP). The algorithm is distributed because it involves a number of nodes (routers) within an [[Autonomous system (Internet)|Autonomous system]], a collection of IP networks typically owned by an ISP.▼
It consists of the following steps:▼
#Each node calculates the distances between itself and all other nodes within the AS and stores this information as a table.▼
#Each node sends its table to all neighbouring nodes.▼
#When a node receives distance tables from its neighbours, it calculates the shortest routes to all other nodes and updates its own table to reflect any changes.▼
The main disadvantages of Bellman-Ford algorithm in this setting are▼
*Does not scale well▼
*Changes in [[network topology]] are not reflected quickly since updates are spread node-by-node.▼
*Counting to [[infinity]]▼
==Implementations==
Line 108 ⟶ 123:
}
▲== Applications in routing ==
▲A distributed variant of Bellman-Ford algorithm is used in the [[Routing Information Protocol]] (RIP). The algorithm is distributed because it involves a number of nodes (routers) within an [[Autonomous system (Internet)|Autonomous system]], a collection of IP networks typically owned by an ISP.
▲It consists of the following steps:
▲#Each node calculates the distances between itself and all other nodes within the AS and stores this information as a table.
▲#Each node sends its table to all neighbouring nodes.
▲#When a node receives distance tables from its neighbours, it calculates the shortest routes to all other nodes and updates its own table to reflect any changes.
▲The main disadvantages of Bellman-Ford algorithm in this setting are
▲*Does not scale well
▲*Changes in [[network topology]] are not reflected quickly since updates are spread node-by-node.
▲*Counting to [[infinity]]
''See also: [[List of algorithms]]''
| |||