The autostrada queueing problem
From MaRDI portal
Publication:3332048
Recommendations
Cited in
(18)- Analysis of the asymmetric shortest queue problem
- Duality properties of a one-dimensional random walk and a new computational algorithm
- A level-crossing approach to the solution of the shortest-queue problem
- Transient analysis of two queues in parallel with jockeying
- Bad luck when joining the shortest queue
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- Stationary analysis of the shortest queue problem
- Web server load balancing: a queueing analysis
- On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
- A numerically stable algorithm for two server queue models
- Analysis of two queues in parallel with jockeying and restricted capacities
- Optimality of routing and servicing in dependent parallel processing systems
- On the value function of the M/G/1 FCFS and LCFS queues
- The chilean highway problem
- Martingales and buffer overflow for the symmetric shortest queue model
- Algorithms of distributed task allocation for cooperative agents
- On the Shortest Queue Policy for the Tandem Parallel Queue
- Size- and state-aware dispatching problem with queue-specific job sizes
This page was built for publication: The autostrada queueing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3332048)