Skip to main content Accessibility help
×
Home
Hostname: page-component-5cfd469876-mjnjv Total loading time: 0.224 Render date: 2021-06-24T18:51:02.928Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true }

Transient analysis for exponential time-limited polling models under the preemptive repeat random policy

Published online by Cambridge University Press:  29 April 2020

Roland De Haan
Affiliation:
CQM
Ahmad Al Hanbali
Affiliation:
King Fahd University of Petroleum and Minerals
Richard J. Boucherie
Affiliation:
University of Twente
Jan-Kees Van Ommeren
Affiliation:
University of Twente
Corresponding

Abstract

Polling systems are queueing systems consisting of multiple queues served by a single server. In this paper we analyze two types of preemptive time-limited polling systems, the so-called pure and exhaustive time-limited disciplines. In particular, we derive a direct relation for the evolution of the joint queue length during the course of a server visit. The analysis of the pure time-limited discipline builds on and extends several known results for the transient analysis of an M/G/1 queue. For the analysis of the exhaustive discipline we derive several new results for the transient analysis of the M/G/1 queue during a busy period. The final expressions for both types of polling systems that we obtain generalize previous results by incorporating customer routeing, generalized service times, batch arrivals, and Markovian polling of the server.

MSC classification

Type
Original Article
Copyright
© Applied Probability Trust 2020

Access options

Get access to the full version of this content by using one of the access options below.

References

Al Hanbali, A., de Haan, R., Boucherie, R. J. andvan Ommeren, J.-K. (2008). Time-limited and k-limited polling systems: a matrix analytic solution. In Proc. 3rd International Conference on Performance Evaluation Methodologies and Tools, art. 17. Association for Computing Machinery.Google Scholar
Al Hanbali, A., de Haan, R., Boucherie, R. J. andvan Ommeren, J.-K. (2012).Time-limited polling systems with batch arrivals and phase-type service times. Ann. Operat. Res. 198 (1), 5782.CrossRefGoogle Scholar
Boon, M. A., Van der Mei, R. andWinands, E. M. (2011). Applications of polling systems. Surv. Operat. Res. Manag. Sci. 16 (2), 6782.CrossRefGoogle Scholar
Borst, S. andBoxma, O. (2018). Polling: past, present, and perspective. TOP 26, 335369.CrossRefGoogle Scholar
Boxma, O. J. andWeststrate, J. A. (1989). Waiting times in polling systems with Markovian server routing. In Messung, Modellierung und Bewertung von Rechensystemen und Netzen Informatik-Fachberichte, eds G. Stiege and J. S. Lie, pp. 89104. Springer, Berlin and Heidelberg.CrossRefGoogle Scholar
Coffman, E. G., Fayolle, G. andMitrani, I. (1988). Two queues with alternating service periods. In Performance ’87: Proc. 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation, pp. 227239.Google Scholar
Cohen, J. W. (1982). The Single Server Queue, revised edn. North-Holland.Google Scholar
de Haan, R. (2009). Queueing models for mobile ad hoc networks. Doctoral thesis, University of Twente, Enschede. http://doc.utwente.nl/61385Google Scholar
de Haan, R., Boucherie, R. J. andvan Ommeren, J.-K. (2009). A polling model with an autonomous server. Queueing Systems 62 (3), 279308.CrossRefGoogle Scholar
de Souza e Silva, E., Gail, H. R. andMuntz, R. R. (1995). Polling systems with server timeouts and their application to token passing networks. IEEE/ACM Trans. Networking 3 (5), 560575.CrossRefGoogle Scholar
Eliazar, I. andYechiali, U. (1998). Polling under the randomly-timed gated regime. Stoch. Models 14 (1), 7993.CrossRefGoogle Scholar
Eliazar, I. andYechiali, U. (1998). Randomly timed gated queueing systems. SIAM J. Appl. Math. 59 (2), 423441.CrossRefGoogle Scholar
Fricker, C. andJaibi, M. (1994). Monotonicity and stability of periodic polling models. Queueing Systems 15 (1–4), 211238.CrossRefGoogle Scholar
Fuhrmann, S. W. (1992). A decomposition result for a class of polling models. Queueing Systems 11 (1–2), 109120.CrossRefGoogle Scholar
Kelly, F. P. (2011). Reversibility and Stochastic Networks. Cambridge University Press.Google Scholar
Leung, K. (1994). Cyclic-service systems with non-preemptive time-limited service. IEEE Trans. Commun. 42 (8), 25212524.CrossRefGoogle Scholar
Levy, H. andSidi, M. (1990). Polling systems: applications, modeling, and optimization. IEEE Trans. Commun. 38 (10), 17501760.CrossRefGoogle Scholar
Resing, J. (1993). Polling systems and multitype branching processes. Queueing Systems 13 (4), 409426.CrossRefGoogle Scholar
Takagi, H. (1997). Queueing analysis of polling models: progress in 1990–1994. In Frontiers In Queueing: Models and Applications in Science and Engineering (Probability and Stochastics Series), ed. J. H., Dshalalow, pp. 119146. CRC Press.Google Scholar
Takagi, H. (2000). Analysis and application of polling models. In Performance Evaluation: Origins and Directions (Lect. Notes Comput. Sci. 1769), pp. 423442. Springer, Berlin.CrossRefGoogle Scholar
Tse, D. andViswanath, P. (2005). Fundamentals of Wireless Communication. Cambridge University Press.CrossRefGoogle Scholar
Van Houdt, B. (2010). Numerical solution of polling systems for analyzing networks onchips. In Proc. NSMC 2010, Williamsburg, VA, pp. 9093.Google Scholar
Vishnevskii, V. M. andSemenova, O. V. (2006). Mathematical methods to study the polling systems. Automat. Remote Control 67 (2), 173220.CrossRefGoogle Scholar
Yechiali, U. (1993). Analysis and control of polling systems. In Performance Evaluation of Computer and Communication Systems (Lect. Notes Comput. Sci. 729), pp. 630650. Springer.CrossRefGoogle Scholar
2
Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Transient analysis for exponential time-limited polling models under the preemptive repeat random policy
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Transient analysis for exponential time-limited polling models under the preemptive repeat random policy
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Transient analysis for exponential time-limited polling models under the preemptive repeat random policy
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *