Volume no :1, Issue no: 1, March (2009)

WAITING TIMES OF THE MULTIPLE PRIORITY DUAL QUEUE WITH FINITE BUFFER AND NON-PREEMPTIVE PRIORITY SCHEDULING

Author's: P. Zeephongsekul and A. Bedford
Pages: [89] - [116]
Received Date: April 3, 2009
Submitted by:

Abstract

This paper considers a novel queueing model called the Multi-Priority Dual Queue (MPDQ), which was introduced and analyzed in Bedford and Zeephongsekul [1, 2]. The MPDQ consists of two queues with a finite buffer, the primary and the secondary queue with the additional feature of a priority scheme to assist with congestion control and meeting Quality of Service (QoS) objectives for differentiated classes of customers. In this paper, it is assumed that the service discipline is non-preemptive whereas the model in the cited paper assumes a preemptive service discipline. Using some key ideas in Zeephongsekul and Bedford [13], we give a detailed analysis of the waiting time for each class of customers with numerical examples to illustrate the results.

Keywords

multi-priority dual queue, non-preemptive priority, stationary distribution and waiting time analysis.