Analysis of tandem polling queues with finite buffers

Suman, Ravi; Krishnamurthy, Ananth

doi:10.1007/s10479-019-03358-0

Cited by 10 publications

(5 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the past, various survey papers dedicated to voting systems have appeared in the open literature. Detailed and comprehensive descriptions of the mathematical analysis of voting systems are given in [25][26][27][28]. While these papers have many mathematical models to derive parameter metrics for polling systems, they all have limitations.…”

Section: Literature Reviewmentioning

confidence: 99%

Application of Polling Scheduling in Mobile Edge Computing

Xiong

Yang

Ding

2023

Axioms

View full text Add to dashboard Cite

With the Internet of Things (IoT) development, there is an increasing demand for multi-service scheduling for Mobile Edge Computing (MEC). We propose using polling for scheduling in edge computing to accommodate multi-service scheduling methods better. Given the complexity of asymmetric polling systems, we have used an information-theoretic approach to analyse the model. Firstly, we propose an asymmetric two-level scheduling approach with priority based on a polling scheduling approach. Secondly, the mathematical model of the system in the continuous time state is established by using the embedded Markov chain theory and the probability-generating function. By solving for the probability-generating function’s first-order partial and second-order partial derivatives, we calculate the exact expressions of the average queue length, the average polling period, and the average delay with an approximate analysis of periodic query way. Finally, we design a simulation experiment to verify that our derived parameters are correct. Our proposed model can better differentiate priorities in MEC scheduling and meet the needs of IoT multi-service scheduling.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Application of Polling Scheduling in Mobile Edge Computing

Xiong

Yang

Ding

2023

Axioms

View full text Add to dashboard Cite

show abstract

“…Polling scheduling is widely used in communication networks by serving each queue in turn [18,19]. However, when a certain queue has high traffic, the system performance will be reduced because other queues are not served for a long time.…”

Section: Related Workmentioning

confidence: 99%

Modeling and Performance Analysis of Channel Assembling Based on Ps-rc Strategy with Priority Queues in CRNs

Gaber

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Based on two types of priority queues, this paper proposes a polling scheduling strategy with reserved channel (Ps-rc strategy) for predefined priority services in cognitive radio networks (CRNs). Channel assembling (CA) technology and spectrum adaptation (SA) technology are adopted to dynamically adjust the assembled channels of secondary users (SUs) to improve the performance of the secondary network. Specifically, the SUs in CRNs are divided into two queues with different priorities; based on polling scheduling, a part of the idle channel is reserved for high-priority queue during the polling stage of the low-priority queue. The purpose is to increase the service quality (QoS) of high priority on the basis of providing fair scheduling. Furthermore, the CA-based channel access process of the proposed strategy is presented and modeled by continuous time Markov chain (CTMC). Then, the process of resource flow between users is mapped on CTMC, and the transition conditions and parameter sets of channel assembling covering all user activities of the system are derived. Finally, the system performance of the proposed CA-based Ps-rc scheduling strategy is simulated and evaluated, including network capacity, spectrum utilization, blocking probability, and forced termination probability. Numerical results show that the proposed strategy can improve the QoS of the predefined high-priority service without causing excessive starvation problem of low-priority service.

show abstract

“…A tandem of two polling systems each consisting of two M/M/1-type queues with cyclic polling and exhaustive service is studied by Suman and Krishnamurthy [99]. After completing the service in the first system, a customer moves to the corresponding queue of the second tandem system.…”

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

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

Analysis of tandem polling queues with finite buffers

Cited by 10 publications

References 30 publications

Application of Polling Scheduling in Mobile Edge Computing

Application of Polling Scheduling in Mobile Edge Computing

Modeling and Performance Analysis of Channel Assembling Based on Ps-rc Strategy with Priority Queues in CRNs

Polling Systems and Their Application to Telecommunication Networks

Contact Info

Product

Resources

About