Skip to main content

Dynamic Resource Allocation in Quality of Service Networks

  • Conference paper
Wireless Systems and Network Architectures in Next Generation Internet (EuroNGI 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3883))

Included in the following conference series:

  • 472 Accesses

Abstract

Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to offer services that satisfy the QoS requirements of individual users while guaranteeing at the same time an efficient utilization of network resources. In this paper we introduce a new service model that provides quantitative per-flow bandwidth guarantees, where users subscribe for a guaranteed rate; moreover, the network periodically individuates unused bandwidth and proposes short-term contracts where extra-bandwidth is allocated and guaranteed exclusively to users who can exploit it to transmit at a rate higher than their subscribed rate. To implement this service model we propose a dynamic provisioning architecture for intra-domain Quality of Service networks. We develop an efficient bandwidth allocation algorithm that takes explicitly into account traffic statistics to increase the users’ benefit and the network revenue simultaneously. We demonstrate through simulation in realistic network scenarios that the proposed dynamic provisioning model is superior to static provisioning in providing resource allocation both in terms of total accepted load and network revenue.

This work is partially supported by the National Council for Scientific Research in Lebanon.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Campbell, A.T., Liao, R.R.-F.: Dynamic Core Provisioning for Quantitative Differentiated Services. IEEE/ACM Transactions on Networking 12(3), 429–442 (2004)

    Article  Google Scholar 

  2. Schulzrinne, H., Wang, X.: Incentive-Compatible Adaptation of Internet Real-Time Multimedia. IEEE Journal on Selected Areas in Communications 23(2), 417–436 (2005)

    Article  Google Scholar 

  3. Campbell, A.T., Liao, R.R.-F.: Dynamic Edge Provisioning for Core IP Networks. In: Proc. IEEE/IFIP Int’l Workshop on Quality of Service IWQOS, Pittsburgh, USA (June 2000)

    Google Scholar 

  4. Ahmed, T., Boutaba, R., Mehaoua, A.: A Measurement-Based Approach for Dynamic QoS Adaptation in DiffServ Network. Journal of Computer Communications, Special issue on End-to-End Quality of Service Differentiation, Elsevier Science (2004)

    Google Scholar 

  5. de Meer, H., O’Hanlon, P.: Segmented Adaptation of Traffic aggregates. In: Proc. 9th International Workshop on Quality of Service IWQOS, Karlsruhe, Germany, June 6-8, pp. 342–353 (2001)

    Google Scholar 

  6. Mahajan, M., Parasharand, M., Ramanathan, A.: Active Resource Management for the Differentiated Services Environment. International Journal of Network Management 14(3), 149–165 (2004)

    Article  Google Scholar 

  7. Cao, Z., Zegura, E.: Utility Max-Min: An Application-Oriented Bandwidth Allocation Scheme. In: Proc. IEEE Infocom 1999, New York, USA (March 1999)

    Google Scholar 

  8. Kelly, F.: Charging and rate control for elastic traffic. European Transactions on Telecommunications 8, 33–37 (1997)

    Article  Google Scholar 

  9. Aweya, J., Ouellette, M., Montuno, D.Y.: A simple, scalable and provably stable explicit rate computation scheme for flow control in computer networks. Int. J. Commun. Syst. 14(6), 593–618 (2001)

    Article  MATH  Google Scholar 

  10. Aweya, J., Ouellette, M., Montuno, D.Y.: Design and stability analysis of a rate control algorithm using the Routh-Hurwitz stability criterion. IEEE/ACM Transactions on Networking 12(4), 719–732 (2004)

    Article  Google Scholar 

  11. Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)

    MATH  Google Scholar 

  12. Breslau, L., Shenker, S.: Best-Effort versus Reservations: A Simple Comparative Analysis. In: Proc. ACM SIGCOMM, September 1998, pp. 3–16 (1998)

    Google Scholar 

  13. Lee, J.W., Mazumdar, R.R., Shroff, N.B.: Non-Convex Optimization and Rate Control for Multi-Class Services in the Internet. IEEE/ACM Transactions on Networking 13(4), 827–840 (2005)

    Article  Google Scholar 

  14. Schulzrinne, H., Wang, X.: RNAP: A resource negotiation and pricing protocol. In: Int. Workshop Netw. Oper. Syst. Support Digital Audio Video, Basking Ridge, NJ, June 1999, pp. 77–93 (1999)

    Google Scholar 

  15. J-Sim. Ohio State University, Available at: www.j-sim.org

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Capone, A., Elias, J., Martignon, F., Pujolle, G. (2006). Dynamic Resource Allocation in Quality of Service Networks. In: Cesana, M., Fratta, L. (eds) Wireless Systems and Network Architectures in Next Generation Internet. EuroNGI 2005. Lecture Notes in Computer Science, vol 3883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750673_15

Download citation

  • DOI: https://doi.org/10.1007/11750673_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34025-6

  • Online ISBN: 978-3-540-34026-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics