Continuous polling models and application to ferry assisted WLAN

Kavitha, Veeraruna; Altman, Eitan

doi:10.1007/s10479-011-0960-x

Cited by 9 publications

(24 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Leskela and Unger [110] and Kavitha and Altman [111] consider models where arriving customers are placed on a circle. Leskela and Unger [110] assume that the server serves customers located in the vicinity of the server's current position, and the server selects the closest customer to serve.…”

Section: Non-discrete Polling Systems and Polling Networkmentioning

confidence: 99%

“…Leskela and Unger [110] assume that the server serves customers located in the vicinity of the server's current position, and the server selects the closest customer to serve. The classical stability condition where the service rate must exceed the arrival rate is proved by Kavitha and Altman [111]. For the system considered, the server moves along a circle at a constant speed and some customers are served according to the globally gated discipline, and the others are served according to the exhaustive rule.…”

Section: Non-discrete Polling Systems and Polling Networkmentioning

confidence: 99%

See 1 more Smart Citation

Polling Systems and Their Application to Telecommunication Networks

Vishnevsky

2021

Mathematics

View full text Add to dashboard Cite

The paper presents a review of papers on stochastic polling systems published in 2007–2020. Due to the applicability of stochastic polling models, the researchers face new and more complicated polling models. Stochastic polling models are effectively used for performance evaluation, design and optimization of telecommunication systems and networks, transport systems and road management systems, traffic, production systems and inventory management systems. In the review, we separately discuss the results for two-queue systems as a special case of polling systems. Then we discuss new and already known methods for polling system analysis including the mean value analysis and its application to systems with heavy load to approximate the performance characteristics. We also present the results concerning the specifics in polling models: a polling order, service disciplines, methods to queue or to group arriving customers, and a feedback in polling systems. The new direction in the polling system models is an investigation of how the customer service order within a queue affects the performance characteristics. The results on polling systems with correlated arrivals (MAP, BMAP, and the group Poisson arrivals simultaneously to all queues) are also considered. We briefly discuss the results on multi-server, non-discrete polling systems and application of polling models in various fields.

show abstract

Section: Non-discrete Polling Systems and Polling Networkmentioning

confidence: 99%

Section: Non-discrete Polling Systems and Polling Networkmentioning

confidence: 99%

Polling Systems and Their Application to Telecommunication Networks

Vishnevsky

2021

Mathematics

View full text Add to dashboard Cite

show abstract

“…Motivated by applications in ferry-assisted wireless local-area networks, Kavitha and Altman have studied several continuous polling variants, see, for instance, Kavitha and Altman (2012), in which nonclassical service disciplines are considered, and in which the continuous polling system is analyzed by discretizing the system in such a way that known pseudo-conservation laws (cf. Sect.…”

Section: Many-queue Asymptoticsmentioning

confidence: 99%

Polling: past, present, and perspective

Borst

Boxma

2018

TOP

View full text Add to dashboard Cite

This is a survey on polling systems, focussing on the basic single-server multi-queue polling system in which the server visits the queues in cyclic order. The main goals of the paper are: (i) to discuss a number of the key methodologies in analyzing polling models; (ii) to give an overview of recent polling developments; and (iii) to present a number of challenging open problems. Assumption 7The service order within each queue is First-Come First-Served (FCFS). This assumption was almost universally made in the polling literature until the work of Wierman et al. (2007). In Sect. 7, we will discuss non-FCFS service orders.Assumption 8 The times to switch from Q i , i = 1, 2, . . . , n, to the next queue are assumed to be i.i.d. random variables, generically denoted by S i , with distribution S i (·) and LST σ i (·). All switchover times are assumed to be independent of each other and of the interarrival and service times. When the switchover times between successive queues are all zero, a special situation arises. If the system has become empty after a visit to, say, Q i in the case of zero switchover times, then the server is assumed to visit queues Q i+1 , . . . , Q n (which now takes zero time) and stay in front of Q 1 (see Sect. 4). In the case of non-zero switchover times, the server is assumed to keep switching in an empty system. Assumption 9As soon as a customer has been served, it leaves the system. At some places, we briefly mention the case of customer routing; a served customer might rejoin the same queue, or join another one.

show abstract

“…As a polling system, the continuous-time system considered in this Figure 1: Parallelly-arranged loop optical buffer paper strongly resembles yet differs from polling on a circle, as studied in [8,10,9,18,7]. In such a system, customers arrive at a circle according to a Poisson process, with position on the circle determined as an independent and identically distributed (i.i.d.)…”

Section: Introductionmentioning

confidence: 99%

Analysis of fibre-loop optical buffers with a void-avoiding schedule

Rogiest¹,

Dorsman²,

Fiems³

2015

Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

In optical packet/burst switching, fibre-loop optical buffers provide a compact and effective means of contention resolution. In case of fixed packet length, the involved loop length is typically chosen matched (equal to the packet length), and the loops are arranged in parallel, constituting a single-stage buffer. In this contribution, we investigate the performance of such a buffer in an asynchronous network setting, assuming batch-Poisson arrivals and assuming a so-called void-avoiding schedule. We show that by timediscretisation, the fibre-loop dynamics can be captured by a particular type of exhaustive polling model. We obtain performance measures such as the moments of the optical queue content and packet delay for the discretised model as well as for the asynchronous optical buffer. We illustrate our approach by various numerical examples.

show abstract

Continuous polling models and application to ferry assisted WLAN

Cited by 9 publications

References 32 publications

Polling Systems and Their Application to Telecommunication Networks

Polling Systems and Their Application to Telecommunication Networks

Polling: past, present, and perspective

Analysis of fibre-loop optical buffers with a void-avoiding schedule

Contact Info

Product

Resources

About