Routing with too much information?

Hyytiä, E. and Jacko, P. and Righter, R. (2022) Routing with too much information? Queueing Systems, 100 (3-4). pp. 441-443. ISSN 0257-0130

Text (Informed_Routing_as_accepted)
Informed_Routing_as_accepted.pdf - Accepted Version
Restricted to Repository staff only until 3 May 2023.
Available under License Other.

Download (100kB)


An important problem with many applications is routing jobs to parallel processors with dedicated queues to minimize job response times or delays. Often, job sizes are known or well estimated upon arrival, and the router can use this information to minimize delays. If job sizes, as well as routing history, are known, then the router also knows the current states at the servers without message passing. Somewhat surprisingly, the problem with job-size information available is much harder than the problem without this information, and there are very few theoretical results to provide general guidelines. Counter-examples show that many “intuitively obvious” results are in fact not true.

Item Type:
Journal Article
Journal or Publication Title:
Queueing Systems
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
20 Jul 2022 15:20
Last Modified:
20 Jul 2022 15:20