Path-vector Routing
Path-Vector Routing is a routing protocol paradigm in the network layer that belongs to the class of dynamic routing algorithms and is distinguished by maintaining a path list of autonomous system hops to detect routing loops and enforce policy-based routing decisions.
31
Publications
3.3K
Citations
61
Authors
33
Institutions
Publications per year
2017–2026
1
31
An analysis of BGP convergence properties
Timothy G. Griffin, Gordon Wilfong · 1999 · 372 citations · Full text
BPG routing policies in ISP networks
Matthew Caesar, Jennifer Rexford · IEEE Network · 2005 · 270 citations
Yih‐Chun Hu, Adrian Perrig, Marvin A. Sirbu · 2004 · 207 citations · Full text
Lakshminarayanan Subramanian, Matthew Caesar, Cheng Tien Ee et al. · 2005 · 180 citations
1–5 of 31
61
7
h-index
5
h-index
4
h-index
3
h-index
3
h-index
1–5 of 61
33
University of California, Berkeley
Berkeley, United States
5 h-index
13 publications
1.6K citations

Tulane University
New Orleans, United States
4 h-index
4 publications
137 citations
Yale University
New Haven, United States
3 h-index
3 publications
127 citations
AT&T (United States)
Bedminster, United States
3 h-index
3 publications
616 citations
UCLA Health
Los Angeles, United States
2 h-index
5 publications
500 citations
Berkeley College
New York, United States
2 h-index
2 publications
237 citations
Nokia (United States)
Coppell, United States
2 h-index
5 publications
1.5K citations
University College London
London, United Kingdom
2 h-index
2 publications
219 citations
1–8 of 33
CCR · 4 publications · 240 citations
4
h-index
1 publications · 45 citations
1
h-index
TON · 1 publications · 516 citations
1
h-index
1 publications · 72 citations
1
h-index
Conference · 1 publications · 12 citations
1
h-index
1–5