Single and dual queueing schemes with prioritised traffic scheduling and finite waiting room

Bedford, A 2003, Single and dual queueing schemes with prioritised traffic scheduling and finite waiting room, Doctor of Philosophy (PhD), Department of Mathematics and Statistics, RMIT University.

Document type: Thesis
Collection: Theses

Attached Files
Name Description MIMEType Size
Bedford.pdf Thesis application/pdf 10.49MB
Title Single and dual queueing schemes with prioritised traffic scheduling and finite waiting room
Author(s) Bedford, A
Year 2003
Abstract Analysis of new schemes aimed at improving congestion in communications systems is vital for todays service providers. Many techniques are used to evaluate such schemes be it precisely via mathematics or approximately using simulation.

This thesis introduces a new scheme, the multi priority dual queue (MPDQ). The MPDQ is the combination of two concepts, the dual queue introduced by [Hayes et. al., 1999] and prioritised traffic. The MPDQ is a system with finite waiting room with two queues where traffic upon arrival if finding the first queue full wait in the second queue if there is room. When a space becomes vacant in the first queue, a customer at the front of the second queue enters the back of the first, which is the queue that has the service centre at the front of it. The traffic can be of two or more classes. The analysis of such a system is complex, both analytically using queueing theory and approximately using simulation analysis. Both approaches are taken in this thesis. To begin, the new algorithmic approach used for the MPDQ is applied for the single buffer model. The steady state and waiting time distributions are obtained and later compared to the MPDQ.

Next the performance characteristics are obtained by solving the steady state and waiting time distributions of a two class MPDQ. Preemptive and non-preemptive service disciplines are investigated. Maple is also used to solve the algorithm.

To broaden the application of the MPDQ scheme, computer simulations using Arena are undertaken to extend the application of the scheme (and existing finite queueing models) to situations with more than two priorities, something that is extremely difficult to solve analytically. Using simulation, comparisons are undertaken for the single and dual queue schemes for more than two priorities with a variety of queueing disciplines used including First In First Out (FIFO), Last In First Out (LIFO), High Class First (HCF), and Low Class First (LCF). Network scenarios are also modelled to determine the performance of the MPDQ in this environment.
Degree Doctor of Philosophy (PhD)
Institution RMIT University
School, Department or Centre Department of Mathematics and Statistics
Keyword(s) Systems theory
Queuing theory
Integrated services digital networks
Packet switching (Data transmission)
Version Filter Type
Access Statistics: 204 Abstract Views, 234 File Downloads  -  Detailed Statistics
Created: Thu, 17 Feb 2011, 10:59:39 EST
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us