Content deleted Content added
FF is a max-flow algorithm, not shortest path |
m Task 18 (cosmetic): eval 5 templates: del empty params (3×); |
||
Line 19:
== Development of distance-vector routing ==
The oldest [[routing protocol]], and the oldest distance-vector protocol, is version 1 of the [[Routing Information Protocol]] (RIPv1). RIPv1 was formally standardised in 1988.<ref>{{Cite web|url=https://tools.ietf.org/html/rfc1058.html|title=Routing Information Protocol|last=Hedrick|first=C. L.
The distance-vector protocol designed for use in [[wide area network]]s (WANs) is the [[Border Gateway Protocol]] (BGP). BGP is an [[exterior gateway protocol]] and therefore implemented on border and exterior routers on the [[Internet]]. It exchanges information between routers through a [[Transmission Control Protocol]] (TCP) session. Routers with BGP implementation determine the shortest path across a network based on a range of factors other than hops. BGP can also be configured by administrators so that certain routes are preferred or avoided. BGP is used by [[internet service providers]] (ISPs) and telecommunication companies.<ref>{{Cite book|title= Network+ Guide to Networks|url= https://archive.org/details/networkguidetone00dean_142|url-access= limited|author =Tamara Dean |publisher= Cengage Learning|year=2009 |isbn= 9781423902454|pages=[https://archive.org/details/networkguidetone00dean_142/page/n294 274]–275}}</ref>
|