Title

The impact of priority generations in a multi-priority queueing system – A simulation approach

Document Type

Conference Proceeding

Publication Date

12-13-2009

Publication Title

Simulation Conference (WSC), Proceedings of the 2009 Winter

Conference Name

Winter Simulation Conference

Abstract

In this paper, we consider a preemptive (multiple) priority queueing model in which arrivals occur according to a Markovian arrival process (MAP). An arriving customer belongs to priority type i, 1 ≤ i ≤ m+1, with probability pi. The highest priority, labeled as 0, is generated by other priority customers while waiting in the system and not otherwise. Also, a customer of priority i can turn into a priority j, j ≠ i, 1 ≤ i, j ≤ m + 1, customer, after a random amount of time that is assumed to be exponentially distributed with parameter depending on the priority type. The waiting spaces for all but priority type m+1 are assumed to be finite. The (m+1)-st priority customers have unlimited waiting space. At any given time, the system can have at most one highest priority customer. Thus, all priority customers except the (m +1) — st are subject to loss. Customers are served on a first-come-first-served basis within their priority by a single server and the service times are assumed to follow a phase type distribution that may depend on the customer priority type. This queueing model, which is a level-dependent quasi-birth-and-death process, is amenable for investigation algorithmically through the well-known matrix-analytic methodology. However, here we propose to study through simulation using ARENA, a powerful simulation software as some key measures such as the waiting time distributions are highly complex to characterize analytically. The simulated results for a few scenarios are presented.

Comments

DOI: 10.1109/WSC.2009.5429269 Conference Location: Austin, TX, USA, USA ISBN Information: Electronic ISBN: 978-1-4244-5771-7 Print ISBN: 978-1-4244-5770-0 CD-ROM ISBN: 978-1-4244-5772-4 Proceedings of the 2009 Winter

Rights Statement

© 2009 IEEE

Share

COinS