Skip to main content
SpringerLink
Log in

Optimization Issues in Quality of Service

  • Chapter
Handbook of Optimization in Telecommunications

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • K. Altinkemer and Z. Yu. Topological design of wide area communication networks. Annals of Operations Research, 3:365–38, 1992.

    Article  Google Scholar 

  • J. Betser, A. Avritzer, J.W. Carlyle, and W.J. Karplu. Configuration synthesis for a heterogeneous backbone cluster and a PC-interface network. In Proceedings of IEEE INFOCOM 8, pages 400–40, 1989.

    Google Scholar 

  • L.S. Buriol, M.G.C. Resende, C.C. Ribeiro, and M. Thorup. A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks, 2005. In press.

    Google Scholar 

  • L.S. Buriol, M.G.C. Resende, and M. Thorup. Survivable IP network design with OSPF routing. Technical Report TD-64KUAW, AT&T Labs Research, 2004.

    Google Scholar 

  • K. Chari. Multi-hour design of computer backbone networks. Telecommunications Systems, 6:347–365, 1996.

    Article  Google Scholar 

  • N.G. Chattopadhyay, T.W. Morgan, and A. Raghuram. An innovative technique for backbone network design. IEEE Transactions on Systems, Man and Cybernetics, 19:1122–1132, 1989.

    Article  Google Scholar 

  • M. Ericsson, M.G.C. Resende, and P.M. Pardalos. A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization, 6:299–333, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  • R.P.M. Ferreira and H.P.L. Luna. Discrete capacity and flow assignment algorithms with performance guarantee. Computer Communications, 26:1056–1069, 2003.

    Article  Google Scholar 

  • S. Floyd and V. Jacobson. Link sharing and resource management models for packet networks. IEEE/ACM Transactions on Networking, 3:365–386, 1995.

    Article  Google Scholar 

  • B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine, 40:118–124, 2002.

    Article  Google Scholar 

  • B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proceedings of IEEE INFOCOM 2000, pages 519–528, 2000.

    Google Scholar 

  • B. Fortz and M. Thorup. Optimizing OSPF/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications, 20:756–767, 2002.

    Article  Google Scholar 

  • L. Fratta, M. Gerla, and L. Kleinrock. The flow deviation method: An approach to store-and-forward computer communication network design. Networks, 3:97–133, 1973.

    Article  MATH  MathSciNet  Google Scholar 

  • B. Gavish. Topological design of computer communication networks — The overall design problem. European Journal of Operational Research, 58:149–172, 1992.

    Article  MATH  Google Scholar 

  • B. Gavish and K. Altinkemer. Backbone network design tools with economic tradeoffs. ORSA Journal on Computing, 2:236–252, 1990.

    MATH  Google Scholar 

  • B. Gavish and I. Neuman. A system for routing and capacity assignment in computer communication networks. IEEE Transactions on Communications, 37:360–366, 1989.

    Article  Google Scholar 

  • M. Gerla. The design of store-and-forward networks for computer communications. PhD thesis, School of Engineering and Applied Science, University of California, Los Angeles, 1973.

    Google Scholar 

  • M. Gerla and L. Kleinrock. On the topological design of distributed computer networks. IEEE Transactions on Communications, COM-25:48–61, 1977.

    Article  MathSciNet  Google Scholar 

  • A. Gersht and R. Weihmayer. Joint optimization of data network design and facility selection. IEEE Journal on Selected Areas in Communications, 8:1667–1681, 1990.

    Article  Google Scholar 

  • D.P. Heyman. Sizing Internet backbone links, 2003. Unpublished manuscript.

    Google Scholar 

  • D.P. Heyman, T.V. Lakshman, and A.L. Neidhardt. A new method for analyzing feedback-based protocols with applications to engineering Web traffic over the Internet. Computer Communications, 26:785–803, 2003.

    Article  Google Scholar 

  • C.G. Kang and H.H. Tan. Design of packet switched network with unreliable links. Computer Communications, 20:544–553, 1997.

    Article  Google Scholar 

  • L. Kleinrock. Analytic and simulation methods in computer network design. In Cong. Rec., Spring Joint Comput. Conf., AFIPS Conf Proc. 36, pages 568–579. AFIPS Press, 1970.

    Google Scholar 

  • L. Kleinrock and F. Kamoun. Optimal clustering structures for hierarchical topological design of large computer networks. Networks, 10:221–248, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  • J.G. Klincewicz. Hub location in backbone/tributary network design: A review. Location Science, 6:307–335, 1998.

    Article  Google Scholar 

  • J.G. Klincewicz, J.A. Schmitt, and R.T Wong. Incorporating QoS into IP Enterprise Network Design. Telecommunications Systems, 20:81–106, 2002.

    Article  Google Scholar 

  • A. Levi and C. Ersoy. Discrete link capacity assignment in prioritized computer networks: Two approaches. In Proceedings of the Ninth International Symposium on Computer and Information Sciences, pages 408–415, 1994.

    Google Scholar 

  • H. Luss and A. Vakhutinsky. A resource allocation approach for the generation of service-dependent demand matrices for communications networks. Telecommunications Systems, 17:411–433, 2001.

    Article  MATH  Google Scholar 

  • K. Maruyama and D.T. Tang. Discrete link capacity assignment in prioritized computer networks. IBM Journal of Research and Development, pages 254–263, 1977.

    Google Scholar 

  • C.L. Monma, A. Schrijver, M.J. Todd, and V.K. Wei. Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensions. Mathematics of Operations Research, 15:736–748, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  • C.L. Monma and D.D. Sheng. Backbone Network Design and Performance Analysis: A methodology for packet switching networks. IEEE Journal on Selected Areas in Communications, SAC-4:946–965, 1986.

    Article  Google Scholar 

  • I. Neuman. A system for priority routing and capacity assignment in packet switched networks. Annals of Operations Research, 36:225–246, 1992.

    Article  MATH  Google Scholar 

  • T.M.J. Ng and D.B. Hoang. Joint optimization of capacity and flow assignment in a packet-switched communications network. IEEE Transactions on Communications, COM-35:202–209, 1987.

    Article  Google Scholar 

  • B.J. Oommen and TD. Roberts. Continuous learning automata solutions to the capacity assignment problem. IEEE Transactions on Computers, 49:608–620, 2000.

    Article  Google Scholar 

  • B.J. Oommen and TD. Roberts. Discretized learning automata solutions to the capacity assignment problem for prioritized networks. IEEE Transactions on Systems, Man and Cybernetics — Part B: Cybernetics, 32:821–831, 2002.

    Article  Google Scholar 

  • A. Ouorou, P Mahey, and J-P. Vial. A survey of algorithms for convex multicommodity flow problems. Management Science, 46:126–147, 2000.

    Article  Google Scholar 

  • S. Pierre and A. Elgibaoui. A tabu-search approach for designing computer-network topologies with unreliable components. IEEE Transactions on Reliability, 46:350–359, 1997.

    Article  Google Scholar 

  • S. Pierre and G. Legault. A genetic algorithm for designing distributed computer network technologies. IEEE Transactions on Systems, Man and Cybernetics — Part B: Cybernetics, 28:249–258, 1998.

    Article  Google Scholar 

  • M. Queiroz and C. Humes Jr. A heuristic for the continuous capacity and flow assignment. European Journal of Operational Research, 146:444–459, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  • V.R. Saksena. Topological analysis of packet networks. IEEE Journal on Selected Areas in Communications, 7:1243–1252, 1989.

    Article  Google Scholar 

  • H.B. Shulman and V Venkateswaran. Resource allocation in tree networks under delay constraints, 1999. Presented at INFORMS Fall 1999 Meeting, Philadelphia, PA.

    Google Scholar 

  • C.H.E. Stacey, T. Eyers, and G.J. Anido. A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems. Telecommunications Systems, 13:351–372, 2000.

    Article  MATH  Google Scholar 

  • V. Venkateswaran and M. Kodialam. Bandwidth allocation in multicast trees with QoS constraints, 1999. Presented at INFORMS Spring 1999 Meeting. Cincinnati, OH.

    Google Scholar 

  • R. Vogel, R.G. Herrtwich, W. Kalfa, H. Wittig, and L.C. Wolf. QoS-based routing of multimedia streams in computer networks. IEEE Journal on Selected Areas in Communications, 14:1235–1244, 1996.

    Article  Google Scholar 

  • Z. Wang. Internet QoS: Architectures and Mechanisms for Quality of Service. Morgan Kaufmann, 2001.

    Google Scholar 

  • Z. Wang and J. Crowcroft. Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications, 14:1228–1234, 1996.

    Article  Google Scholar 

  • O.J. Wasem, A.M. Gross, and G.A. Tiapa. Forecasting broadband demand between geographic areas. IEEE Communications Magazine, 33:50–57, 1995.

    Article  Google Scholar 

  • H-H. Yen and F.Y-S. Lin. Backbone network design with QoS requirements. Lecture Notes in Computer Science, 2094:148–157, 2001a.

    Article  Google Scholar 

  • H-H. Yen and F.Y-S. Lin. Near-optimal delay constrained routing in virtual circuit networks. In Proceedings of IEEE INFOCOM 2001, pages 750–756, 2001b.

    Google Scholar 

  • Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg. Fast accurate computation of large-scale IP traffic matrices from link loads. In Proceedings of INFOCOMM 2003, 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Labs, Middletown, NJ, 07748, USA

    John G. Klincewicz

Authors
  1. John G. Klincewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Labs Research, Florham Park, New Jersey

    Mauricio G. C. Resende

  2. University of Florida, Gainesville, Florida

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Klincewicz, J.G. (2006). Optimization Issues in Quality of Service. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_17

Download citation

Publish with us

Policies and ethics

Search

Navigation