Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Tassiulas, A. Ephremides (1993)
Dynamic server allocation to parallel queues with randomly varying connectivityIEEE Trans. Inf. Theory, 39
B. Bunday (1991)
Analysis of the SCAN Service Polling ModelActa Cybern., 10
L. Kleinrock, H. Levy (1988)
The Analysis of Random Polling SystemsOper. Res., 36
H. Takagi (1991)
Analysis of finite-capacity polling systemsAdvances in Applied Probability, 23
T. Lee, Januar Sunjaya (1996)
Exact analysis of asymmetric random polling systems with single buffers and correlated input processQueueing Systems, 23
G. Fayolle, Jean-Marc Lasgouttes (2012)
A State-Dependent Polling Model with Markovian Routing, 71
E. Denardo, T. Lee (1996)
Managing Uncertainty in a Serial Production LineOper. Res., 44
T. Lee (1997)
A Closed Form Solution for the Asymmetric Random Polling System with Correlated Levy Input ProcessMath. Oper. Res., 22
R. Serfozo (1972)
Processes with conditional stationary independent incrementsJournal of Applied Probability, 9
M. Srinivasan (1988)
Non-deterministic polling systems
Y. Shiozawa, T. Takine, Yutaka Takahashi, T. Hasegawa (1990)
Analysis of a Polling System with Correlated InputComput. Networks ISDN Syst., 20
Y. Chandramouli, M. Neuts, V. Ramaswami (1989)
A queuing model for meteor burst packet communication systemsIEEE Trans. Commun., 37
T. Takine, Yutaka Takahashi, T. Hasegawa (1988)
Exact analysis of asymmetric polling systems with single buffersIEEE Trans. Commun., 36
R. Serfozo (1972)
Conditional Poisson processesJournal of Applied Probability, 9
M. Eisenberg (1972)
Queues with Periodic Service and Changeover TimeOper. Res., 20
D. Kofman (1993)
Blocking probability, throughput and waiting time in finite capacity polling systemsQueueing Systems, 14
H. Takagi (1986)
Analysis of polling systems
O. Boxma, J. Weststrate (1989)
Waiting Times in Polling Systems with Markovian Server Routing
Hae Chung, C. Un, W. Jung (1994)
Performance Analysis of Markovian Polling Systems with Single BuffersPerform. Evaluation, 19
Models and analytical techniques are developed to evaluate the performance of wireless or mobile communication networks that can be represented by a single buffer multiple queues system. Specifically, we developed a non-linear model of uncertainty for analysing a polling system with periodic nondeterministic server allocation policy, Bernoulli feedback of customers, server timeouts, randomly time varying connectivity, correlated input processes, and single buffers. Our model encompasses a variety of examples. The periodic nondeterministic server allocation is a new class of server allocation to queues policy. Some well-known special cases of this policy are cyclic, periodic and random polling. We were able to perform both transient and steady state analysis. The steady state analysis allows us to compute several performance measures including the expected response time, loss probability, throughput and mean cycle time. Performance measures obtained from our analysis provide us with some guidelines for regulating flows through the system.
International Journal of Information and Decision Sciences – Inderscience Publishers
Published: Jan 1, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.