Strong approximations for the open queueing network in heavy traffic
The authors obtain strong approximations for an open queueing network in heavy traffic. The network consists of \(k\) single server nodes each with infinite capacity, in which at least one node has arrival stream from outside the network. At every node the FIFO service discipline is adopted and after service the customers are either randomly routed to another node or leave the network. The interarrival times and service times are assumed to form mutually independent sequences of i.i.d. random variables. Strong approximations are derived for the queue length, the virtual waiting time, the sojourn time and for the queue length process associated with the embedded arrival epochs.
- On the analysis of the virtual waiting time in open queueing networks
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- A law of the iterated logarithm for the sojourn time process in queues in series
- Strong approximations for multiple channel queues in heavy traffic
- A heavy traffic analysis for semi-open networks
- Strong Approximations of Open Queueing Networks
- scientific article; zbMATH DE number 1301681 (Why is no real title available?)
- scientific article; zbMATH DE number 1336730 (Why is no real title available?)
- Strong Approximations of Irreducible Closed Queueing Networks
- scientific article; zbMATH DE number 1159047 (Why is no real title available?)
- Heavy traffic analysis of roving server networks
- On global values of virtual waiting time of a customer in open queueing networks
- Strong approximations for a Kumar-Seidman network under a priority service discipline
- On extreme values in open queueing networks
This page was built for publication: Strong approximations for the open queueing network in heavy traffic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201616)
