Timeline for Average wait time for multiple queues where arrivals enter shortest queue
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 3, 2011 at 0:54 | vote | accept | possiblywrong | ||
| Jan 1, 2011 at 16:19 | answer | added | ansobol | timeline score: 1 | |
| Dec 29, 2010 at 12:23 | comment | added | possiblywrong | Both of these comments are helpful; I am new here, and would like to "accept an answer" but these seem to be comments vs. answers. Let me know if I'm missing something. I would like to understand "optimal maximum throughput" better. How does throughput vary at all as long as $\lambda < s\mu$? E.g., consider the policy of choosing a queue at random instead of the shortest queue. This yields worse latency (I think this is equiv. to (1) in the OP), but throughput hasn't changed. That is, I may still get a newspaper every morning, but they might always be two weeks old. | |
| Dec 29, 2010 at 1:42 | comment | added | Steve Huntsman | See papers citing jstor.org/pss/3213954 | |
| Dec 28, 2010 at 23:14 | comment | added | Alekk | keyword: "shortest queue problem". A quick research reveals that the policy that consists in choosing the shortest queue has been proven to be optimal (maximum throughput) - nevertheless, even in the case of only 2 servers, the invariant distribution is not tractable. | |
| Dec 28, 2010 at 21:45 | history | asked | possiblywrong | CC BY-SA 2.5 |