An asymptotic property of branching-type overloaded polling networks
From MaRDI portal
Publication:2111719
DOI10.1515/MATH-2019-0116OpenAlexW2994917886MaRDI QIDQ2111719
Yuqing Chu, Yuejiao Wang, Zai-Ming Liu, Ying-qiu Li
Publication date: 17 January 2023
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2019-0116
multi-type branching processexhaustivenessgeneral branching-type service policiesoverloadedpolling networks
Queues and service in operations research (90B22) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (1)
Cites Work
- Unnamed Item
- Heavy-traffic asymptotics of a priority polling system with threshold service policy
- Waiting times in queueing networks with a single shared server
- A queueing network with a single cyclically roving server
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- Polling systems and multitype branching processes
- Towards a unifying theory on branching-type polling systems in heavy traffic
- Polling Systems in Heavy Traffic: A Bessel Process Limit
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- An Overloaded Multiclass FIFO Queue with Abandonments
- Heavy traffic analysis of roving server networks
- The asymptotic behavior of a branching-type polling network in heavy traffic
- The Fluid Limit of an Overloaded Processor Sharing Queue
- Random Fluid Limit of an Overloaded Polling Model
- Polling systems with switch-over times under heavy load: Moments of the delay
This page was built for publication: An asymptotic property of branching-type overloaded polling networks