Unicast QoS Routing in Overlay Networks

The goal of quality of service (QoS) routing in overlay networks is to address deficiencies in today's Internet Protocol (IP) routing. This is achieved by application-layer protocols executed on end-nodes, which search for alternate paths that can provide better QoS for the overlay hosts. In the first part of this paper we introduce fundamental concepts of QoS routing and the current state-of-the-art in overlay networks for QoS. In the remaining part of the paper we report performance results for the Overlay Routing Protocol (ORP) framework developed at Blekinge Institute of Technology (BTH) in Karlskrona, Sweden. The results show that QoS paths can be established and maintained as long as one is willing to accept a protocol overhead of maximum 1.5% of the network capacity.

[1]  W. Bastiaan Kleijn,et al.  Low-Complexity, Nonintrusive Speech Quality Assessment , 2006, IEEE Transactions on Audio, Speech, and Language Processing.

[2]  Zheng Wang,et al.  Internet QoS: Architectures and Mechanisms for Quality of Service , 2001 .

[3]  Christian Huitema,et al.  Routing in the Internet (2nd ed.) , 1999 .

[4]  C. Hauser,et al.  Beyond technology: the missing pieces for QoS success , 2003, RIPQoS '03.

[5]  Vern Paxson,et al.  Empirically derived analytic models of wide-area TCP connections , 1994, TNET.

[6]  J. J. Garcia-Lunes-Aceves.  Loop-free routing using diffusing computations , 1993 .

[7]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[8]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[9]  Miguel Castro,et al.  SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.

[10]  R. Larsen.  An introduction to mathematical statistics and its applications / Richard J. Larsen, Morris L. Marx , 1986 .

[11]  Kang G. Shin,et al.  Efficient dynamic routing in wide-area networks , 1999 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Kostas G. Anagnostakis,et al.  cing: measuring network-internal delays using only existing infrastructure , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Ben Y. Zhao,et al.  Towards a Common API for Structured Peer-to-Peer Overlays , 2003, IPTPS.

[15]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[16]  Christos Bouras,et al.  Service level agreements for DiffServ-based services' provisioning , 2005, J. Netw. Comput. Appl..

[17]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[18]  Daniel Stutzbach,et al.  Characterizing unstructured overlay topologies in modern P2P file-sharing systems , 2008, TNET.

[19]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[20]  Vladimir A. Bolotin.  Modeling call holding time distributions for CCS network design and performance analysis , 1994, IEEE J. Sel. Areas Commun..

[21]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[22]  Ralph B. D'Agostino,et al.  Goodness-of-Fit-Techniques , 2020 .

[23]  Joong Soo Ma,et al.  Mobile Communications , 2003, Lecture Notes in Computer Science.

[24]  Christoph P. Mayer,et al.  Integrating real world applications into OMNeT , 2008 .

[25]  Jan Beran,et al.  Statistics for long-memory processes , 1994 .

[26]  George Lindfield,et al.  Numerical Methods Using MATLAB , 1998 .

[27]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[28]  Michalis Faloutsos,et al.  File-sharing in the Internet: A characterization of P2P traffic in the backbone , 2003 .

[29]  Deborah Estrin,et al.  RSVP: a new resource ReSerVation Protocol , 1993 .

[30]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[31]  It Informatics,et al.  Border Gateway Protocol , 2013 .

[32]  John Wroclawski,et al.  The Use of RSVP with IETF Integrated Services , 1997, RFC.

[33]  Fabrice Guillemin,et al.  Experimental analysis of the impact of peer-to-peer applications on traffic in commercial IP networks , 2004, Eur. Trans. Telecommun..

[34]  David Erman,et al.  BitTorrent Session Characteristics and Models : Extended Version , 2005 .

[35]  Ayman Radwan,et al.  Non-intrusive single-ended speech quality assessment in VoIP , 2007, Speech Commun..

[36]  Piet Van Mieghem,et al.  Concepts of exact QoS routing algorithms , 2004, IEEE/ACM Transactions on Networking.

[37]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[38]  David Erman,et al.  Measurement and Analysis of BitTorrent Signaling Traffic , 2004 .

[39]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[40]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[41]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[42]  Nicolai M. Josuttis.  The C++ Standard Library: A Tutorial and Reference , 2012 .

[43]  Kevin Downs,et al.  Internetworking Technologies Handbook , 1997 .

[44]  Francis Lepage,et al.  Application-oriented network metrology: metrics and active measurement tools , 2005, IEEE Communications Surveys & Tutorials.

[45]  J. J. Garcia-Luna-Aceves,et al.  Distributed, scalable routing based on link-state vectors , 1994, SIGCOMM.

[46]  Prasant Mohapatra,et al.  QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[47]  Erol Gelenbe,et al.  Autonomous smart routing for network QoS , 2004 .

[48]  J. Sommers,et al.  A Geometric Approach to Improving Active Packet Loss Measurement , 2008, IEEE/ACM Transactions on Networking.

[49]  Adrian Popescu,et al.  Congestion and Error Control in Overlay Networks , 2007 .

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

[51]  Dragos Ilie,et al.  Optimization Algorithms with Applications to Unicast QoS Routing in Overlay Networks , 2007 .

[52]  Klara Nahrstedt,et al.  Distributed QoS routing with imprecise state information , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[53]  Jennifer Rexford,et al.  Toward internet-wide multipath routing , 2008, IEEE Network.

[54]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[55]  Fernando Kuipers,et al.  Quality of Service Routing in the Internet. Theory, Complexity and Algorithms , 2004 .

[56]  Richard W. Hamming,et al.  Numerical Methods for Scientists and Engineers , 1963 .

[57]  Jorge Nocedal,et al.  A Limited Memory Algorithm for Bound Constrained Optimization , 1995, SIAM J. Sci. Comput..

[58]  Randy H. Katz,et al.  OverQoS: An Overlay Based Architecture for Enhancing Internet QoS , 2004, NSDI.

[59]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in high-speed networks based on selective probing , 1998, Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260).

[60]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, J. Parallel Distributed Comput..

[61]  David Erman,et al.  Internet Content Distribution : Developments and Challenges , 2006 .

[62]  G. Hardin.  The Tragedy of the Commons , 2009 .

[63]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[64]  Franklin A. Graybill,et al.  Introduction to the Theory of Statistics, 3rd ed. , 1974 .

[65]  Adrian Popescu,et al.  A Framework for Overlay QoS Routing , 2007 .

[66]  A. Popescu,et al.  A Survey of Reliable Multicast Communication , 2007, 2007 Next Generation Internet Networks.

[67]  Piet Van Mieghem,et al.  Performance evaluation of constraint-based path selection algorithms , 2004, IEEE Network.

[68]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[69]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[70]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[71]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[72]  Michalis Faloutsos,et al.  Power laws and the AS-level internet topology , 2003, TNET.

[73]  Anukool Lakhina,et al.  BRITE: Universal Topology Generation from a User''s Perspective , 2001 .

[74]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[75]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[76]  Don Towsley,et al.  On the Interaction Between Overlay Routing and Traffic Engineering , 2004 .

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

[78]  Karel De Vogeleer,et al.  Constrained-Path Discovery by Selective Diffusion , 2008 .

[79]  Adrian Popescu,et al.  Statistical models for Gnutella signaling traffic , 2007, Comput. Networks.

[80]  Stefan Winkler,et al.  Perceived Audiovisual Quality of Low-Bitrate Multimedia Content , 2006, IEEE Transactions on Multimedia.

[81]  Arne A. Nilsson,et al.  Measurement and Analysis of Gnutella Signaling Traffic , 2004 .

[82]  Parag Pruthi,et al.  Application-level performance of multimedia services , 1999, Optics East.

[83]  N. L. Johnson,et al.  Continuous Univariate Distributions. , 1995 .

[84]  Gregory Bell,et al.  Failure to thrive: QoS and the culture of operational networking , 2003, RIPQoS '03.

[85]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[86]  J. J. Garcia-Luna-Aceves,et al.  Distributed, scalable routing based on link-state vectors , 1994, SIGCOMM 1994.

[87]  Ward Whitt,et al.  Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data , 1986, IEEE J. Sel. Areas Commun..

[88]  R. Wilder,et al.  Wide-area Internet traffic patterns and characteristics , 1997, IEEE Netw..

[89]  Marta M. B. Pascoal,et al.  A new implementation of Yen’s ranking loopless paths algorithm , 2003, 4OR.

[90]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[91]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[92]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[93]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[94]  John H. Maindonald,et al.  Data Analysis and Graphics Using R: An Example-Based Approach , 2010 .

[95]  William N. Venables,et al.  Modern Applied Statistics with S-Plus. , 1996 .

[96]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[97]  Erol Gelenbe,et al.  Cognitive packet networks: QoS and performance , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[98]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[99]  F N DAVID,et al.  The probability integral transformation when the variable is discontinuous. , 1950, Biometrika.

[100]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[101]  Adrian Popescu,et al.  Transfer Rate Models for Gnutella Signaling Traffic , 2006, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06).

[102]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[103]  J. Wolfowitz,et al.  Introduction to the Theory of Statistics. , 1951 .

[104]  S. Vavasis.  Nonlinear optimization: complexity issues , 1991 .

[105]  kc claffy,et al.  Bandwidth estimation: metrics, measurement techniques, and tools , 2003, IEEE Netw..

[106]  Subhash Suri,et al.  Finding the k shortest simple paths , 2007, ALENEX.

[107]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[108]  Klara Nahrstedt,et al.  Routing with topology aggregation in delay-bandwidth sensitive networks , 2004, IEEE/ACM Transactions on Networking.

[109]  Whay C. Lee,et al.  Topology aggregation for hierarchical routing in ATM networks , 1995, CCRV.

[110]  Jeffrey C. Lagarias,et al.  Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions , 1998, SIAM J. Optim..

[111]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.

[112]  Yezid Donoso,et al.  Multi-Objective Optimization in Computer Networks Using Metaheuristics , 2007 .

[113]  Azer Bestavros,et al.  Small-world characteristics of Internet topologies and implications on multicast scaling , 2006, Comput. Networks.

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

[115]  H. D. Miller,et al.  The Theory Of Stochastic Processes , 1977, The Mathematical Gazette.

[116]  Klara Nahrstedt,et al.  oStream: asynchronous streaming multicast in application-layer overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[117]  A. F. Smith,et al.  Statistical analysis of finite mixture distributions , 1986 .

[118]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[119]  Swapna S. Gokhale,et al.  Distributed QoS Routing for Backbone Overlay Networks , 2006, Networking.

[120]  Scott Shenker,et al.  Internet indirection infrastructure , 2004, TNET.

[121]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[122]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[123]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[124]  Ibrahim Matta,et al.  On the origin of power laws in Internet topologies , 2000, CCRV.

[125]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[126]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[127]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[128]  Walter Willinger,et al.  Laboratory-based calibration of available bandwidth estimation tools , 2007, Microprocess. Microsystems.

[129]  M. Wand.  Data-Based Choice of Histogram Bin Width , 1997 .

[130]  Mordecai Avriel,et al.  Nonlinear programming , 1976 .

[131]  Erol Gelenbe,et al.  Self-aware networks and QoS , 2004, Proceedings of the IEEE.

[132]  Piet Van Mieghem,et al.  Conditions that impact the complexity of QoS routing , 2005, IEEE/ACM Transactions on Networking.

[133]  Stephen A. Cook,et al.  An overview of computational complexity , 1983, CACM.

[134]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[135]  Klara Nahrstedt,et al.  Routing Support for Providing Guaranteed End-to-End Quality-of-Service , 1999 .

[136]  Douglas C. Montgomery,et al.  Applied Statistics and Probability for Engineers, Third edition , 1994 .

[137]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

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