Ghent University Academic Bibliography

Advanced

Partially shared buffers with full or mixed priority

Thomas Demoor UGent, Dieter Fiems UGent, Joris Walraevens UGent and Herwig Bruneel UGent (2011) JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION. 7(3). p.735-751
abstract
This paper studies a finite-sized discrete-time two-class priority queue. Packets of both classes arrive according to a two-class discrete batch Markovian arrival process (2-DBMAP), taking into account the correlated nature of arrivals in heterogeneous telecommunication networks. The model incorporates time and space priority to provide different types of service to each class. One of both classes receives absolute time priority in order to minimize its delay. Space priority is implemented by the partial buffer sharing acceptance policy and can be provided to the class receiving time priority or to the other class. This choice gives rise to two different queueing models and this paper analyses both these models in a unified manner. Furthermore, the buffer finiteness and the use of space priority raise some issues on the order of arrivals in a slot. This paper does not assume that all arrivals from one class enter the queue before those of the other class. Instead, a string representation for sequences of arriving packets and a probability measure on the set of such strings are introduced. This naturally gives rise to the notion of intra-slot space priority. Performance of these queueing systems is then determined using matrix-analytic techniques. The numerical examples explore the range of service differentiation covered by both models.
Please use this url to cite or link to this publication:
author
organization
year
type
journalArticle (original)
publication status
published
subject
keyword
matrix analytic method, PERFORMANCE ANALYSIS, partial buff er sharing, space priority, time priority, Queueing theory, TIME QUEUE, ARRIVALS, SYSTEM, BEHAVIOR
journal title
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
J. Ind. Manag. Optim.
volume
7
issue
3
pages
735 - 751
Web of Science type
Article
Web of Science id
000293626200013
JCR category
ENGINEERING, MULTIDISCIPLINARY
JCR impact factor
0.661 (2011)
JCR rank
47/90 (2011)
JCR quartile
3 (2011)
ISSN
1547-5816
DOI
10.3934/jimo.2011.7.735
language
English
UGent publication?
yes
classification
A1
copyright statement
I have transferred the copyright for this publication to the publisher
id
1993375
handle
http://hdl.handle.net/1854/LU-1993375
date created
2012-01-18 14:58:15
date last changed
2012-02-09 10:33:24
@article{1993375,
  abstract     = {This paper studies a finite-sized discrete-time two-class priority queue. Packets of both classes arrive according to a two-class discrete batch Markovian arrival process (2-DBMAP), taking into account the correlated nature of arrivals in heterogeneous telecommunication networks. The model incorporates time and space priority to provide different types of service to each class. One of both classes receives absolute time priority in order to minimize its delay. Space priority is implemented by the partial buffer sharing acceptance policy and can be provided to the class receiving time priority or to the other class. This choice gives rise to two different queueing models and this paper analyses both these models in a unified manner. Furthermore, the buffer finiteness and the use of space priority raise some issues on the order of arrivals in a slot. This paper does not assume that all arrivals from one class enter the queue before those of the other class. Instead, a string representation for sequences of arriving packets and a probability measure on the set of such strings are introduced. This naturally gives rise to the notion of intra-slot space priority. Performance of these queueing systems is then determined using matrix-analytic techniques. The numerical examples explore the range of service differentiation covered by both models.},
  author       = {Demoor, Thomas and Fiems, Dieter and Walraevens, Joris and Bruneel, Herwig},
  issn         = {1547-5816},
  journal      = {JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION},
  keyword      = {matrix analytic method,PERFORMANCE ANALYSIS,partial buff er sharing,space priority,time priority,Queueing theory,TIME QUEUE,ARRIVALS,SYSTEM,BEHAVIOR},
  language     = {eng},
  number       = {3},
  pages        = {735--751},
  title        = {Partially shared buffers with full or mixed priority},
  url          = {http://dx.doi.org/10.3934/jimo.2011.7.735},
  volume       = {7},
  year         = {2011},
}

Chicago
Demoor, Thomas, Dieter Fiems, Joris Walraevens, and Herwig Bruneel. 2011. “Partially Shared Buffers with Full or Mixed Priority.” Journal of Industrial and Management Optimization 7 (3): 735–751.
APA
Demoor, Thomas, Fiems, D., Walraevens, J., & Bruneel, H. (2011). Partially shared buffers with full or mixed priority. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 7(3), 735–751.
Vancouver
1.
Demoor T, Fiems D, Walraevens J, Bruneel H. Partially shared buffers with full or mixed priority. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION. 2011;7(3):735–51.
MLA
Demoor, Thomas, Dieter Fiems, Joris Walraevens, et al. “Partially Shared Buffers with Full or Mixed Priority.” JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 7.3 (2011): 735–751. Print.