Jump to content

Path-vector routing protocol

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Juxi (talk | contribs) at 23:09, 13 January 2008. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A path vector protocol is a computer network routing protocol in which it maintains the path that update information takes as it diffuses through the network. Updates which 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.

BGP is an example of a path vector protocol. In BGP the routing table maintains the autonomous systems that are traversed in order to reach the destination system. Exterior Gateway Protocol (EGP) does not use path vectors.

Path vector protocols are a class of distance vector protocol in contrast to link state protocol.

Stub icon

This computer networking article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Path-vector_routing_protocol&oldid=184139499"