Wikipedia

Path-vector routing protocol

A path-vector routing protocol is a network routing protocol which maintains the path information that gets updated dynamically. Updates that have looped through the network and returned to the same node are easily detected and discarded. This algorithm is sometimes used in Bellman–Ford routing algorithms to avoid "Count to Infinity" problems.[1]

It is different from the distance vector routing and link state routing. Each entry in the routing table contains the destination network, the next router and the path to reach the destination.

Border Gateway Protocol (BGP) is an example of a path vector protocol.[2] In BGP, the autonomous system boundary routers (ASBR) send path-vector messages to advertise the reachability of networks. Each router that receives a path vector message must verify the advertised path according to its policy. If the message complies with its policy, the router modifies its routing table and the message before sending the message to the next neighbor. It modifies the routing table to maintain the autonomous systems that are traversed in order to reach the destination system. It modifies the message to add its AS number and to replace the next router entry with its identification.

Exterior Gateway Protocol (EGP) does not use path vectors.

It has three phases:

  1. Initiation
  2. Sharing
  3. Updating

BGP is commonly referred to as an Exterior Gateway Protocol (EGP) given its role in connecting Autonomous Systems (AS).

Communication protocols within AS are therefore referred to as Interior Gateway Protocols (IGP) which contain OSPF and IS-IS among others.

This being said, BGP can be used within an AS, which typically occurs within very large organizations such as Facebook or Microsoft.

See also

[edit]

References

[edit]
  1. ^ "Lecture 04". Department of Computer Science and Engineering, Indian Institute of Technology Bombay. Retrieved 2026-02-03.
  2. ^ Goralski, Walter (25 November 2008). The Illustrated Network: How TCP/IP Works in a Modern Network. Morgan Kaufmann. pp. 418–419. ISBN 978-0128110270.{{cite book}}: CS1 maint: date and year (link)
Stub icon

This computer networking article is a stub. You can help Wikipedia by adding missing information.