Everything About ___
Live briefing

Everything about Distance-vector routing protocol

Class of routing protocols

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. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Distance-vector routing protocolA 5-minute orientation
  2. Skim a recent paper: A Novel Cross-Layer Adaptive Fuzzy-Based Ad Hoc On-Demand Distance Vector Routing Protocol for MANETsInfluential work since 2022
  3. Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
  4. Read the landmark paper: Scalability study of the ad hoc on‐demand distance vector routing protocolCited 128 times
  5. Go sideways: Routing protocolA closely related topic
  6. Go sideways: Link-state routing protocolA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Overview
  2. Methodology
  3. Development of distance-vector routing
  4. Count to infinity problem
  5. Example

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics