Strong approximations for the open queueing network in heavy traffic
From MaRDI portal
Publication:1201616
Recommendations
Cited in
(11)- Strong approximations for multiple channel queues in heavy traffic
- A law of the iterated logarithm for the sojourn time process in queues in series
- scientific article; zbMATH DE number 1159047 (Why is no real title available?)
- Strong Approximations of Open Queueing Networks
- Scheduling networks of queues: Heavy traffic analysis of a simple open network
- On extreme values in open queueing networks
- On the analysis of the virtual waiting time in open queueing networks
- On global values of virtual waiting time of a customer in open queueing networks
- Strong Approximations of Irreducible Closed Queueing Networks
- Heavy traffic analysis of roving server networks
- Strong approximations for a Kumar-Seidman network under a priority service discipline
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)