Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Distance-vector routing protocol
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== 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 RFC|1058}} It establishes the shortest path across a network purely on the basis of the hops, that is numbers of routers that need to be passed to reach the destination network. RIP is an [[interior gateway protocol]], so it can be used in [[local area networks]] (LANs) on interior or border routers. Routers with RIPv1 implementation exchange their routing tables with neighbouring routers by [[Broadcasting (networking)|broadcasting]] a RIPv1 packet every 30 second into all connected networks. RIPv1 is not suitable for large networks as it limits the number of hops to 15. This hop limit was introduced to avoid routing loops, but also means that networks that are connected through more than 15 routers are unreachable.<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]}}</ref> <!--I don't think BGP is a distance-vector protocol but rather a path-vector protocol. Otherwise it would should be listed as solution to the count-to-infinity problem, because BGP uses paths and can therefore detect loops intrinsically--> 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> Among the distance-vector protocols that have been described as a hybrid, because it uses routing methods associated with [[link-state routing protocol]]s, is the proprietary [[Enhanced Interior Gateway Routing Protocol]] (EIGRP). It was developed by [[Cisco]] in the 1980s and was designed to offer better convergence and cause less network traffic between routers than the link-state routing protocol [[Open Shortest Path First]] (OSPF).<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/n295 275]}}</ref> Another example of a distance-vector routing protocol is [[Babel (protocol)|Babel]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)