Heavy traffic analysis of roving server networks
From MaRDI portal
Abstract: This paper studies the heavy-traffic (HT) behaviour of queueing networks with a single roving server. External customers arrive at the queues according to independent renewal processes and after completing service, a customer either leaves the system or is routed to another queue. This type of customer routing in queueing networks arises very naturally in many application areas (in production systems, computer- and communication networks, maintenance, etc.). In these networks, the single most important characteristic of the system performance is oftentimes the path time, i.e. the total time spent in the system by an arbitrary customer traversing a specific path. The current paper presents the first HT asymptotic for the path-time distribution in queueing networks with a roving server under general renewal arrivals. In particular, we provide a strong conjecture for the system's behaviour under HT extending the conjecture of Coffman et al. [E.G. Coffman Jr., A.A. Puhalskii, M.I. Reiman 1995 and 1998] to the roving server setting of the current paper. By combining this result with novel light-traffic asymptotics we derive an approximation of the mean path-time for arbitrary values of the load and renewal arrivals. This approximation is not only highly accurate for a wide range of parameter settings, but is also exact in various limiting cases.
Recommendations
- A queueing network with a single cyclically roving server
- Polling systems with periodic server routeing in heavy traffic: distribution of the delay
- When Should a Roving Server Be Patient?
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- Strong approximations for the open queueing network in heavy traffic
Cites work
- A cyclic service tandem queueing model with parallel queues in the first stage
- A new method for deriving waiting-time approximations in polling systems with renewal arrivals
- A note on polling models with renewal arrivals and nonzero switch-over times
- A queueing network with a single cyclically roving server
- A single server tandem queue
- Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes
- Branching-type polling systems with large setups
- Dynamic scheduling of a two-class queue with setups
- File and Work Transfers in Cyclic Queue Systems
- Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem
- Heavy traffic analysis of polling systems in tandem
- Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem
- scientific article; zbMATH DE number 805121 (Why is no real title available?)
- On polling systems with large setups
- Polling systems and multitype branching processes
- Polling systems in heavy traffic: a Bessel process limit
- Polling systems with periodic server routing in heavy traffic: renewal arrivals
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- The multi-type Galton-Watson process with immigration
- Towards a unifying theory on branching-type polling systems in heavy traffic
- Two Queues in Tandem Attended by a Single Server
- Waiting times in queueing networks with a single shared server
Cited in
(3)
This page was built for publication: Heavy traffic analysis of roving server networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976515)
