Optimization Algorithms with Applications to Unicast QoS Routing in Overlay Networks

The research report is focused on optimization algorithms with application to quality of service (QoS) routing. A brief theoretical background is provided for mathematical tools in relation to optimization theory. The rest of the report provides a survey of different types of optimization algorithms: several numerical methods, a heuristics and a metaheuristic. In particular, we discuss basic descent methods, gradient-based methods, particle swarm optimization (PSO) and a constrained-path selection algorithm called Self-Adaptive Multiple Constraints Routing Algorithm (SAMCRA).

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

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

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

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

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

[6]  Jim Hefferon,et al.  Linear Algebra , 2012 .

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

[8]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

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

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

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

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

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

[15]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

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

[17]  Dragos Ilie,et al.  Gnutella Network Traffic : Measurements and Characteristics , 2006 .

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

[19]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

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

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

[22]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 1993, IEEE Communications Magazine.

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

[24]  C. H. Edwards.  Advanced calculus of several variables , 1973 .

[25]  G. Shilov,et al.  Linear Algebra , 1971 .

[26]  R. A. Silverman,et al.  Introductory Real Analysis , 1972 .

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

[28]  Klara Nahrstedt,et al.  Quality-of-Service routing with path information aggregation , 2007, Comput. Networks.

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

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

[31]  Mischa Schwartz,et al.  ACM SIGCOMM computer communication review , 2001, CCRV.

[32]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[33]  W. Rudin.  Principles of mathematical analysis , 1964 .

[34]  Ion Stoica,et al.  Characterizing selfishly constructed overlay routing networks , 2004, IEEE INFOCOM 2004.

[35]  Jon Crowcroft,et al.  QoS's downfall: at the bottom, or not at all! , 2003, RIPQoS '03.

[36]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[37]  Bruce S. Davie,et al.  Computer Networks: A Systems Approach , 1996 .

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

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

[40]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[41]  Richard W. Hamming,et al.  Numerical Methods for Scientists and Engineers , 1962 .

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

[43]  Grenville J. Armitage.  Revisiting IP QoS: why do we care, what have we learned? ACM SIGCOMM 2003 RIPQOS workshop report , 2003, CCRV.

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

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

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

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

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

[49]  Richard A. Silverman,et al.  Elementary real and complex analysis , 1973 .

[50]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[51]  Randall R. Holmes,et al.  Introduction to Topology , 2008 .

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

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