Analysis and Application of Polling Models

Takagi, Hideaki

doi:10.1007/3-540-46506-5_18

Cited by 89 publications

(63 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moving from one queue to another, the server incurs a (possibly zero) switchover time. Triggered by a wide variety of applications, polling models have been extensively studied in the literature; see [38], [40], [41] for a series of comprehensive surveys and [11], [29], [39] for extensive overviews of the applicability of polling systems. In the polling literature much attention has been given to the determination of the probability generating function (PGF) of the joint queue length distribution under stationarity and at various epochs.…”

Section: Introductionmentioning

confidence: 99%

The shorter queue polling model

et al. 2013

View full text Add to dashboard Cite

We consider a two-queue polling model in which customers upon arrival join the shorter of two queues. Customers arrive according to a Poisson process and the service times in both queues are independent and identically distributed random variables having the exponential distribution. The two-dimensional process of the numbers of customers at the queue where the server is and at the other queue is a two-dimensional Markov process. We derive its equilibrium distribution using two methodologies: the compensation approach and a reduction to a boundary value problem.

show abstract

Section: Introductionmentioning

confidence: 99%

The shorter queue polling model

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Polling systems have been extensively studied in the last years due to their vast area of applications in production and telecommunication systems [15,18]. They have demonstrated to offer an adequate modeling framework to analyze systems in which a set of entities need certain service from a single resource.…”

Section: Introductionmentioning

confidence: 99%

Time-limited polling systems with batch arrivals and phase-type service times

et al. 2011

View full text Add to dashboard Cite

Abstract. In this paper, we will develop a general framework to analyze polling systems with either the autonomous-server or the time-limited service discipline. We consider Poisson batch arrivals and phase-type service times. It is known that these disciplines do not satisfy the well-known branching property in polling system. Therefore, hardly any exact results exist in the literature. Our strategy is to apply an iterative scheme that is based on relating in closed-form the joint queue-length at the beginning and the end of a server visit to a queue. These kernel relations are derived using the theory of absorbing Markov chains.

show abstract

“…Choi (Choi, 2004) proposes a cyclic polling based algorithm for differentiated class of services in Ethernet passive optical networks. Takagi highlights three classical but instructive applications of polling models to the performance evaluation of communication networks in (Takagi, 2000). The three applications discussed are the half-duplex transmission for an inquiry system, the polling data link control and the token ring network.…”

Section: Applications Of Cyclic Service Queueing Systemsmentioning

confidence: 99%

Effect of Switchover Time in Cyclically Switched Systems

Aziz¹

2009

Switched Systems

View full text Add to dashboard Cite

Analysis and Application of Polling Models

Cited by 89 publications

References 11 publications

The shorter queue polling model

The shorter queue polling model

Time-limited polling systems with batch arrivals and phase-type service times

Effect of Switchover Time in Cyclically Switched Systems

Contact Info

Product

Resources

About