Supporting application-based route selection

Unlike the current Internet where applications have little control over the path that their data travels, emerging network architectures enable applications to control the path their packets/flows take. Although an application can select its paths, providing an application with the up-to-date information needed to make an informed decision is a difficult problem. In particular, monitoring (i.e., collecting performance information about) a network the size of the Internet presents serious scalability challenges. In this paper, we present a network monitoring service that can provide applications with up-to-date network information, yet scale to the size of the Internet. Our network monitoring service dynamically selects and enables/disables monitoring points to focus on paths currently needed by applications. We present experimental results based on real-world traffic traces that show our system can provide up-to-date information for 80% of the paths used by applications by monitoring as few as 100 strategically identified locations in the Internet.

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

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

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

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

[5]  Praveen Yalagandula,et al.  Real-time End-to-end Network Monitoring in Large Distributed Systems , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

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

[7]  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.

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

[9]  Benoit Claise,et al.  Cisco Systems NetFlow Services Export Version 9 , 2004, RFC.

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

[11]  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).

[12]  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).

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

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

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

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

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

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

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

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

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