Optimization Issues in Quality of Service

The advent of the World Wide Web has fundamentally changed the nature of Internet traffic. New classes of applications, such as video conferencing, Internet telephony and various forms of e-commerce have arisen, for which so-called best effort service is no longer acceptable. These new applications represent delay-sensitive traffic with specific performance requirements. The term Quality of Service (QoS) is used to describe network features that are designed to provide the better than best effort performance that is required by such applications. In this chapter, we consider QoS in the context of network design. Specifically, we focus on network design or optimization problems that address link topology, link capacity, route assignment and/or router location, and that take various performance requirements into account. In particular, solutions to these network design problems ensure that sufficient resources (e.g., bandwidth) are made available so that certain specified performance requirements (e.g., delay requirements) will be explicitly met.

[1]  O. J. Wasem,et al.  Forecasting broadband demand between geographic areas , 1995 .

[2]  Donald T. Tang,et al.  Discrete Link Capacity and Priority Assignments in Communication Networks , 1977, IBM J. Res. Dev..

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

[4]  Philippe Mahey,et al.  A Survey of Algorithms for Convex Multicommodity Flow Problems , 2000 .

[5]  Leonard Kleinrock.  Analytic and simulation methods in computer network design , 1970, AFIPS '70 (Spring).

[6]  Farouk Kamoun,et al.  Optimal clustering structures for hierarchical topological design of large computer networks , 1980, Networks.

[7]  Samuel Pierre,et al.  A tabu-search approach for designing computer-network topologies with unreliable components , 1997 .

[8]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[9]  Kaushal Chari,et al.  Multi-hour design of computer backbone networks , 1996, Telecommun. Syst..

[10]  Clyde L. Monma,et al.  Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions , 1990, Math. Oper. Res..

[11]  Albert G. Greenberg,et al.  Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.

[12]  Doan B. Hoang,et al.  Joint Optimization of Capacity and Flow Assignment in a Packet-Switched Communications Network , 1987, IEEE Trans. Commun..

[13]  Clyde L. Monma,et al.  Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks , 1986, IEEE J. Sel. Areas Commun..

[14]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

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

[16]  Mikkel Thorup,et al.  Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..

[17]  T. V. Lakshman,et al.  A new method for analyzing feedback-based protocols with applications to engineering Web traffic over the Internet , 2003, Comput. Commun..

[18]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[19]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[20]  Ronny Vogel,et al.  QoS-Based Routing of Multimedia Streams in Computer Networks , 1996, IEEE J. Sel. Areas Commun..

[21]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

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

[23]  Hong-Hsu Yen,et al.  Near-optimal delay constrained routing in virtual circuit networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[24]  Alexander Gersht,et al.  Joint Optimization of Data Network Design and Facility Selection , 1990, IEEE J. Sel. Areas Commun..

[25]  N.G. Chattopadhyay,et al.  An innovative technique for backbone network design , 1989, IEEE Trans. Syst. Man Cybern..

[26]  Tony Eyers,et al.  A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems , 2000, Telecommun. Syst..

[27]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[28]  Hong-Hsu Yen,et al.  Backbone Network Design with QoS Requirements , 2001, ICN.

[29]  Hanan Luss,et al.  A Resource Allocation Approach for the Generation of Service-Dependent Demand Matrices for Communications Networks , 2001, Telecommun. Syst..

[30]  Murali S. Kodialam,et al.  Bandwidth Allocation In Multicast Trees With QoS Constraints , 2003, Int. J. Inf. Technol. Decis. Mak..

[31]  A. Avritzer,et al.  Configuration synthesis for a heterogeneous backbone cluster and a PC-interface network , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[32]  Vikram Raj Saksena,et al.  Topological analysis of packet networks , 1989, IEEE J. Sel. Areas Commun..

[33]  B. John Oommen,et al.  Discretized learning automata solutions to the capacity assignment problem for prioritized networks , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[34]  Marcelo Gomes de Queiroz,et al.  A heuristic for the continuous capacity and flow assignment , 2003, Eur. J. Oper. Res..

[35]  Kemal Altinkemer,et al.  Topological design of wide area communication networks , 1992, Ann. Oper. Res..

[36]  Celso C. Ribeiro,et al.  Design of Survivable Networks: A survey , 2005 .

[37]  Bezalel Gavish,et al.  Backbone Network Design Tools with Economic Tradeoffs , 1990, INFORMS J. Comput..

[38]  Irina Neuman,et al.  A system for priority routing and capacity assignment in packet switched networks , 1992, Ann. Oper. Res..

[39]  Samuel Pierre,et al.  A genetic algorithm for designing distributed computer network topologies , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[40]  Henrique Pacca Loureiro Luna,et al.  Discrete capacity and flow assignment algorithms with performance guarantee , 2003, Comput. Commun..

[41]  Chung Gu Kang,et al.  Fault-tolerant design of packet switched network with unreliable links , 1997, Comput. Commun..

[42]  Richard T. Wong,et al.  Incorporating QoS into IP Enterprise Network Design , 2002, Telecommun. Syst..

[43]  B. John Oommen,et al.  Continuous Learning Automata Solutions to the Capacity Assignment Problem , 2000, IEEE Trans. Computers.

[44]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[45]  B. Gavish.  Topological design of computer communication networks — The overall design problem , 1992 .

[46]  Mario Gerla,et al.  The design of store-and-forward (s/f) networks for computer communications , 1973 .

[47]  Mikkel Thorup,et al.  Survivable IP network design with OSPF routing , 2007 .