Home > Research > Publications & Outputs > Routing with too much information?

Electronic data

  • Informed_Routing_as_accepted

    Accepted author manuscript, 98 KB, PDF document

    Embargo ends: 3/05/23

    Available under license: Other


Text available via DOI:

View graph of relations

Routing with too much information?

Research output: Contribution to Journal/MagazineLetterpeer-review

Article number3-4
<mark>Journal publication date</mark>3/05/2022
<mark>Journal</mark>Queueing Systems
Issue number3-4
Number of pages3
Pages (from-to)441-443
Publication StatusPublished
<mark>Original language</mark>English


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.