Title
Resource allocation in a multiple-priority buffered link
Author
Zuraniewski, P.W.
Mandjes, M.
van den Berg, J.L.
Malhotra, R.
Publication year
2013
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. © 2013 Springer-Verlag.
Subject
Communication & Information
PNS - Performance of Networks & Services
TS - Technical Sciences
Infrastructures
Informatics
Information Society
Carrier Ethernet
Resource Allocation
Delay-sensitive applications
Effective bandwidth
In-depth study
Large deviations
Priority queues
Small buffers
Bandwidth
To reference this document use:
http://resolver.tudelft.nl/uuid:8eb1c1fd-c924-434b-91b7-7c629e562656
DOI
https://doi.org/10.1007/978-3-642-39408-9_32
TNO identifier
481443
Publisher
Springer, Berlin
Source
Analytical and Stochastic Modeling Techniques and Applications : Proceedings 20th International Conference, ASMTA 2013, July 8-10, 2013, Ghent, Belgium,, 457-471
Series
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Document type
bookPart