Distance-vector routing protocol
A distance-vector routing protocol in data networks determines the best route for data packets based on distance. Distance-vector routing protocols measure the distance by the number of routers a packet has to pass; one router counts as one hop. Some distance-vector protocols also take into account network latency and other factors that influence traffic on a given route. To determine the best route across a network, routers using a distance-vector protocol exchange information with one another, usually routing tables plus hop counts for destination networks and possibly other traffic information. Distance-vector routing protocols also require that a router inform its neighbours of network topology changes periodically.
- Abstraction100002137
- Act100030358
- Activity100407535
- Algorithm105847438
- Communication100033020
- Direction106786629
- Event100029378
- mean of transportation
- Message106598915
- Procedure101023820
- Protocol106665108
- PsychologicalFeature100023100
- Rule105846932
- Rule106652242
- WikicatNetworkProtocols
- WikicatRoutingAlgorithms
- WikicatRoutingProtocols
- YagoPermanentlyLocatedEntity
- Comment
- enA distance-vector routing protocol in data networks determines the best route for data packets based on distance. Distance-vector routing protocols measure the distance by the number of routers a packet has to pass; one router counts as one hop. Some distance-vector protocols also take into account network latency and other factors that influence traffic on a given route. To determine the best route across a network, routers using a distance-vector protocol exchange information with one another, usually routing tables plus hop counts for destination networks and possibly other traffic information. Distance-vector routing protocols also require that a router inform its neighbours of network topology changes periodically.
- Depiction
- Has abstract
- enA distance-vector routing protocol in data networks determines the best route for data packets based on distance. Distance-vector routing protocols measure the distance by the number of routers a packet has to pass; one router counts as one hop. Some distance-vector protocols also take into account network latency and other factors that influence traffic on a given route. To determine the best route across a network, routers using a distance-vector protocol exchange information with one another, usually routing tables plus hop counts for destination networks and possibly other traffic information. Distance-vector routing protocols also require that a router inform its neighbours of network topology changes periodically. Distance-vector routing protocols use the Bellman–Ford algorithm to calculate the best route. Another way of calculating the best route across a network is based on link cost, and is implemented through link-state routing protocols. The term distance vector refers to the fact that the protocol manipulates vectors (arrays) of distances to other nodes in the network. The distance vector algorithm was the original ARPANET routing algorithm and was implemented more widely in local area networks with the Routing Information Protocol (RIP).
- Hypernym
- Classes
- Is primary topic of
- Distance-vector routing protocol
- Label
- enDistance-vector routing protocol
- Link from a Wikipage to an external page
- authors.phptr.com/tanenbaumcn4/
- docwiki.cisco.com/wiki/Routing_Basics%23Link-State_Versus_Distance_Vector
- Link from a Wikipage to another Wikipage
- ARPANET
- Array data structure
- Babel (protocol)
- Bellman–Ford algorithm
- Border Gateway Protocol
- Broadcasting (networking)
- Category:Routing algorithms
- Category:Routing protocols
- Cisco
- Cisco Systems
- Convergence (routing)
- Data
- Data network
- Data networks
- DSDV
- EIGRP
- Enhanced Interior Gateway Routing Protocol
- Exterior gateway protocol
- File:Networkabcd.svg
- Interior gateway protocol
- Interior Gateway Routing Protocol
- Internet
- Internet Protocol
- Internet service providers
- IPv6
- Link state routing protocol
- Link-state routing protocol
- Local area networks
- Network latency
- Network packet
- Network topology
- Open Shortest Path First
- OSPF
- Router (computing)
- Routing Information Protocol
- Routing loop
- Routing protocol
- Routing table
- Routing tables
- Split horizon route advertisement
- Transmission Control Protocol
- Wide area network
- SameAs
- Algorytm wektora odległości
- Distance vector
- Distance vector
- Distance-vector
- Distance-vector routing protocol
- Distance-vector Routing Protocol
- Distanzvektoralgorithmus
- GXJ8
- m.015031
- Protocol de vector de distàncies
- Q1229441
- Vecteur de distances
- Vector de distancias
- Vetor distância
- Дистанционно-векторная маршрутизация
- Насочувачки протокол за вектор на растојание
- پروتکل مسیریابی بردار فاصله
- ലിങ്ക് സ്റ്റേറ്റ് പ്രോടോക്കോളും ഡിസ്ടൻസ് വെക്ടർ പ്രോടോകൊളും തമ്മിലുള്ള അന്തരങ്ങൾ.
- 距離向量路由協定
- Subject
- Category:Routing algorithms
- Category:Routing protocols
- Thumbnail
- WasDerivedFrom
- Distance-vector routing protocol?oldid=1115689294&ns=0
- WikiPageLength
- 20224
- Wikipage page ID
- 159228
- Wikipage revision ID
- 1115689294
- WikiPageUsesTemplate
- Template:More footnotes
- Template:Multiple issues
- Template:Reflist
- Template:Ref RFC
- Template:Short description
- Template:Technical
