Distance-vector Routing

Distance-Vector Routing is a routing algorithm in the network layer that belongs to the class of dynamic routing protocols and is distinguished by its use of distance metrics and direction (next-hop routing) to determine optimal paths, where each router maintains a table of the distance to every destination and updates its neighbors periodically by exchanging routing information in the form of vectors.

653

Publications

50.4K

Citations

1.6K

Authors

590

Institutions

Publications per year

2017–2026

128

Variants

Distance-vector Routing Protocols

Authors

1.6K

  1. JG
    J.J. Garcia‐Luna‐Aceves

    University of California, Santa Cruz, United States

    13 publications · 937 citations

    12

    h-index

  2. CE
    Charles E. Perkins

    Nokia (United States), United States

    12 publications · 21.2K citations

    12

    h-index

  3. RH
    Rosilah Hassan

    National University of Malaysia, Malaysia

    7 publications · 208 citations

    7

    h-index

  4. RA
    Raed Alsaqour

    Princess Nourah bint Abdulrahman University, Saudi Arabia

    6 publications · 296 citations

    6

    h-index

  5. SD
    S. Deering

    Stanford University, United States

    5 publications · 1.8K citations

    5

    h-index

1–5 of 1.6K

Venues

  1. IEEE Access

    11 publications · 688 citations

    11

    h-index

  2. ACM SIGCOMM Computer Communication Review

    CCR · 10 publications · 7.7K citations

    10

    h-index

  3. Procedia Computer Science

    9 publications · 257 citations

    9

    h-index

  4. Sensors

    7 publications · 258 citations

    7

    h-index

  5. 7

    h-index

1–5