Scalable and systematic Internet-wide path and delay estimation from existing measurements

Internet-wide services and applications depend on accurate information about the internal network state to deliver good performance to end-users. However, today’s Internet does not provide such information explicitly and a number of systems have been recently proposed and implemented to provide a shared measurement infrastructure for distributed applications [1–4]. The goal of this work is to demonstrate that without any new measurement infrastructure or active probing we obtain composite performance estimates from ASby-AS segments and the estimates are as good as (or even better than) those from existing estimation methodologies that use on-demand, customized active probing. The key idea behind scaling measurements to the size of the Internet is to take advantage of the known underlying structure of the network. The main contribution of this paper is an estimation algorithm that breaks down measurement data into segments, efficiently identifies relevant segments, and by carefully stitching segments together, produces delay and path estimates between any two end points. Fittingly, we call our algorithm path stitching. Our results show remarkably good accuracy: error in delay is below 20 ms in 80% of end-to-end paths. We show also that our path stitching approach performs comparably to existing iPlane without having to instrument any new measurement node.

[1]  Yuval Shavitt,et al.  Big-bang simulation for embedding network distances in Euclidean space , 2004, IEEE/ACM Transactions on Networking.

[2]  Suman Banerjee,et al.  The Interdomain Connectivity of PlanetLab Nodes , 2004, PAM.

[3]  Daniel Massey,et al.  An analysis of BGP multiple origin AS (MOAS) conflicts , 2001, IMW '01.

[4]  Arun Venkataramani,et al.  iPlane Nano: Path Prediction for Peer-to-Peer Applications , 2009, NSDI.

[5]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Arun Venkataramani,et al.  A structural approach to latency prediction , 2006, IMC '06.

[7]  Rami Cohen,et al.  The Internet Dark Matter - on the Missing Links in the AS Connectivity Map , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  Miguel Castro,et al.  PIC: practical Internet coordinates for distance estimation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[9]  Kurt Rothermel,et al.  Dynamic distance maps of the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Olaf Maennel,et al.  Bigfoot, sasquatch, the yeti and other missing links: what we don't know about the as graph , 2008, IMC '08.

[11]  Xiaodong Zhang,et al.  ASAP: an AS-Aware Peer-Relay Protocol for High Quality VoIP , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[12]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[13]  Michalis Faloutsos,et al.  A Systematic Framework for Unearthing the Missing Links: Measurements and Impact , 2007, NSDI.

[14]  Margo I. Seltzer,et al.  Network Coordinates in the Wild , 2007, NSDI.

[15]  Christian Scheideler,et al.  Can ISPS and P2P users cooperate for improved performance? , 2007, CCRV.

[16]  Thomas E. Anderson,et al.  Reverse traceroute , 2010, NSDI.

[17]  Sujata Banerjee,et al.  S3: a scalable sensing service for monitoring large networked systems , 2006, INM '06.

[18]  Antonio Nucci,et al.  IGP Link Weight Assignment for Operational Tier-1 Backbones , 2007, IEEE/ACM Transactions on Networking.

[19]  Lixin Gao On inferring autonomous system relationships in the internet , 2001, TNET.

[20]  Jacob R. Lorch,et al.  Matchmaking for online games and other latency-sensitive P2P systems , 2009, SIGCOMM '09.

[21]  Jon Crowcroft,et al.  Lighthouses for Scalable Distributed Location , 2003, IPTPS.

[22]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[23]  Robert D. Kleinberg,et al.  On the internet delay space dimensionality , 2008, IMC '08.

[24]  Jitendra Padhye,et al.  Measurement and Estimation of Network QoS Among Peer Xbox 360 Game Players , 2008, PAM.

[25]  Emin Gün Sirer,et al.  Meridian: a lightweight network location service without virtual coordinates , 2005, SIGCOMM '05.

[26]  Walter Willinger,et al.  Towards capturing representative AS-level Internet topologies , 2002, SIGMETRICS '02.

[27]  Mark Crovella,et al.  Deployment of an Algorithm for Large-Scale Topology Discovery , 2006, IEEE Journal on Selected Areas in Communications.

[28]  Jia Wang,et al.  Towards an accurate AS-level traceroute tool , 2003, SIGCOMM '03.

[29]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[30]  Hui Zhang,et al.  A Network Positioning System for the Internet , 2004, USENIX Annual Technical Conference, General Track.

[31]  Anja Feldmann,et al.  Building an AS-topology model that captures route diversity , 2006, SIGCOMM.

[32]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[33]  Yin Zhang,et al.  On AS-level path inference , 2005, SIGMETRICS '05.

[34]  Jon Crowcroft,et al.  On the accuracy of embeddings for internet coordinate systems , 2005, IMC '05.

[35]  Yin Zhang,et al.  The Stationarity of Internet Path Properties: Routing, Loss, and Throughput , 2000 .

[36]  Azer Bestavros,et al.  On the marginal utility of network topology measurements , 2001, IMW '01.

[37]  Lixin Gao,et al.  CAM04-4: AS Path Inference by Exploiting Known AS Paths , 2006, IEEE Globecom 2006.

[38]  Larry L. Peterson,et al.  Using PlanetLab for network research: myths, realities, and best practices , 2005, OPSR.

[39]  Ming Zhang,et al.  PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services , 2004, OSDI.

[40]  Giuseppe Di Battista,et al.  26 Computer Networks , 2004 .

[41]  Ying Zhang,et al.  A Measurement Study of Internet Delay Asymmetry , 2008, PAM.

[42]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[43]  Yuval Shavitt,et al.  DIMES: let the internet measure itself , 2005, CCRV.

[44]  kc claffy,et al.  Analysis of RouteViews BGP data: policy atoms , 2001 .

[45]  Arun Venkataramani,et al.  iPlane: an information plane for distributed services , 2006, OSDI '06.

[46]  M. Frans Kaashoek,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM 2004.

[47]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[48]  Yin Zhang,et al.  NetQuest: A Flexible Framework for Large-Scale Network Measurement , 2009, IEEE/ACM Transactions on Networking.

[49]  Antonio Nucci,et al.  IGP link weight assignment for operational Tier-1 backbones , 2007, TNET.

[50]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[51]  Jia Wang,et al.  Scalable and accurate identification of AS-level forwarding paths , 2004, IEEE INFOCOM 2004.

[52]  Paul Francis,et al.  IDMaps: a global internet host distance estimation service , 2001, TNET.