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

Research

Associated organisational units

Electronic data

Links

Text available via DOI:

View graph of relations

Routing with too much information?

Research output: Contribution to Journal/Magazine › Letter › peer-review

Published

Standard

Routing with too much information? / Hyytiä, E.; Jacko, P.; Righter, R.
In: Queueing Systems, Vol. 100, No. 3-4, 3-4, 03.05.2022, p. 441-443.

Research output: Contribution to Journal/Magazine › Letter › peer-review

Harvard

Hyytiä, E, Jacko, P & Righter, R 2022, 'Routing with too much information?', Queueing Systems, vol. 100, no. 3-4, 3-4, pp. 441-443. https://doi.org/10.1007/s11134-022-09818-y

APA

Hyytiä, E., Jacko, P., & Righter, R. (2022). Routing with too much information? Queueing Systems, 100(3-4), 441-443. Article 3-4. https://doi.org/10.1007/s11134-022-09818-y

Vancouver

Hyytiä E, Jacko P, Righter R. Routing with too much information? Queueing Systems. 2022 May 3;100(3-4):441-443. 3-4. doi: 10.1007/s11134-022-09818-y

Author

Hyytiä, E. ; Jacko, P. ; Righter, R. / Routing with too much information?. In: Queueing Systems. 2022 ; Vol. 100, No. 3-4. pp. 441-443.

Bibtex

@article{f28871ef126f47feaa218a0835a2bb7a,
title = "Routing with too much information?",
abstract = "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.",
author = "E. Hyyti{\"a} and P. Jacko and R. Righter",
year = "2022",
month = may,
day = "3",
doi = "10.1007/s11134-022-09818-y",
language = "English",
volume = "100",
pages = "441--443",
journal = "Queueing Systems",
issn = "0257-0130",
publisher = "Springer Netherlands",
number = "3-4",

}

RIS

TY - JOUR

T1 - Routing with too much information?

AU - Hyytiä, E.

AU - Jacko, P.

AU - Righter, R.

PY - 2022/5/3

Y1 - 2022/5/3

N2 - 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.

AB - 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.

U2 - 10.1007/s11134-022-09818-y

DO - 10.1007/s11134-022-09818-y

M3 - Letter

VL - 100

SP - 441

EP - 443

JO - Queueing Systems

JF - Queueing Systems

SN - 0257-0130

IS - 3-4

M1 - 3-4

ER -