Scheduling algorithms for different approaches to quality of service provisioning

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Brachman, A., & Mieszczanin, J. (2011). Scheduling algorithms for different approaches to quality of service provisioning. In Communications in Computer and Information Science (Vol. 160 CCIS, pp. 135–143). https://doi.org/10.1007/978-3-642-21771-5_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free