Open Shortest Path First

Open Shortest Path First is a link-state routing protocol that uses Dijkstra's algorithm to compute the shortest path tree for IP networks by flooding link-state advertisements within a single autonomous system.

109

Publications

5.6K

Citations

317

Authors

110

Institutions

Publications per year

2017–2026

23

Authors

317

  1. LS
    Luciana S. Buriol

    Universidade Federal do Rio Grande do Sul, Brazil

    4 publications · 232 citations

    4

    h-index

  2. JR
    Jennifer Rexford

    Princeton University, United States

    4 publications · 665 citations

    4

    h-index

  3. BF
    Bernard Fortz

    Université Libre de Bruxelles, Belgium

    4 publications · 1.2K citations

    4

    h-index

  4. MT
    Mikkel Thorup

    AT&T (United States), United States

    4 publications · 1.3K citations

    4

    h-index

  5. AG
    Albert Greenberg

    AT&T (United States), United States

    3 publications · 154 citations

    3

    h-index

1–5 of 317

Venues

  1. Networks

    4 publications · 194 citations

    4

    h-index

  2. 3

    h-index

  3. 3

    h-index

  4. Applied Intelligence

    2 publications · 50 citations

    2

    h-index

  5. IEEE Transactions on Network and Service Management

    TNSM · 1 publications · 31 citations

    2

    h-index

1–5