Scheduling algorithms for different approaches to quality of service provisioning

Agnieszka Brachman; Jakub Mieszczanin

doi:10.1007/978-3-642-21771-5_15

Scheduling algorithms for different approaches to quality of service provisioning

Agnieszka Brachman
, Jakub Mieszczanin

Department of Computer Networks and Systems (RAU/RAU9)

Silesian University of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Computer Networks - 18th Conference, CN 2011, Proceedings
Pages	135-143
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-642-21771-5_15
Publication status	Published - 2011
Event	18th Conference on Computer Networks, CN 2011 - Ustron, Poland Duration: 14 Jun 2011 → 18 Jun 2011

Publication series

Name	Communications in Computer and Information Science
Volume	160 CCIS
ISSN (Print)	1865-0929

Conference

Conference	18th Conference on Computer Networks, CN 2011
Country/Territory	Poland
City	Ustron
Period	14/06/11 → 18/06/11

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Keywords

hierarchical scheduling
quality of service
scheduling
service curve

ASJC Scopus subject areas

General Computer Science
General Mathematics

Access to Document

10.1007/978-3-642-21771-5_15

Cite this

@inproceedings{bb77196116984a71864fa4e17580fa0c,

title = "Scheduling algorithms for different approaches to quality of service provisioning",

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.",

keywords = "hierarchical scheduling, quality of service, scheduling, service curve",

author = "Agnieszka Brachman and Jakub Mieszczanin",

year = "2011",

doi = "10.1007/978-3-642-21771-5\_15",

language = "English",

isbn = "9783642217708",

series = "Communications in Computer and Information Science",

pages = "135--143",

booktitle = "Computer Networks - 18th Conference, CN 2011, Proceedings",

note = "18th Conference on Computer Networks, CN 2011 ; Conference date: 14-06-2011 Through 18-06-2011",

}

Brachman, A & Mieszczanin, J 2011, Scheduling algorithms for different approaches to quality of service provisioning. in Computer Networks - 18th Conference, CN 2011, Proceedings. Communications in Computer and Information Science, vol. 160 CCIS, pp. 135-143, 18th Conference on Computer Networks, CN 2011, Ustron, Poland, 14/06/11. https://doi.org/10.1007/978-3-642-21771-5_15

Scheduling algorithms for different approaches to quality of service provisioning. / Brachman, Agnieszka; Mieszczanin, Jakub.
Computer Networks - 18th Conference, CN 2011, Proceedings. 2011. p. 135-143 (Communications in Computer and Information Science; Vol. 160 CCIS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Scheduling algorithms for different approaches to quality of service provisioning

AU - Brachman, Agnieszka

AU - Mieszczanin, Jakub

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - hierarchical scheduling

KW - quality of service

KW - scheduling

KW - service curve

UR - https://www.scopus.com/pages/publications/79960292754

U2 - 10.1007/978-3-642-21771-5_15

DO - 10.1007/978-3-642-21771-5_15

M3 - Conference contribution

AN - SCOPUS:79960292754

SN - 9783642217708

T3 - Communications in Computer and Information Science

SP - 135

EP - 143

BT - Computer Networks - 18th Conference, CN 2011, Proceedings

T2 - 18th Conference on Computer Networks, CN 2011

Y2 - 14 June 2011 through 18 June 2011

ER -

Scheduling algorithms for different approaches to quality of service provisioning

Abstract

Publication series

Conference

UN SDGs

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this