The symmetric longest queue system
From MaRDI portal
Recommendations
- The critical offered load in variants of the symmetric shortest and longest queue systems
- J.comput. appl. math
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
Cited in
(9)- The M/M/c with critical jobs
- Repair systems with exchangeable items and the longest queue mechanism
- A polling system with `join the shortest -- serve the longest' policy
- Dynamic control in multi-item production/inventory systems
- Using aggregate fill rate for dynamic scheduling of multi-class systems
- The tail behavior of a longest-queue-served-first queueing system: a random walk in the half plane
- The critical offered load in variants of the symmetric shortest and longest queue systems
- A 3-queue polling system with join the shortest-serve the longest policy
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
This page was built for publication: The symmetric longest queue system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128425)