Management of Quality of Service through Chance-constraints in Multimedia Networks

  • E. A. Medova
  • J. E. Scott
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 49)


Recently stochastic programming with recourse has been used in telecommunication models with multiple traffic scenarios to result in large scale linear programmes for network design. In this paper we use large deviation theory to invert chance constraints involving simultaneous quality-of-service blocking probabilities at several network time scale layers to result in node and arc-path incidence formulations of continuous multicommodity network flow problems involving deterministic effective bandwidths of origin-destination stochastic traffic flows in the network. These compact deterministic linear programmes are used in the paper to size network resource capacities, route traffic in a proportionally fair manner, price resources and design peak resource pricing customer tariffs. Our Integrated Network Design System software, which incorporates more network resource and traffic types than are treated here in detail, is also described briefly.


Asynchronous Transfer Mode Effective Bandwidth Capacity Allocation Virtual Path Asynchronous Transfer Mode Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Bonatti and F. Fantauzzi and A.A. Gaivoronski (1996) Stochastic programming approach to dynamic virtual path capacity allocation in ATM networks. In Proceedings of the 4th International Conference on Telecommunication Systems, pages 270–275. Vanderbilt University, Nashville.Google Scholar
  2. [2]
    Dash Associates Limited (1998) XPRESS-MP User Guide. Blisworth, Northants, UK. 10th edition.Google Scholar
  3. [3]
    G. de Veciana, G. Kesidis and J. Walrand (1995). Resource management in wide-area ATM networks using effective bandwidths. IEEE Journal on Selected Areas in Communications, 13: 1081–1090.CrossRefGoogle Scholar
  4. [4]
    M.A.H. Dempster (1994). Hierarchical approximation of telecommunications networks. BT Technology Journal, 12, pages 40–49.Google Scholar
  5. [5]
    M. Dempster, E. Medova, H. Azmoodeh, P. Key and S. Sargood (1996). Design and control of ATM/SDH Networks. In Proceedings of the 4th International Conference on Telecommunication Systems, pages 259–270. Vanderbilt University, Nashville.Google Scholar
  6. [6]
    A. Elwalid and D. Mitra (1993). Effective bandwidth of general Markovian traffic sources and admission control of high speed networks. In IEEE/ACM Transactions on Networking, volume 1, pages 329–343.Google Scholar
  7. [7]
    L. Fratta, M. Gerla and L. Kleinrock (1973) The flow deviation method: An application to store-and-forward communication network design. Networks, 3: 97–133MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    H. Greenberg (1993). Modeling by Object-Driven Linear Elemental Relations: A User’s Guide for MODLER. Kluwer Academic Publishers.zbMATHCrossRefGoogle Scholar
  9. [9]
    R. Guerin, H. Ahmadi and M. Naghshineh (1991). Equivalent Capacity and its Application in High-Speed Networks. IEEE Journal on Selected Areas in Communication, 9: 968–981.CrossRefGoogle Scholar
  10. [10]
    J. Hu (1970). Integer Programming and Network Flows. Addison-Wesley Publishing Company, Inc.Google Scholar
  11. [11]
    J.Y. Hui (1988). Resource allocation for broadband networks. IEEE Journal on Selected Areas in Communications, 6: 1598–1610.CrossRefGoogle Scholar
  12. [12]
    J.Y. Hui, M.B. Gursoy, N. Moayeri and R.D. Yates (1991). A Layered broadband switching architecture with physical or virtual path configurations IEEE Journal on Selected Areas in Communications, 9: 1416–1426.CrossRefGoogle Scholar
  13. [13]
    J.S. Kaufman (1981) Blocking in a shared resource environment. IEEE Transactions on Communications, 29, pages 1474–1481.CrossRefGoogle Scholar
  14. [14]
    F.P. Kelly, A.K. Maulloo and D.H.K. Tan (1998). Rate control in communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49, pages 237–252.zbMATHGoogle Scholar
  15. [15]
    F. P. Kelly (1995). Modelling communication networks, present and future. Proceedings of the Royal Society of London A, 444, pages 1–20.Google Scholar
  16. [16]
    E. Medova (1998). Chance-constrained stochastic programming for integrated services network management. Annals of Operations Research, 81, pages 213–229.MathSciNetzbMATHCrossRefGoogle Scholar
  17. [17]
    E.A. Medova and J.E. Scott (2000). Evolving system architectures for multimedia network design. Annals of Operations Research (forthcoming).Google Scholar
  18. [18]
    Nortel (1991). Synchronous Transmission Systems. Northern Telecom Europe Ltd, London.Google Scholar
  19. [19]
    S. Sen, R. Doverspike and S. Cosares (1994). Network planning with random demand. Telecommunication Systems, 3, pages 11–30.CrossRefGoogle Scholar
  20. [20]
    A. Weiss (1995). An introduction to large deviations for communication networks. IEEE Journal on Selected Areas in Communications, 6, pages 938–953.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • E. A. Medova
    • 1
  • J. E. Scott
    • 1
  1. 1.The Judge Institute of Management StudiesUniversity of CambridgeEngland

Personalised recommendations