Performance of a polling system with finite queues using Markov chain

Author(s):  
Adnan Sohail ◽  
Ansar Yasin
2008 ◽  
Vol 40 (04) ◽  
pp. 1157-1173
Author(s):  
Winfried K. Grassmann ◽  
Javad Tavakoli

This paper deals with censoring of infinite-state banded Markov chains. Censoring involves reducing the time spent in states outside a certain set of states to 0 without affecting the number of visits within this set. We show that, if all states are transient, there is, besides the standard censored Markov chain, a nonstandard censored Markov chain which is stochastic. Both the stochastic and the substochastic solutions are found by censoring a sequence of finite transition matrices. If all matrices in the sequence are stochastic, the stochastic solution arises in the limit, whereas the substochastic solution arises if the matrices in the sequence are substochastic. We also show that, if the Markov chain is recurrent, the only solution is the stochastic solution. Censoring is particularly fruitful when applied to quasi-birth-and-death (QBD) processes. It turns out that key matrices in such processes are not unique, a fact that has been observed by several authors. We note that the stochastic solution is important for the analysis of finite queues.


2008 ◽  
Vol 40 (4) ◽  
pp. 1157-1173 ◽  
Author(s):  
Winfried K. Grassmann ◽  
Javad Tavakoli

This paper deals with censoring of infinite-state banded Markov chains. Censoring involves reducing the time spent in states outside a certain set of states to 0 without affecting the number of visits within this set. We show that, if all states are transient, there is, besides the standard censored Markov chain, a nonstandard censored Markov chain which is stochastic. Both the stochastic and the substochastic solutions are found by censoring a sequence of finite transition matrices. If all matrices in the sequence are stochastic, the stochastic solution arises in the limit, whereas the substochastic solution arises if the matrices in the sequence are substochastic. We also show that, if the Markov chain is recurrent, the only solution is the stochastic solution. Censoring is particularly fruitful when applied to quasi-birth-and-death (QBD) processes. It turns out that key matrices in such processes are not unique, a fact that has been observed by several authors. We note that the stochastic solution is important for the analysis of finite queues.


1991 ◽  
Vol 5 (1) ◽  
pp. 43-52 ◽  
Author(s):  
Masakiyo Miyazawa ◽  
J. George Shanthikumar

The loss probabilities of customers in the Mx/GI/1/k, GI/Mx/l/k and their related queues such as server vacation models are compared with respect to the convex order of several characteristics, for example, batch size, of the arrival or service process. In the proof, we give a characterization of a truncation expression for a stationary distribution of a finite Markov chain, which is interesting in itself.


2007 ◽  
Vol 17 (5-6) ◽  
pp. 1447-1473 ◽  
Author(s):  
Iain MacPhee ◽  
Mikhail Menshikov ◽  
Dimitri Petritis ◽  
Serguei Popov

2013 ◽  
Vol 756-759 ◽  
pp. 2300-2305
Author(s):  
Jin Lu ◽  
Hong Wei Ding ◽  
Yi Fan Zhao ◽  
Min He

proposed a Limit-1 polling system model with simplified service process (SL-1), which was analyzed by the theory of imbedded Markov chain and the method of multidimensional probability generating function. The related characteristic of system was obtained based on the analysis of polling mechanism. The contrast of numerical curve and simulation experiment between SL-1 service and Limit-1 service showed that the SL-1 service polling model performed better in queuing performance and stability.


2019 ◽  
Vol 62 (3) ◽  
pp. 577-586 ◽  
Author(s):  
Garnett P. McMillan ◽  
John B. Cannon

Purpose This article presents a basic exploration of Bayesian inference to inform researchers unfamiliar to this type of analysis of the many advantages this readily available approach provides. Method First, we demonstrate the development of Bayes' theorem, the cornerstone of Bayesian statistics, into an iterative process of updating priors. Working with a few assumptions, including normalcy and conjugacy of prior distribution, we express how one would calculate the posterior distribution using the prior distribution and the likelihood of the parameter. Next, we move to an example in auditory research by considering the effect of sound therapy for reducing the perceived loudness of tinnitus. In this case, as well as most real-world settings, we turn to Markov chain simulations because the assumptions allowing for easy calculations no longer hold. Using Markov chain Monte Carlo methods, we can illustrate several analysis solutions given by a straightforward Bayesian approach. Conclusion Bayesian methods are widely applicable and can help scientists overcome analysis problems, including how to include existing information, run interim analysis, achieve consensus through measurement, and, most importantly, interpret results correctly. Supplemental Material https://doi.org/10.23641/asha.7822592


2012 ◽  
Vol 44 (12) ◽  
pp. 43-54 ◽  
Author(s):  
Agasi Zarbali ogly Melikov ◽  
Leonid A. Ponomarenko ◽  
Che Soong Kim

Sign in / Sign up

Export Citation Format

Share Document