Skip to main content

Minimum Regret Approach to Network Management under Uncertainty with Applications to Connection Admission Control and Routing

  • Conference paper
Networking — ICN 2001 (ICN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2094))

Included in the following conference series:

Abstract

This paper proposes a framework for network management intended to balance network performance under normal steady operational conditions with robustness under non-steady, and/or adverse conditions. Working in conjunction with anomaly and/or intrusion detection, the proposed framework allows the network to develop a set of measured responses to possible anomalies and external threats by minimizing the average maximum network losses, i.e., regrets or risks, due to uncertainty. Loss maximization guards against uncertainty within each scenario. Averaging of the maximum losses reflects an available information on the likelihood of different scenarios. The proposed framework includes Bayesian and minimax approaches as particular cases. The paper demonstrates how the proposed framework can alleviate high sensitivity of a cost-based admission and routing scheme to uncertain resource costs and possible presence of excessive and/or adversarial traffic. Specific examples include competitive and minimum interference admission and routing schemes.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

References

  1. Courcoubetis, C., Kelly, F.P., and Weber, R., Measurement-based usage charges in communication networks. http://www.statslab.cam.ac.uk/Reports/1997/

  2. Bonomi, F., Mitra, D, and Seery, J., Adaptive algorithms for feedback-based flow control in high-speed wide-area networks. IEEE JSAC, 13 (1995) 1267–1283

    Google Scholar 

  3. Low, S.H., and Varaiya, P.P., A new approach to service provisioning in ATM networks. IEEE Trans. On Networking, 1 (1993) 547–553

    Article  Google Scholar 

  4. MacKie-Mason, J.K. and Varian, H.R., Pricing congestible network resources. IEEE JSAC, 13 (1995) 1141–1149

    Google Scholar 

  5. Shenker, S., Fundamental design issues for the future Internet. IEEE JSAC, 13 (1995) 1176–1188

    Google Scholar 

  6. Gibbens, R. and Kelly, F.P., Resource pricing and evolution of congestion control. http://www.statslab.cam.ac.uk/~frank/PAPERS/evol.html

  7. Kelly, F.P., Mauloo, A., and Tan, D., Rate control in communication networks: shadow prices, proportional fairness and stability. J. of the Oper. Res. Soc., 49 (1998) 237–252

    MATH  Google Scholar 

  8. Mahajan, R., Bellovin, S.M., Floyd, S., Ioannidis, J., Paxson, V., and Shenker, S., Controlling high bandwidth aggregates in the network. http://www.research.att.com/~smb/papers/

  9. Plotkin, S., Competitive routing of virtual circuits in ATM networks. IEEE JSAC, 13 (1995) 1128–1136

    Google Scholar 

  10. Kar, K., Kodialam, M., and Lakshman, T.V., Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE JSAC, 18 (2000) 2566–2579

    Google Scholar 

  11. Harsanyi, J.C., Papers in Game Theory. Reidel Publishing Company (1982)

    Google Scholar 

  12. Blackwell, D. and Girschick, M., Theory of Games and Statistical Decisions. Wiley, New York (1954)

    Google Scholar 

  13. Marbukh, V., Network management under incomplete information on the operational environment. Intern. Symp. on Inform. Theory and its Appl. (ISITA2000) 637–640

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marbukh, V. (2001). Minimum Regret Approach to Network Management under Uncertainty with Applications to Connection Admission Control and Routing. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-47734-9_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42303-4

  • Online ISBN: 978-3-540-47734-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics