An asymptotic property of branching-type overloaded polling networks
From MaRDI portal
Publication:2111719
Cites work
- scientific article; zbMATH DE number 3410334 (Why is no real title available?)
- A queueing network with a single cyclically roving server
- An overloaded multiclass FIFO queue with abandonments
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- Heavy traffic analysis of roving server networks
- Heavy-traffic asymptotics of a priority polling system with threshold service policy
- Polling systems and multitype branching processes
- Polling systems in heavy traffic: a Bessel process limit
- Polling systems with switch-over times under heavy load: Moments of the delay
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- Random fluid limit of an overloaded polling model
- The Fluid Limit of an Overloaded Processor Sharing Queue
- The asymptotic behavior of a branching-type polling network in heavy traffic
- Towards a unifying theory on branching-type polling systems in heavy traffic
- Waiting times in queueing networks with a single shared server
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)