Discrete-time multiserver queues with priorities

Laevens, Koenraad; Bruneel, Herwig

doi:10.1016/s0166-5316(98)00024-8

Cited by 59 publications

(45 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An overview of some basic strict priority queueing models can be found in Jaiswal (1968), Miller (1960), Takacs (1964) and Takagi (1991) and the references therein. Khamisy (1992), Laevens (1998), Takine (1994b) and Walraevens (2003) have studied discrete-time HOL priority queues with deterministic service times equal to one slot. Khamisy (1992) analyzes the system contents for the different classes, for a queue fed by a two-state Markov modulated arrival process.…”

mentioning

confidence: 99%

“…Khamisy (1992) analyzes the system contents for the different classes, for a queue fed by a two-state Markov modulated arrival process. Laevens (1998) analyzes the system contents and cell delay in the case of a multiserver queue. In Takine (1994b), the system contents and the delay for Markov modulated high-priority arrivals and geometrically distributed low-priority arrivals are presented.…”

mentioning

confidence: 99%

See 1 more Smart Citation

A Packet Switch with a Priority Scheduling Discipline: Performance Analysis

Walraevens

Steyaert

Bruneel

2005

Telecommunication Systems

View full text Add to dashboard Cite

mentioning

confidence: 99%

mentioning

confidence: 99%

A Packet Switch with a Priority Scheduling Discipline: Performance Analysis

Walraevens

Steyaert

Bruneel

2005

Telecommunication Systems

View full text Add to dashboard Cite

“…We mention, among others, priority scheduling (see, e.g., [4,8,11,13,15]), weighted fair queueing (WFQ) (see, e.g., [14,17]), random order of service (ROS) (see, e.g., [1,3,10]), and generalized processor sharing (GPS) (see, e.g., [9,12,16]). Strangely enough, only few results have been derived for multi-class First-Come-First-Served (FCFS) systems, i.e., queueing systems in which the customers of different classes are accommodated in one queue and served in their order of arrival, irrespective of the classes they belong to (a recent paper is [5]).…”

Section: Introductionmentioning

confidence: 99%

Analysis of a Two-Class FCFS Queueing System with Interclass Correlation

Bruneel

Maertens

Steyaert

et al. 2012

Analytical and Stochastic Modeling Techniques and Applications

View full text Add to dashboard Cite

Abstract. This paper considers a discrete-time queueing system with one server and two classes of customers. All arriving customers are accommodated in one queue, and are served in a First-Come-First-Served order, regardless of their classes. The total numbers of arrivals during consecutive time slots are i.i.d. random variables with arbitrary distribution. The classes of consecutively arriving customers, however, are correlated in a Markovian way, i.e., the probability that a customer belongs to a class depends on the class of the previously arrived customer. Service-time distributions are assumed to be general but class-dependent. We use probability generating functions to study the system analytically. The major aim of the paper is to estimate the impact of the interclass correlation in the arrival stream on the queueing performance of the system, in terms of the (average) number of customers in the system and the (average) customer delay and customer waiting time.

show abstract

“…An overview of some basic HOL priority queueing models in continuous time can be found in Miller (1960), Kleinrock (1976) and Takagi (1991) and the references therein. Khamisy and Sidi (1992), Takine et al (1994b), Laevens and Bruneel (1998) and Walraevens et al (2003) have studied discrete-time HOL priority queues with deterministic service times equal to one slot. Khamisy and Sidi (1992) analyze the system contents of the different classes, for a queue fed by a two-state Markov modulated arrival process.…”

Section: Introductionmentioning

confidence: 99%

“…In Takine et al (1994b), the system content and the delay for Markov modulated high-priority arrivals and geometrically distributed low-priority arrivals are presented. Laevens and Bruneel (1998) analyze the system content and cell delay in the case of a multi-server queue. Walraevens et al (2003) study the system content and packet delay, in the special case of an output queueing switch with Bernoulli arrivals.…”

Section: Introductionmentioning

confidence: 99%

Delay Analysis of a HOL Priority Queue

et al. 2005

View full text Add to dashboard Cite

Priority scheduling for packets is a hot topic, as interactive (voice,video) services are being integrated in existing data networks. In this paper, we consider a discrete-time queueing system with a non-preemptive (or Head-Of-the-Line) priority scheduling discipline and a general number of priority classes. Packets of variable length arrive in the queueing system. We derive expressions for the probability generating functions of the packet delays. From these functions, some performance measures (such as moments and approximate probabilities) are calculated. We illustrate the performance measures by means of some numerical examples and show how to apply the theoretical results to a queue that handles arriving multimedia traffic.

show abstract

Discrete-time multiserver queues with priorities

Cited by 59 publications

References 12 publications

A Packet Switch with a Priority Scheduling Discipline: Performance Analysis

A Packet Switch with a Priority Scheduling Discipline: Performance Analysis

Analysis of a Two-Class FCFS Queueing System with Interclass Correlation

Delay Analysis of a HOL Priority Queue

Contact Info

Product

Resources

About