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
109
1–5 of 109
317
4
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 317
110
AT&T (United States)
Bedminster, United States
11 h-index
15 publications
2.3K citations
University of Maryland, College Park
College Park, United States
4 h-index
13 publications
503 citations
Vellore Institute of Technology University
Vellore, India
3 h-index
11 publications
298 citations
Nokia (United States)
Coppell, United States
3 h-index
4 publications
409 citations
Princeton University
Princeton, United States
3 h-index
9 publications
612 citations
NTT (Japan)
Tokyo, Japan
3 h-index
6 publications
995 citations
University of California, Santa Cruz
Santa Cruz, United States
3 h-index
3 publications
154 citations
Universidade Federal do Rio Grande do Sul
Porto Alegre, Brazil
2 h-index
4 publications
132 citations
1–8 of 110
4 publications · 194 citations
4
h-index
IJACSA · 3 publications · 47 citations
3
h-index
3 publications · 743 citations
3
h-index
2 publications · 50 citations
2
h-index
TNSM · 1 publications · 31 citations
2
h-index
1–5