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
522
Optimized Link State Routing Protocol
Philippe Jacquet, Paul Mühlethaler, Amir Qayyum et al. · 2000 · 1.9K citations
Optimized link state routing protocol for ad hoc networks
Philippe Jacquet, Paul Mühlethaler, Thomas Clausen et al. · 2002 · 1.4K citations
1–5 of 522
1.3K
University of California, Santa Cruz, United States
24 publications · 1.5K citations
18
h-index
12
h-index
10
h-index
10
h-index
9
h-index
1–5 of 1.3K
535
University of California, Santa Cruz
Santa Cruz, United States
18 h-index
41 publications
2.4K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
15 h-index
52 publications
10K citations

Fukuoka Institute of Technology
Fukuoka, Japan
14 h-index
65 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
28 publications
1.3K citations
AT&T (United States)
Bedminster, United States
9 h-index
13 publications
1.1K citations
University of Maryland, College Park
College Park, United States
9 h-index
24 publications
850 citations

National University of Malaysia
Bangi, Malaysia
9 h-index
17 publications
619 citations
University of California, Los Angeles
Los Angeles, United States
9 h-index
18 publications
2K citations
1–8 of 535
TON · 15 publications · 1.4K citations
13
h-index
CCR · 12 publications · 1.2K citations
12
h-index
10 publications · 638 citations
10
h-index
5 publications · 345 citations
5
h-index
5 publications · 151 citations
5
h-index
1–5