Exploring a new Markov chain model for multiqueue systems.
Mapp, Glenford E. and Thakker, Dhawal and Gemikonakli, Orhan (2010) Exploring a new Markov chain model for multiqueue systems. In: Computer Modelling and Simulation (UKSim), 2010 12th International Conference. Al-Dabass, David and Orsoni, Alessandra and Cant, Richard and Abraham, Ajith, eds. IEEE Computer society, pp. 592-597. ISBN 9781424466146
- Published Version
Official URL: http://tinyurl.com/32gkksl
Traditionally, Markov models have been used to study multiserver systems using exhaustive or gated service. In addition, exhaustive-limited and gate-limited models have also been used in communication systems to reduce overall latency. Recently the authors have proposed a new Markov Chain approach to study gate-limited service. Multiqueue systems such as polling systems, in which the server serves various queues have also been extensively studied but as a separate branch of queueing theory. This paper proposes to describe multiqueue systems in terms of a new Markov Chain called the Zero-Server Markov Chain (ZSMC). The model is used to derive a formula for the waiting times in an exhaustive polling system. An intuitive result is obtained and this is used to develop an appoximate method which works well over normal operational ranges.
|Item Type:||Book Section|
UKSim2010: UKSim 12th International Conference on Computer Modelling and Simulation held in Cambridge, United Kingdom 24-26 March 2010.
|Research Areas:||A. Middlesex University Schools and Centres > School of Science and Technology > Computer and Communications Engineering|
A. Middlesex University Schools and Centres > School of Science and Technology > Computer Science > SensoLab group
|Deposited On:||15 Sep 2010 11:13|
|Last Modified:||19 Feb 2015 12:05|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year