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!
==Overview== Distance-vector routing protocols use the [[Bellman–Ford algorithm]]. In these protocols, each router does not possess information about the full [[network topology]]. It advertises its distance value (DV) calculated to other routers and receives similar advertisements from other routers unless changes are done in the local network or by neighbours (routers). Using these routing advertisements each router populates its routing table. In the next advertisement cycle, a router advertises updated information from its routing table. This process continues until the routing tables of each router [[Convergence (routing)|converge]] to stable values. Some of these protocols have the disadvantage of slow convergence. Examples of distance-vector routing protocols: * [[Routing Information Protocol]] (RIP) * [[Routing Information Protocol#RIP version 2|Routing Information Protocol Version 2]] (RIPv2) * [[Routing Information Protocol#RIPng|Routing Information Protocol Next Generation]] (RIPng), an extension of RIP version 2 with support for [[IPv6]] * [[Interior Gateway Routing Protocol]] (IGRP) * [[Enhanced Interior Gateway Routing Protocol]] (EIGRP)
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)