A NETWORK PATH ADVISING SERVICE

OF DISSERTATION A NETWORK PATH ADVISING SERVICE A common feature of emerging future Internet architectures is the ability for applications to select the path, or paths, their packets take between a source and destination. Unlike the current Internet architecture where routing protocols find a single (best) path between a source and destination, future Internet routing protocols will present applications with a set of paths and allow them to select the most appropriate path. Although this enables applications to be actively involved in the selection of the paths their packets travel, the huge number of potential paths and the need to know the current network conditions of each of the proposed paths will make it virtually impossible for applications to select the best set of paths, or just the best path. To tackle this problem, we introduce a new Network Path Advising Service (NPAS) that helps future applications choose network paths. Given a set of possible paths, the NPAS service helps applications select appropriate paths based on both recent path measurements and end-to-end feedback collected from other applications. We describe the NPAS service abstraction, API calls, and a distributed architecture that achieves scalability by determining the most important things to monitor based on actual usage. By analyzing existing traffic patterns, we will demonstrate it is feasible for NPAS to monitor only a few nodes and links and yet be able to offer advice about the most important paths used by a high percentage of traffic. Finally, we describe a prototype implementation of the NPAS components as well as a simulation model used to evaluate the NPAS architecture.

[1]  Roch Guérin,et al.  How to Select a Good Alternate Path in Large Peer-to-Peer Systems? , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  environmet.,et al.  JXTA : A Network Programming Environment , 2022 .

[3]  Robert D. Nowak,et al.  Passive network tomography using EM algorithms , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[4]  Mary Baker,et al.  Nettimer: A Tool for Measuring Bottleneck Link Bandwidth , 2001, USITS.

[5]  Allen B. Downey Using pathchar to estimate Internet link characteristics , 1999, SIGCOMM '99.

[6]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[7]  Srinivasan Seshan,et al.  SPAND: Shared Passive Network Performance Discovery , 1997, USENIX Symposium on Internet Technologies and Systems.

[8]  Mary Baker,et al.  Measuring link bandwidths using a deterministic model of packet delay , 2000, SIGCOMM.

[9]  Robert Nowak,et al.  Internet tomography , 2002, IEEE Signal Process. Mag..

[10]  Bert Wijnen,et al.  An Architecture for Describing Simple Network Management Protocol (SNMP) Management Frameworks , 2002, RFC.

[11]  Jim Griffioen,et al.  Supporting application-based route selection , 2014, 2014 23rd International Conference on Computer Communication and Networks (ICCCN).

[12]  Mary Baker,et al.  Measuring bandwidth , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  Robert D. Nowak,et al.  Network delay tomography , 2003, IEEE Trans. Signal Process..

[14]  Srinivasan Seshan,et al.  XIA: an architecture for an evolvable and trustworthy internet , 2011, HotNets-X.

[15]  Parameswaran Ramanathan,et al.  What do packet dispersion techniques measure? , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  Krishna P. Gummadi,et al.  Improving the Reliability of Internet Paths with One-hop Source Routing , 2004, OSDI.

[17]  Kenneth L. Calvert,et al.  Separating routing and forwarding: A clean-slate network layer design , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[18]  Shobha Venkataraman,et al.  Speed testing without speed tests: estimating achievable download speed from passive measurements , 2010, IMC '10.

[19]  Randy H. Katz,et al.  Tomography-based overlay network monitoring , 2003, IMC '03.

[20]  Donald F. Towsley,et al.  On the interaction between overlay routing and underlay routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[21]  Robert Ricci,et al.  Getting started with GENI: a user tutorial , 2012, CCRV.

[22]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[23]  Jim Griffioen,et al.  Measuring experiments in GENI , 2014, Comput. Networks.

[24]  Peter Steenkiste,et al.  Evaluation and characterization of available bandwidth probing techniques , 2003, IEEE J. Sel. Areas Commun..

[25]  Kenneth L. Calvert,et al.  On the scalability of interdomain path computations , 2014, 2014 IFIP Networking Conference.

[26]  Mats Björkman,et al.  A new end-to-end probing and analysis method for estimating bandwidth bottlenecks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[27]  Mehmet Onur Ascigil,et al.  Design of a Scalable Path Service for the Internet , 2015 .

[28]  Chen-Nee Chuah,et al.  Race conditions in coexisting overlay networks , 2008, TNET.

[29]  Nick G. Duffield,et al.  Network tomography from measured end-to-end delay covariance , 2004, IEEE/ACM Transactions on Networking.

[30]  Alejandro López-Ortiz,et al.  On the number of distributed measurement points for network tomography , 2003, IMC '03.

[31]  Jim Griffioen,et al.  Network path advising service for the future Internet , 2012, 2012 IEEE Network Operations and Management Symposium.

[32]  Nick Mathewson,et al.  Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.

[33]  Richard G. Baraniuk,et al.  pathChirp: Efficient available bandwidth estimation for network paths , 2003 .

[34]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[35]  Azer Bestavros,et al.  Measuring bottleneck bandwidth of targeted path segments , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[36]  Ning Yang,et al.  An Architecture for Distributed Real-Time Passive Network Measurement , 2006, 14th IEEE International Symposium on Modeling, Analysis, and Simulation.

[37]  Yin Zhang,et al.  On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.

[38]  Jin Cao,et al.  Network Tomography: Identifiability and Fourier Domain Estimation , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[39]  Ritesh Kumar,et al.  Efficient beacon placement for network tomography , 2004, IMC '04.

[40]  Dmitri Loguinov,et al.  Turbo King: Framework for Large-Scale Internet Delay Measurements , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[41]  Mei Yang,et al.  An End-to-end QoS Framework with On-demand Bandwidth Reconfiguration , 2004, INFOCOM.

[42]  Jelena Mirkovic,et al.  A realistic simulation of internet-scale events , 2006, valuetools '06.

[43]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[44]  Chip Elliott,et al.  GENI - global environment for network innovations , 2008, LCN.

[45]  Mark Crovella,et al.  Measuring Bottleneck Link Speed in Packet-Switched Networks , 1996, Perform. Evaluation.

[46]  Paul Francis,et al.  An architecture for a global Internet host distance estimation service , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[47]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[48]  Bin Yu,et al.  Maximum pseudo likelihood estimation in network tomography , 2003, IEEE Trans. Signal Process..

[49]  Robert Nowak,et al.  Network Tomography: Recent Developments , 2004 .

[50]  Augusto Ciuffoletti Monitoring a virtual network infrastructure: an IaaS perspective , 2010, CCRV.

[51]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[52]  Akihiro Nakao,et al.  A routing underlay for overlay networks , 2003, SIGCOMM '03.

[53]  C. R. Lin,et al.  QoS routing in ad hoc wireless networks , 1998, Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260).

[54]  Van Jacobson,et al.  A tool to infer characteristics of internet paths , 1997 .

[55]  Paul Barford,et al.  An active measurement system for shared environments , 2007, IMC '07.

[56]  Chase Cotton,et al.  Packet-level traffic measurements from the Sprint IP backbone , 2003, IEEE Netw..

[57]  Manish Jain,et al.  Pathload: A Measurement Tool for End-to-End Available Bandwidth , 2002 .

[58]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[59]  Jim Griffioen,et al.  The design of an instrumentation system for federated and virtualized network testbeds , 2012, 2012 IEEE Network Operations and Management Symposium.

[60]  Vyas Sekar,et al.  Revisiting the case for a minimalist approach for network flow monitoring , 2010, IMC '10.

[61]  M. Frans Kaashoek,et al.  A measurement study of available bandwidth estimation tools , 2003, IMC '03.

[62]  Singh Ghuman,et al.  Cloud Computing-A Study of Infrastructure as a Service , 2015 .

[63]  George N. Rouskas,et al.  Choice as a principle in network architecture , 2012, SIGCOMM '12.

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

[65]  Vern Paxson,et al.  End-to-end Internet packet dynamics , 1997, SIGCOMM '97.

[66]  Sujata Banerjee,et al.  Bandwidth-Aware Routing in Overlay Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[67]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[68]  Jim Griffioen,et al.  Isn't it time you had an emulab? , 2008, SIGCSE '08.

[69]  D. Martin Swany,et al.  PerfSONAR: A Service Oriented Architecture for Multi-domain Network Monitoring , 2005, ICSOC.

[70]  Michael Walfish,et al.  A Policy Framework for the Future Internet , 2009, HotNets.

[71]  Nick Feamster,et al.  In VINI veritas: realistic and controlled network experimentation , 2006, SIGCOMM.