Sciweavers

15 search results - page 1 / 3
» Cuts and Disjoint Paths in the Valley-Free Path Model of Int...
Sort
View
CAAN
2004
Springer
13 years 10 months ago
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing
Thomas Erlebach, Alexander Hall, Alessandro Pancon...
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 6 months ago
A fractional model of the border gateway protocol (BGP)
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
WSC
2004
13 years 6 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol
INFOCOM
2005
IEEE
13 years 10 months ago
Limiting path exploration in BGP
— Slow convergence in the Internet can be directly attributed to the “path exploration” phenomenon, inherent in all path vector protocols. The root cause for path exploration...
Jaideep Chandrashekar, Zhenhai Duan, Zhi-Li Zhang,...
GLOBECOM
2009
IEEE
13 years 11 months ago
PEMP: Peering Equilibrium MultiPath Routing
—It is generally admitted that Inter-domain peering links represent nowadays the main bottleneck of the Internet, particularly because of lack of coordination between providers, ...
Stefano Secci, Jean-Louis Rougier, Achille Pattavi...