Sciweavers

765 search results - page 49 / 153
» Self-organization of Internet Paths
Sort
View
OSDI
2006
ACM
14 years 9 months ago
iPlane: An Information Plane for Distributed Services
In this paper, we present the design, implementation, and evaluation of iPlane, a scalable service providing accurate predictions of Internet path performance for emerging overlay...
Harsha V. Madhyastha, Tomas Isdal, Michael Piatek,...
NSDI
2007
13 years 11 months ago
R-BGP: Staying Connected in a Connected World
Many studies show that, when Internet links go up or down, the dynamics of BGP may cause several minutes of packet loss. The loss occurs even when multiple paths between the sende...
Nate Kushman, Srikanth Kandula, Dina Katabi, Bruce...
ICC
2008
IEEE
138views Communications» more  ICC 2008»
14 years 3 months ago
Localization of IP Links Faults Using Overlay Measurements
—Accurate fault detection and localization is essential to the efficient and economical operation of ISP networks. In addition, it affects the performance of Internet applicatio...
Mohammad Fraiwan, Manimaran Manimaran
INFOCOM
2009
IEEE
14 years 3 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
TON
2002
91views more  TON 2002»
13 years 8 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...