Skip to main content
SpringerLink
Log in

Scheduling Algorithms for Different Approaches to Quality of Service Provisioning

  • Conference paper
Computer Networks (CN 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 160))

Included in the following conference series:

Abstract

IP network provides only best effort delivery meaning, that data is transmitted at unspecified variable bit rate and delivery time is unknown, depending on the current traffic load. Nowadays, real-time traffic occupies significant percentage of the available bandwidth and Internet must evolve to support new applications. Therefore one of the main and crucial objective of the future Internet is to change best effort network into Quality of Service controlled network.

Authors believe that virtualization may be an important component of the Future Internet architecture as well, therefore we search for scheduling policy, that will be implementable as a physical network adapter scheduler in virtual monitor, capable of QoS provisioning. The main purpose of this paper is to review the existing scheduling algorithms and to consider their usage in virtual monitor with the aforementioned assumptions.

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 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. Ongaro, D., Cox, A.L., Rixner, S.: Scheduling I/O in virtual machine monitors. In: Proceedings of the fourth ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments. VEE 2008, pp. 1–10. ACM, New York (2008)

    Chapter  Google Scholar 

  2. Liao, G., Guo, D., Bhuyan, L., King, S.R.: Software techniques to improve virtualized I/O performance on multi-core systems. In: Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, USA, pp. 161–170. ACM, New York (2008)

    Chapter  Google Scholar 

  3. Lin, B., Dinda, P.: Vsched: Mixing batch and interactive virtual machines using periodic real-time scheduling. In: Proceedings of the ACM/IEEE SC 2005 Conference, Supercomputing 2005, p. 8 (2005)

    Google Scholar 

  4. You, X., Xu, X., Wan, J., Jiang, C.: Analysis and evaluation of the scheduling algorithms in virtual environment. In: Second International Conference on Embedded Software and Systems, pp. 291–296 (2009)

    Google Scholar 

  5. ITU-T: Y.1541, network performance objectives for IP-based services (2002)

    Google Scholar 

  6. ITU-T: G.1010 end-user multimedia QoS categories (2002)

    Google Scholar 

  7. Braden, R., Clark, D., Shenker, S.: Integrated Services in the Internet Architecture: an Overview. RFC 1633, Informational (1994)

    Google Scholar 

  8. Braden, R., Zhang, L., Berson, S., Herzog, S., Jamin, S.: Resource ReSerVation Protocol (RSVP) – Version 1 Functional Specification. RFC 2205 (Proposed Standard) (1997)

    Google Scholar 

  9. Nichols, K., Blake, S., Baker, F., Black, D.: Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers. RFC 2474 (Proposed Standard) (1998)

    Google Scholar 

  10. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Service. RFC 2475, Informational (1998)

    Google Scholar 

  11. Heinanen, J., Baker, F., Weiss, W., Wroclawski, J.: Assured Forwarding PHB Group. RFC 2597 (Proposed Standard) (1999)

    Google Scholar 

  12. Jacobson, V., Nichols, K., Poduri, K.: An Expedited Forwarding PHB. RFC 2598 (Proposed Standard) (1999)

    Google Scholar 

  13. Parekh, A., Gallager, R.: A generalized processor sharing approach to flow control in integrated services networks-the multiple node case. In: Proceedings of Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1993. Networking: Foundation for the Future, vol. 2, pp. 521–530. IEEE, Los Alamitos (1993)

    Google Scholar 

  14. Parekh, A., Gallager, R.: A generalized processor sharing approach to flow control in integrated services networks-the single node case. In: Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1992, vol. 2, pp. 915–924. IEEE, Los Alamitos (1992)

    Google Scholar 

  15. Bennett, J.C.R., Zhang, H.: Hierarchical packet fair queueing algorithms. SIGCOMM Comput. Commun. Rev. 26, 143–156 (1996)

    Article  Google Scholar 

  16. Bennett, J., Zhang, H.: WF2Q: worst-case fair weighted fair queueing. In: Proceedings of IEEE Fifteenth Annual Joint Conference of the IEEE Computer Societies, INFOCOM 1996. Networking the Next Generation, vol. 1, pp. 120–128 (1996)

    Google Scholar 

  17. Lee, J.F., Chen, M.C., Sun, Y.: WF2Q-M: Worst-case fair weighted fair queueing with maximum rate control. Computer Networks 51, 1403–1420 (2007)

    Article  MATH  Google Scholar 

  18. Zhang, H., Zhao, Y., Guan, H.T.: HPFQ-M: Hierarchical packet fair queuing algorithm with maximum rate control. In: Arabnia, H.R., Mun, Y. (eds.) PDPTA, pp. 110–115. CSREA Press (2008)

    Google Scholar 

  19. Ferrari, D., Verma, D.: A scheme for real-time channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications 8, 368–379 (1990)

    Article  Google Scholar 

  20. Zhang, H., Ferrari, D.: Rate-controlled service disciplines (1994)

    Google Scholar 

  21. Cruz, R.: Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications 13, 1048–1056 (1995)

    Article  Google Scholar 

  22. Sariowan, H., Cruz, R., Polyzos, G.: SCED: a generalized scheduling policy for guaranteeing quality-of-service. IEEE/ACM Transactions on Networking 7, 669–684 (1999)

    Article  Google Scholar 

  23. Stoica, I., Zhang, H., Ng, T.: A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services. IEEE/ACM Transactions on Networking 8, 185–199 (2000)

    Article  Google Scholar 

  24. Pyun, K., Song, J., Lee, H.K.: A generalized hierarchical fair service curve algorithm for high network utilization and link-sharing. Computer Networks 43, 669–694 (2003)

    Article  MATH  Google Scholar 

  25. Pyun, K., Song, J., Lee, H.K.: The service curve service discipline for the rate-controlled EDF service discipline in variable-sized packet networks. Computer Communications 29, 3886–3899 (2006)

    Article  Google Scholar 

  26. Jun, A.S., Choe, J., Leon-Garcia, A.: Hierarchical fair queuing: single-step approximation of hierarchical-GPS. In: Global Telecommunications Conference, GLOBECOM 2002, vol. 3, pp. 2405–2409. IEEE, Los Alamitos (2002)

    Chapter  Google Scholar 

  27. Le Boudec, J.-Y., Thiran, P.: Chapter 1: Network calculus. In: Thiran, P., Le Boudec, J.-Y. (eds.) Network Calculus. LNCS, vol. 2050, p. 3. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, ul. Akademicka 16, 44-100, Gliwice

    Agnieszka Brachman & Jakub Mieszczanin

Authors
  1. Agnieszka Brachman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jakub Mieszczanin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień , Piotr Gaj  & Piotr Stera ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brachman, A., Mieszczanin, J. (2011). Scheduling Algorithms for Different Approaches to Quality of Service Provisioning. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2011. Communications in Computer and Information Science, vol 160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21771-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21771-5_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21770-8

  • Online ISBN: 978-3-642-21771-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation