Skip to main content

Resource Allocation in a Multiple-Priority Buffered Link

  • Conference paper
Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7984))

  • 1146 Accesses

Abstract

In this paper we consider a multiple-priority buffered link, with a focus on resource allocation issues; our study was motivated by such issues in Carrier Ethernet, but the applicability of the results is by no means limited to this technology. In our model, the resource is shared by two priority classes. As the high-priority queue — intended for traffic generated by delay-sensitive applications — typically has a small buffer, the low-priority queue can be modelled as a queue with a time-varying service rate; this service rate behaves independently of the input of the low-priority queue. The analysis of the high-priority queue is standard, and we therefore provide an in-depth study of the performance of the low-priority queue. Assuming that all traffic offered to the system is subjected to a leaky-bucket type of policer, one of the approaches that we present borrows elements from the setup of [6], in which the notion of effective bandwidth plays a crucial role.

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. Botvich, D., Duffield, N.: Large deviations, economies of scale, and the shape of the loss curve in large multiplexers. Queueing Systems 20, 293–320 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Brichet, F., Mandjes, M., Sánchez-Cañabate, M.: COST 257, Mid-term seminar interim report on admission control (1999), http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.34.7415&rep=rep1&type=pdf

  3. Dembo, A., Zeitouni, O.: Large deviations techniques and applications, 2nd edn. Springer, New York (1998)

    Book  MATH  Google Scholar 

  4. Doshi, B.: Deterministic rule based traffic descriptors for broadband ISDN: worst case behavior and connection acceptance control. In: Proceedings of ITC 14, Antibes Juan-les-Pins, France, pp. 591–600 (1997)

    Google Scholar 

  5. Elwalid, A., Mitra, D.: Analysis, approximations and admission control of a multi-service multiplexing system with priorities. In: Proceedings of IEEE INFOCOM, New York, NY, USA, pp. 463–472 (1995)

    Google Scholar 

  6. Elwalid, A., Mitra, D., Wentworth, R.: A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node. IEEE Journal on Selected Areas in Communications 13, 1115–1127 (1995)

    Article  Google Scholar 

  7. Fang, L., Bitar, N., Zhang, R., Taylor, M.: The evolution of Carrier Ethernet services — requirements and deployment case studies. IEEE Communications Magazine, 69–76 (March 2008)

    Google Scholar 

  8. Kelly, F.: Loss networks. Annals of Applied Probability 1, 319–378 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kesidis, G., Konstantopoulos, T.: Worst-case performance of a buffer with independent shaped arrival processes. IEEE Communications Letters 4, 26–28 (2000)

    Article  Google Scholar 

  10. Kulkarni, V., Gautam, N.: Admission control of multi-class traffic with service priorities in high-speed networks. Queueing Systems 27, 79–97 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mandjes, M.: Large Deviations of Gaussian Queues. Wiley, Chichester (2007)

    Book  Google Scholar 

  12. Mandjes, M., Mannersalo, P., Norros, I.: Priority queues with Gaussian input: a path-space approach to loss and delay asymptotics. In: Proceedings of ITC 19, Beijing, China, pp. 1135–1144 (2005)

    Google Scholar 

  13. Mandjes, M., Ridder, A.: Optimal trajectory to overflow in a queue fed by a large number of sources. Queueing Systems 31, 137–170 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mannersalo, P., Norros, I.: A most probable path approach to queueing systems with general Gaussian input. Computer Networks 40, 399–412 (2002)

    Article  Google Scholar 

  15. Onvural, R.: Asynchronous Transfer Mode Networks: Performance Issues, 2nd edn. Artech House, Norwood (1995)

    Google Scholar 

  16. Reisslein, M., Ross, K.W., Rajagopal, S.: Packet multiplexers with adversarial regulated traffic. In: Proceedings of IEEE INFOCOM, San Francisco, CA, pp. 347–355 (1998)

    Google Scholar 

  17. Roberts, J., Mocci, U., Virtamo, J.: Broadband Network Teletraffic: Final Report of Action COST 242. Springer, Berlin (1996)

    Book  Google Scholar 

  18. Sung, Y.-W.E., Lund, C., Lyn, M., Rao, S., Sen, S.: Modeling and understanding end-to-end class of service policies in operational networks. In: Proceedings of ACM Special Interest Group on Data Communications (SIGCOMM), Barcelona, Spain (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Żuraniewski, P., Mandjes, M., van den Berg, H., Malhotra, R. (2013). Resource Allocation in a Multiple-Priority Buffered Link. In: Dudin, A., De Turck, K. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2013. Lecture Notes in Computer Science, vol 7984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39408-9_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39408-9_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39407-2

  • Online ISBN: 978-3-642-39408-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics