Table-based Routing
Table-Based Routing is an adaptive routing method that belongs to the class of routing strategies using precomputed or dynamically updated lookup tables to determine forwarding paths, distinguished by its reliance on table entries mapping destination addresses to next-hop identifiers based on current network conditions.
49
Publications
1.7K
Citations
140
Authors
66
Institutions
Publications per year
2017–2026
11
Parents
49
Improved routing strategies with succinct tables
Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial et al. · Journal of Algorithms · 1990 · 142 citations
A Tree-Based Packet Routing Table for Berkeley Unix.
K. Sklower · 1991 · 141 citations
1–5 of 49
140
University of California, Santa Cruz, United States
4 publications · 132 citations
4
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 140
66
University of California, Santa Cruz
Santa Cruz, United States
4 h-index
8 publications
264 citations
University of Catania
Catania, Italy
3 h-index
5 publications
255 citations

Jönköping University
Jönköping, Sweden
3 h-index
5 publications
268 citations
Universidade Federal do Espírito Santo
Vitória, Brazil
2 h-index
9 publications
189 citations

University of Waterloo
Waterloo, Canada
1 h-index
3 publications
120 citations
Techniques of Informatics and Microelectronics for Integrated Systems Architecture
Grenoble, France
1 h-index
2 publications
42 citations

University of Amsterdam
Amsterdam, The Netherlands
1 h-index
3 publications
42 citations
IBM (United States)
Armonk, United States
1 h-index
1 publications
142 citations
1–8 of 66
1 publications · 11 citations
1
h-index
TON · 1 publications · 40 citations
1
h-index
1 publications · 15 citations
1
h-index
1 publications · 190 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5