An approximation for the mean response time for shortest queue routing with general interarrival and service times

Performance Evaluation

Volumn 17, Issue 2, 1993, Pages 123-139

  Nelson, Randolph D ^a   Philips, Thomas K ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b IBM   (United States)

Author keywords

load balancing; queueing theory; shortest queue routing

Indexed keywords

EID: 38249007481     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-5316(93)90004-E     Document Type: Article

References (21)

1. A note on waiting times in systems with queues in parallel
2. The autostrada queueing problem
3. A simple dynamic routing problem
4. Two queues in parallel
5. A basic dynamic routing problem and diffusion
6. The shortest queue problem
7. Two similar queues in parallel
8. Two parallel M/G/1 queues where arrivals join the system with the smaller buffer content
9. An approximate formula for waiting times in single server queues
10. An approximation to the response time for shortest queue routing
11. Approximate analysis of fork/join synchronization in parallel queues
12. Algorithmic and approximate analysis of the shorter queue model
13. Bounds and an approximation for single server queues
14. On the approximations to the single server queue
15. Simple approximations for the GI/G/c queue, I: the steady state probabilities
16. Optimality of the shortest line discipline