{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T07:01:48Z","timestamp":1774422108721,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2018,3,8]],"date-time":"2018-03-08T00:00:00Z","timestamp":1520467200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["18-07-00692"],"award-info":[{"award-number":["18-07-00692"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00607-018-0598-5","type":"journal-article","created":{"date-parts":[[2018,3,8]],"date-time":"2018-03-08T11:24:23Z","timestamp":1520508263000},"page":"1059-1079","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving routing decisions in parallel non-observable queues"],"prefix":"10.1007","volume":"100","author":[{"given":"Mikhail","family":"Konovalov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4092-5396","authenticated-orcid":false,"given":"Rostislav","family":"Razumchik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,8]]},"reference":[{"issue":"4","key":"598_CR1","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1287\/opre.42.4.750","volume":"42","author":"J Abate","year":"1994","unstructured":"Abate J, Ward W (1994) Transient behavior of the M\/G\/1 workload process. Oper Res 42(4):750\u2013764","journal-title":"Oper Res"},{"issue":"2","key":"598_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0166-5316(86)90027-1","volume":"6","author":"MH Ackroyd","year":"1986","unstructured":"Ackroyd MH (1986) Approximate characterisation of nonstationary discrete time G\/G\/1 systems. Perform Eval 6(2):117\u2013123","journal-title":"Perform Eval"},{"issue":"4","key":"598_CR3","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/347476.347482","volume":"47","author":"E Altman","year":"2000","unstructured":"Altman E, Gaujal B, Hordijk A (2000) Balanced sequences and optimal routing. J ACM 47(4):752\u2013775","journal-title":"J ACM"},{"issue":"1","key":"598_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1145\/1811099.1811083","volume":"38","author":"J Anselmi","year":"2010","unstructured":"Anselmi J, Gaujal B (2010) The price of anarchy in parallel queues revisited. SIGMETRICS Perform Eval Rev 38(1):353\u2013354","journal-title":"SIGMETRICS Perform Eval Rev"},{"issue":"12","key":"598_CR5","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1016\/j.peva.2011.07.023","volume":"68","author":"J Anselmi","year":"2011","unstructured":"Anselmi J, Gaujal B (2011) The price of forgetting in parallel and non-observable queues. Perform Eval 68(12):1291\u20131311","journal-title":"Perform Eval"},{"issue":"1","key":"598_CR6","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/14-SSY146","volume":"5","author":"J Anselmi","year":"2015","unstructured":"Anselmi J, Gaujal B, Nesti T (2015) Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies. Stoch Syst 5(1):120\u2013145","journal-title":"Stoch Syst"},{"issue":"3","key":"598_CR7","doi-asserted-by":"publisher","first-page":"723","DOI":"10.2307\/3213876","volume":"22","author":"T Aven","year":"1985","unstructured":"Aven T (1985) Upper (lower) bounds on the mean of the maximum (minimum) of a number of random variables. J Appl Prob 22(3):723\u2013728","journal-title":"J Appl Prob"},{"key":"598_CR8","unstructured":"Barbierato E, Gribaudo M, Iacono M (2011) Exploiting multiformalism models for testing and performance evaluation in SIMTHESys. In: Proceedings of 5th international ICST conference on performance evaluation methodologies and tools\u2014VALUETOOLS 2011, pp 121\u2013130"},{"issue":"1","key":"598_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0377-2217(99)00282-9","volume":"126","author":"K Becker","year":"2000","unstructured":"Becker K, Gaver D, Glazebrook K, Jacobs P, Lawphongpanich S (2000) Allocation of tasks to specialized processors: a planning approach. Eur J Oper Res 126(1):80\u201388","journal-title":"Eur J Oper Res"},{"key":"598_CR10","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1017\/S0269964816000097","volume":"30","author":"O Brun","year":"2016","unstructured":"Brun O (2016) Performance of non-cooperative routing over parallel non-observable queues. Probab Eng Inf Sci 30:455\u2013469","journal-title":"Probab Eng Inf Sci"},{"key":"598_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-69082-7","volume-title":"Stochastic learning and optimization\u2013a sensitivity-based approach","author":"X Cao","year":"2007","unstructured":"Cao X (2007) Stochastic learning and optimization\u2013a sensitivity-based approach. Springer, Berlin"},{"key":"598_CR12","doi-asserted-by":"crossref","unstructured":"Cesario E, Mastroianni C, Talia D (2012) Using mining@home for distributed ensemble learning. In: Proceedings of 5th international conference data management in cloud, grid and P2P systems, Globe 2012, Vienna, Austria, September 5\u20136, pp 100\u2013111","DOI":"10.1007\/978-3-642-32344-7_9"},{"issue":"1","key":"598_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90292-5","volume":"125","author":"MB Comb\u00e9","year":"1994","unstructured":"Comb\u00e9 MB, Boxma OJ (1994) Optimization of static traffic allocation policies. Theor Comput Sci 125(1):17\u201343","journal-title":"Theor Comput Sci"},{"issue":"4","key":"598_CR14","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TAC.1980.1102445","volume":"25","author":"A Ephremides","year":"1980","unstructured":"Ephremides A, Varaiya P, Walrand J (1980) A simple dynamic routing problem. IEEE Trans Autom Control 25(4):690\u2013693","journal-title":"IEEE Trans Autom Control"},{"issue":"3","key":"598_CR15","doi-asserted-by":"publisher","first-page":"556","DOI":"10.2307\/3212139","volume":"2","author":"S Gallot","year":"1966","unstructured":"Gallot S (1966) A bound for the maximum of a number of random variables. J Appl Probab 2(3):556\u2013558","journal-title":"J Appl Probab"},{"issue":"1","key":"598_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10626-006-6179-3","volume":"16","author":"B Gaujal","year":"2006","unstructured":"Gaujal B, Hyon E, Jean-Marie A (2006) Optimal routing in two parallel queues with exponential service times. Discrete Event Dyn Syst 16(1):71\u2013107","journal-title":"Discrete Event Dyn Syst"},{"issue":"2","key":"598_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/1035334.1035355","volume":"32","author":"X Guo","year":"2004","unstructured":"Guo X, Lu Y, Squillante MS (2004) Optimal probabilistic routing in distributed parallel queues. SIGMETRICS Perform Eval Rev 32(2):53\u201354","journal-title":"SIGMETRICS Perform Eval Rev"},{"issue":"9\u201312","key":"598_CR18","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.peva.2007.06.012","volume":"64","author":"V Gupta","year":"2007","unstructured":"Gupta V, Harchol Balter M, Sigman K, Whitt W (2007) Analysis of join-the-shortest-queue routing for web server farms. Perform Eval 64(9\u201312):1062\u20131081","journal-title":"Perform Eval"},{"issue":"4","key":"598_CR19","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1145\/2157.322409","volume":"30","author":"B Hajek","year":"1983","unstructured":"Hajek B (1983) The proof of a folk theorem on queuing delay with applications to routing in networks. J ACM 30(4):834\u2013851","journal-title":"J ACM"},{"issue":"1","key":"598_CR20","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/2492101.1555383","volume":"37","author":"M Harchol-Balter","year":"2009","unstructured":"Harchol-Balter M, Scheller-Wolf A, Young AR (2009) Surprising results on task assignment in server farms with high-variability workloads. SIGMETRICS Perform Eval Rev 37(1):287\u2013298","journal-title":"SIGMETRICS Perform Eval Rev"},{"key":"598_CR21","doi-asserted-by":"crossref","DOI":"10.1515\/9781400865239","volume-title":"Max plus at work: modeling and analysis of synchronized systems: a course on max-plus algebra and its applications","author":"B Heidergott","year":"2006","unstructured":"Heidergott B, Olsder GJ, van der Woude J (2006) Max plus at work: modeling and analysis of synchronized systems: a course on max-plus algebra and its applications. Princeton University Press, Princeton"},{"issue":"2","key":"598_CR22","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s001860300322","volume":"59","author":"A Hordijk","year":"2004","unstructured":"Hordijk A, van der Laan D (2004) Periodic routing to parallel queues and billiard sequences. Math Methods Oper Res 59(2):173\u2013192","journal-title":"Math Methods Oper Res"},{"key":"598_CR23","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1017\/S0269964800003508","volume":"8","author":"A Hordijk","year":"1994","unstructured":"Hordijk A, Koole GM, Loeve JA (1994) Analysis of a customer assignment model with no state information. Probab Eng Inf Sci 8:419\u2013429","journal-title":"Probab Eng Inf Sci"},{"issue":"2","key":"598_CR24","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01194403","volume":"47","author":"A Hordijk","year":"1998","unstructured":"Hordijk A, Loeve A, Tiggelman J (1998) Analysis of a finite-source customer assignment model with no state information. Math Methods Oper Res 47(2):317\u2013336","journal-title":"Math Methods Oper Res"},{"key":"598_CR25","unstructured":"Humblet P (1982) Determinism minimizes waiting time in queues. The laboratory for information and decision systems technical report ser LIDS-P\/1207. https:\/\/dspace.mit.edu\/handle\/1721.1\/2806 . Accessed 1 Mar 2018"},{"issue":"4","key":"598_CR26","first-page":"215","volume":"51","author":"E Hyytia","year":"2013","unstructured":"Hyytia E (2013) Optimal routing of fixed size jobs to two parallel servers. INFOR Inf Syst Oper Res 51(4):215\u2013224","journal-title":"INFOR Inf Syst Oper Res"},{"key":"598_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.simpat.2016.10.011","volume":"76","author":"A Jakobik","year":"2017","unstructured":"Jakobik A, Grzonka D, Palmieri F (2017) Non-deterministic security driven meta scheduler for distributed cloud organizations. Simul Modell Pract Theory 76:67\u201381","journal-title":"Simul Modell Pract Theory"},{"issue":"11","key":"598_CR28","doi-asserted-by":"publisher","first-page":"1896","DOI":"10.1109\/TPDS.2011.50","volume":"22","author":"B Javadi","year":"2011","unstructured":"Javadi B, Kondo D, Vincent JM, Anderson DP (2011) Discovering statistical models of availability in large distributed systems: an empirical study of seti@home. IEEE Trans Parallel Distrib Syst 22(11):1896\u20131903","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"598_CR29","doi-asserted-by":"crossref","unstructured":"Javadi B, Thulasiraman P, Buyya R (2012) Cloud resource provisioning to extend the capacity of local resources in the presence of failures. In: 2012 IEEE 14th international conference on high performance computing and communication 2012 IEEE 9th international conference on embedded software and systems, pp 311\u2013319","DOI":"10.1109\/HPCC.2012.49"},{"issue":"4","key":"598_CR30","first-page":"57","volume":"10","author":"M Konovalov","year":"2016","unstructured":"Konovalov M, Razumchik R (2016) Dispatching to two parallel nonobservable queues using only static information. Informatika i ee Primeneniya 10(4):57\u201367","journal-title":"Informatika i ee Primeneniya"},{"key":"598_CR31","doi-asserted-by":"crossref","unstructured":"Konovalov M, Razumchik R (2017) Using inter-arrival times for scheduling in non-observable queues. In: Proceedings of 31th European conference on modelling and simulation, ECMS 2017, Budapest, Hungary, 2017, pp 667\u2013672","DOI":"10.7148\/2017-0667"},{"key":"598_CR32","volume-title":"Methods of acaptive information processing and their applications","author":"MG Konovalov","year":"2007","unstructured":"Konovalov MG (2007) Methods of acaptive information processing and their applications. Institute of Informatics Problems of RAS, Kaliningrad"},{"key":"598_CR33","unstructured":"Kraemer W, Langenbach-Belz M (1976) Approximate formulae for the delay in the queueing system GI\/G\/1. In: Proceedings of 8th international teletraffic congress, pp 2351\u20132358"},{"issue":"2","key":"598_CR34","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/opre.45.2.309","volume":"45","author":"A Sharifnia","year":"1997","unstructured":"Sharifnia A (1997) Instability of the join-the-shortest-queue and fcfs policies in queueing systems and their stabilization. Oper Res 45(2):309\u2013314","journal-title":"Oper Res"},{"key":"598_CR35","doi-asserted-by":"publisher","DOI":"10.1142\/5857","volume-title":"Mathematical theory of adaptive control","author":"V Sragovich","year":"2005","unstructured":"Sragovich V (2005) Mathematical theory of adaptive control. World Scientific, Singapore"},{"issue":"3","key":"598_CR36","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0167-7152(96)00029-6","volume":"31","author":"W Stadje","year":"1997","unstructured":"Stadje W (1997) A new approach to the Lindley recursion. Stat Probab Lett 31(3):169\u2013175","journal-title":"Stat Probab Lett"},{"issue":"3","key":"598_CR37","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1016\/j.ejor.2014.02.058","volume":"237","author":"SD Vuyst","year":"2014","unstructured":"Vuyst SD, Bruneel H, Fiems D (2014) Computationally efficient evaluation of appointment schedules in health care. Eur J Oper Res 237(3):1142\u20131154","journal-title":"Eur J Oper Res"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-0598-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0598-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0598-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T03:48:40Z","timestamp":1603943320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-0598-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,8]]},"references-count":37,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["598"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-0598-5","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,8]]},"assertion":[{"value":"19 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}