Link-state Routing

Link-State Routing is a dynamic routing algorithm within the network layer that belongs to the class of shortest-path first algorithms, distinguished by its method of constructing a complete topological map of the network through the dissemination of link-state advertisements by each router, enabling individual routers to compute optimal paths using Dijkstra's algorithm.

522

Publications

30K

Citations

1.3K

Authors

535

Institutions

Publications per year

2017–2026

98

Authors

1.3K

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

    University of California, Santa Cruz, United States

    24 publications · 1.5K citations

    18

    h-index

  2. LB
    Leonard Barolli

    Fukuoka Institute of Technology, Japan

    13 publications · 331 citations

    12

    h-index

  3. TC
    Thomas Clausen

    École Polytechnique, France

    10 publications · 4.1K citations

    10

    h-index

  4. MI
    Makoto Ikeda

    Fukuoka Institute of Technology, Japan

    11 publications · 280 citations

    10

    h-index

  5. JR
    Jennifer Rexford

    Princeton University, United States

    9 publications · 897 citations

    9

    h-index

1–5 of 1.3K

Venues

  1. IEEE/ACM Transactions on Networking

    TON · 15 publications · 1.4K citations

    13

    h-index

  2. ACM SIGCOMM Computer Communication Review

    CCR · 12 publications · 1.2K citations

    12

    h-index

  3. IEEE Access

    10 publications · 638 citations

    10

    h-index

  4. IEEE Transactions on Vehicular Technology

    5 publications · 345 citations

    5

    h-index

  5. Journal of Communications and Networks

    5 publications · 151 citations

    5

    h-index

1–5