An asymptotic property of branching-type overloaded polling networks
DOI10.1515/MATH-2019-0116OpenAlexW2994917886MaRDI QIDQ2111719FDOQ2111719
Authors: Yuejiao Wang, Yuqing Chu, Zaiming Liu, Yingqiu 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)
Cites Work
- Title not available (Why is that?)
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- Polling systems in heavy traffic: a Bessel process limit
- Polling systems and multitype branching processes
- An overloaded multiclass FIFO queue with abandonments
- Heavy-traffic asymptotics of a priority polling system with threshold service policy
- The asymptotic behavior of a branching-type polling network in heavy traffic
- A queueing network with a single cyclically roving server
- Towards a unifying theory on branching-type polling systems in heavy traffic
- Waiting times in queueing networks with a single shared server
- The Fluid Limit of an Overloaded Processor Sharing Queue
- Polling systems with switch-over times under heavy load: Moments of the delay
- Heavy traffic analysis of roving server networks
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- Random Fluid Limit of an Overloaded Polling Model
Cited In (2)
This page was built for publication: An asymptotic property of branching-type overloaded polling networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111719)
