Resource allocation in a multiple-priority buffered link

Piotr Zuraniewski; Michel Mandjes; Hans van den Berg; Richa Malhotra

doi:10.1007/978-3-642-39408-9_32

Resource allocation in a multiple-priority buffered link

Piotr Zuraniewski, Michel Mandjes, Hans van den Berg, Richa Malhotra

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

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.

Original language	English
Title of host publication	Analytical and Stochastic Modelling Techniques and Applications
Subtitle of host publication	20th International Conference, ASMTA 2013, Ghent, Belgium, July 8-10, 2013. Proceedings
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	457-471
Number of pages	15
ISBN (Electronic)	978-3-642-39408-9
ISBN (Print)	978-3-642-39407-2
DOIs	https://doi.org/10.1007/978-3-642-39408-9_32
Publication status	Published - 2013
Externally published	Yes
Event	20th International Conference on Analytical and Stochastic Modelling Techniques and Applications, ASMTA 2013 - Ghent, Belgium Duration: 8 Jul 2013 → 10 Jul 2013 Conference number: 20

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	7984
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th International Conference on Analytical and Stochastic Modelling Techniques and Applications, ASMTA 2013
Abbreviated title	ASMTA
Country	Belgium
City	Ghent
Period	8/07/13 → 10/07/13

Keywords

Carrier ethernet
Effective bandwidth
Large deviations
Priority queues
Resource allocation

Access to Document

10.1007/978-3-642-39408-9_32

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Resource allocation in a multiple-priority buffered link'. Together they form a unique fingerprint.

Cite this

Zuraniewski, P., Mandjes, M., van den Berg, H., & Malhotra, R. (2013). Resource allocation in a multiple-priority buffered link. In Analytical and Stochastic Modelling Techniques and Applications: 20th International Conference, ASMTA 2013, Ghent, Belgium, July 8-10, 2013. Proceedings (pp. 457-471). (Lecture Notes in Computer Science; Vol. 7984). Springer. https://doi.org/10.1007/978-3-642-39408-9_32

Zuraniewski, Piotr ; Mandjes, Michel ; van den Berg, Hans ; Malhotra, Richa. / Resource allocation in a multiple-priority buffered link. Analytical and Stochastic Modelling Techniques and Applications: 20th International Conference, ASMTA 2013, Ghent, Belgium, July 8-10, 2013. Proceedings. Berlin, Heidelberg : Springer, 2013. pp. 457-471 (Lecture Notes in Computer Science).

@inproceedings{c2e4bef747254a479e0feae834bde396,

title = "Resource allocation in a multiple-priority buffered link",

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

keywords = "Carrier ethernet, Effective bandwidth, Large deviations, Priority queues, Resource allocation",

author = "Piotr Zuraniewski and Michel Mandjes and {van den Berg}, Hans and Richa Malhotra",

year = "2013",

doi = "10.1007/978-3-642-39408-9_32",

language = "English",

isbn = "978-3-642-39407-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "457--471",

booktitle = "Analytical and Stochastic Modelling Techniques and Applications",

note = "20th International Conference on Analytical and Stochastic Modelling Techniques and Applications, ASMTA 2013, ASMTA ; Conference date: 08-07-2013 Through 10-07-2013",

}

Zuraniewski, P, Mandjes, M, van den Berg, H & Malhotra, R 2013, Resource allocation in a multiple-priority buffered link. in Analytical and Stochastic Modelling Techniques and Applications: 20th International Conference, ASMTA 2013, Ghent, Belgium, July 8-10, 2013. Proceedings. Lecture Notes in Computer Science, vol. 7984, Springer, Berlin, Heidelberg, pp. 457-471, 20th International Conference on Analytical and Stochastic Modelling Techniques and Applications, ASMTA 2013, Ghent, Belgium, 8/07/13. https://doi.org/10.1007/978-3-642-39408-9_32

Resource allocation in a multiple-priority buffered link. / Zuraniewski, Piotr; Mandjes, Michel; van den Berg, Hans; Malhotra, Richa.

Analytical and Stochastic Modelling Techniques and Applications: 20th International Conference, ASMTA 2013, Ghent, Belgium, July 8-10, 2013. Proceedings. Berlin, Heidelberg : Springer, 2013. p. 457-471 (Lecture Notes in Computer Science; Vol. 7984).

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

TY - GEN

T1 - Resource allocation in a multiple-priority buffered link

AU - Zuraniewski, Piotr

AU - Mandjes, Michel

AU - van den Berg, Hans

AU - Malhotra, Richa

N1 - Conference code: 20

PY - 2013

Y1 - 2013

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

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

KW - Carrier ethernet

KW - Effective bandwidth

KW - Large deviations

KW - Priority queues

KW - Resource allocation

UR - http://www.scopus.com/inward/record.url?scp=84884968346&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-39408-9_32

DO - 10.1007/978-3-642-39408-9_32

M3 - Conference contribution

AN - SCOPUS:84884968346

SN - 978-3-642-39407-2

T3 - Lecture Notes in Computer Science

SP - 457

EP - 471

BT - Analytical and Stochastic Modelling Techniques and Applications

PB - Springer

CY - Berlin, Heidelberg

T2 - 20th International Conference on Analytical and Stochastic Modelling Techniques and Applications, ASMTA 2013

Y2 - 8 July 2013 through 10 July 2013

ER -

Zuraniewski P, Mandjes M, van den Berg H, Malhotra R. Resource allocation in a multiple-priority buffered link. In Analytical and Stochastic Modelling Techniques and Applications: 20th International Conference, ASMTA 2013, Ghent, Belgium, July 8-10, 2013. Proceedings. Berlin, Heidelberg: Springer. 2013. p. 457-471. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-39408-9_32