Skip to main content

Routing with too much information?

This is a preview of subscription content, access via your institution.

Fig. 1

References

  1. Akgun, O., Righter, R., Wolff, R.: Partial flexibility in routing and scheduling. Adv. Appl. Prob. 45, 673–691 (2013)

    Article  Google Scholar 

  2. Anselmi, J.: Combining size-based load balancing with round-robin for scalable low latency. IEEE Trans. Parallel Distrib. Syst. 31, 886–896 (2020)

    Article  Google Scholar 

  3. Bansal, N., Harchol-Balter, M.: Analysis of SRPT scheduling: investigating unfairness. Proc. ACM Sigmetrics ’01 (2001)

  4. Daley, D.J.: Certain optimality properties of the first-come first-served discipline for G/G/s queues. Stoch. Proc. Appl. 25, 301–308 (1987)

    Article  Google Scholar 

  5. Down, D., Wu, R.: Multi-layered round robin routing for parallel servers. Queueing Syst. 53, 177–188 (2006)

    Article  Google Scholar 

  6. Ephremides, A., Varaiya, P., Walrand, J.: A simple dynamic routing problem. IEEE Trans. Aut. Cont. 25(4), 690–693 (1980)

    Article  Google Scholar 

  7. Feng, H., Misra, V., Rubenstein, D.: Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems. Perf. Eval. 62(1–4), 475–492 (2005)

    Article  Google Scholar 

  8. Foss, S.G.: Approximation of multichannel queueing systems. Sib. Math. J. 21, 851–857 (1980)

    Article  Google Scholar 

  9. Grosof, I., Scully, Z., Harchol-Balter, M.: Load balancing guardrails: keeping your heavy traffic on the road to low response times Proc. ACM Meas. Anal. Comput. Syst. 3(2), 42:1–31 (2019)

    Google Scholar 

  10. Hyytiä, E.: Lookahead actions in dispatching to parallel servers. Perf. Eval. 70, 859–872 (2013)

    Article  Google Scholar 

  11. Hyytiä, E., Penttinen, A., Aalto, S.: Size- and state-aware dispatching problem with queue-specific job sizes. Eur. J. Oper. Res. 217(2), 357–370 (2012)

    Article  Google Scholar 

  12. Hyytiä, E., Righter, R.: Routing jobs with deadlines to heterogeneous parallel servers. Opns. Res. Lett. 44, 507–513 (2016)

    Article  Google Scholar 

  13. Hyytiä, E., Righter, R.: STAR and RATS: Multi-level dispatching policies. Int. Teletraffic Conf. ITC 32, 81–89 (2020)

    Google Scholar 

  14. Hyytiä, E., Righter, R., Aalto, S.: Task assignment in a heterogeneous server farm with switching delays and general energy-aware cost structure. Perf. Eval. 75–76, 17–35 (2014)

    Article  Google Scholar 

  15. Koole, G.: On the optimality of FCFS for networks of multi-server queues. CWI, Amsterdam, TR BS-R9235 (1992)

  16. Liu, Z., Towsley, D.: Optimality of the round-robin routing policy. J. Appl. Prob. 31(2), 466–475 (1994)

    Article  Google Scholar 

  17. Liu, Z., Righter, R.: Optimal load balancing on distributed homogeneous unreliable processors. Opns. Res. 46(4), 563–573 (1998)

    Article  Google Scholar 

  18. Weber, R.R.: On the optimal assignment of customers to parallel servers. J. Appl. Prob. 15(2), 406–413 (1978)

    Article  Google Scholar 

  19. Winston, W.: Optimality of the shortest line discipline. J. Appl. Prob. 14, 181–189 (1977)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rhonda Righter.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-022-09818-y