Strong approximations for the open queueing network in heavy traffic
zbMATH Open0765.60094MaRDI QIDQ1201616FDOQ1201616
Authors: Hanqin Zhang, Guang-Hui Hsu
Publication date: 17 January 1993
Published in: Science in China. Series A (Search for Journal in Brave)
Recommendations
Wiener processessojourn timevirtual waiting timestrong approximations for an open queueing network in heavy traffic
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cited In (11)
- 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
- On extreme values in open queueing networks
- Title not available (Why is that?)
- On the analysis of the virtual waiting time in open queueing networks
- Strong approximations for a Kumar-Seidman network under a priority service discipline
- Strong approximations for multiple channel queues in heavy traffic
- On global values of virtual waiting time of a customer in open queueing networks
- Strong Approximations of Open Queueing Networks
- Strong Approximations of Irreducible Closed Queueing Networks
- Heavy traffic analysis of roving server 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)