---

Intro: Distance Vector Routing Algorithm

---

• Introduction
  • The Distance Vector Routing Algorithm is also known as

    the Distributed Bellman-Ford algorithm (after its inventors) Wikipedia page: click here

    ---

    ---

  • Documentation on Distance Vector protocols can be found in:

    The Chapter 6 of the Internet RFC 1058: click here (Internet RFC 1058 is the Routing Information Protocol (RIP): click here)

  ---

  ---

  ---

  ---

• Overview of the Distance Vector Algorithm
  • Overview:

    A node sends its distance to all other nodes to its neighbor nodes The collection of distances is called a distance vector Each node processes the distance vector: Update its own distance to other nodes

    ---

    ---

  • Comments:

    Nodes will exchange many rounds of distance vector messages to converge Unfortunately: The distance vector algorithm has a convergence problem in some network situations

  ---

  ---

  ---

  ---

• Well-known distance vector protocols used today
  • Well-known distance vector algorithms:

    The Border Gateway Protocol (BGP) From Wikipedia: click here Most Internet service providers must use BGP to establish routing between one another (especially if they are multihomed). Very large private IP networks use BGP internally. The Route Information Profocol (RIP) Popular among UNIX implementation and in universities --- it's free !!!