{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:38:28Z","timestamp":1742971108095,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030925109"},{"type":"electronic","value":"9783030925116"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92511-6_11","type":"book-chapter","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T14:05:12Z","timestamp":1638885912000},"page":"171-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Routing Problems with\u00a0Delayed Information"],"prefix":"10.1007","author":[{"given":"Esa","family":"Hyyti\u00e4","sequence":"first","affiliation":[]},{"given":"Rhonda","family":"Righter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,8]]},"reference":[{"issue":"4","key":"11_CR1","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.: Balanced sequences and optimal routing. J. ACM 47(4), 752\u2013775 (2000)","journal-title":"J. ACM"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01151929","volume":"19","author":"E Altman","year":"1995","unstructured":"Altman, E., Kofman, D., Yechiali, U.: Discrete time queues with delayed information. Queueing Syst. 19, 361\u2013376 (1995)","journal-title":"Queueing Syst."},{"key":"11_CR3","unstructured":"Artiges, D.: Optimal routing into two heterogeneous information. In: Proceedings of the 32nd Conference on Decision and Control, San Antonio, Texas (1993)"},{"key":"11_CR4","unstructured":"Buzen, J.P., Chen, P.P.: Optimal load balancing in memory hierarchies. In: Proceedings of the 6th IFIP Congress, pp. 271\u2013275, Stockholm, Sweden, August 1974"},{"issue":"4","key":"11_CR5","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.: A simple dynamic routing problem. IEEE Trans. Automatic Control 25(4), 690\u2013693 (1980)","journal-title":"IEEE Trans. Automatic Control"},{"issue":"3\u20134","key":"11_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1093\/biomet\/45.3-4.401","volume":"45","author":"FA Haight","year":"1958","unstructured":"Haight, F.A.: Two queues in parallel. Biometrika 45(3\u20134), 401\u2013410 (1958)","journal-title":"Biometrika"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1287\/stsy.2019.0045","volume":"9","author":"D Lipschutz","year":"2019","unstructured":"Lipschutz, D.: Open problem-load balancing using delayed information. Stochas. Syst. 9(3), 305\u2013306 (2019)","journal-title":"Stochas. Syst."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1021812816979","volume":"43","author":"N Litvak","year":"2003","unstructured":"Litvak, N., Yechiali, U.: Routing in queues with delayed information. Queueing Syst. 43, 147\u2013165 (2003)","journal-title":"Queueing Syst."},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1287\/opre.46.4.563","volume":"46","author":"Z Liu","year":"1998","unstructured":"Liu, Z., Righter, R.: Optimal load balancing on distributed homogeneous unreliable processors. Oper. Res. 46(4), 563\u2013573 (1998)","journal-title":"Oper. Res."},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"466","DOI":"10.2307\/3215039","volume":"31","author":"Z Liu","year":"1994","unstructured":"Liu, Z., Towsley, D.: Optimality of the round-robin routing policy. J. Appl. Probab. 31(2), 466\u2013475 (1994)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.824633","volume":"11","author":"M Mitzenmacher","year":"2000","unstructured":"Mitzenmacher, M.: How useful is old information? IEEE Trans. Parallel Distrib. Syst. 11(1), 6\u201320 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1137\/18M1170637","volume":"18","author":"S Novitzky","year":"2019","unstructured":"Novitzky, S., Pender, J., Rand, R.H., Wesson, E.: Nonlinear dynamics in queueing theory: determining the size of oscillations in queues with delay. SIAM J. Appl. Dyn. Syst. 18(1), 279\u2013311 (2019)","journal-title":"SIAM J. Appl. Dyn. Syst."},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.1287\/moor.2019.1024","volume":"45","author":"J Pender","year":"2020","unstructured":"Pender, J., Rand, R., Wesson, E.: A stochastic analysis of queues with customer choice and delayed information. Math. Oper. Res. 45(3), 1104\u20131126 (2020)","journal-title":"Math. Oper. Res."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Selen, J., Adan, I., Kapodistria, S., van Leeuwaarden, J.: Steady-state analysis of shortest expected delay routing. Queueing Syst. 84(3), 309\u2013354 (2016)","DOI":"10.1007\/s11134-016-9497-7"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.orl.2021.03.001","volume":"49","author":"W Whitt","year":"2021","unstructured":"Whitt, W.: On the many-server fluid limit for a service system with routing based on delayed information. Oper. Res. Lett. 49, 316\u2013319 (2021)","journal-title":"Oper. Res. Lett."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.2307\/3213271","volume":"14","author":"W Winston","year":"1977","unstructured":"Winston, W.: Optimality of the shortest line discipline. J. Appl. Probab. 14, 181\u2013189 (1977)","journal-title":"J. Appl. Probab."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Performance Evaluation Methodologies and Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92511-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T19:15:19Z","timestamp":1639163719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92511-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030925109","9783030925116"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92511-6_11","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VALUETOOLS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EAI International Conference on Performance Evaluation Methodologies and Tools","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"valuetools2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}