{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T20:01:47Z","timestamp":1774641707279,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2016,7,2]],"date-time":"2016-07-02T00:00:00Z","timestamp":1467417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,7,2]],"date-time":"2016-07-02T00:00:00Z","timestamp":1467417600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-1252522"],"award-info":[{"award-number":["DGE-1252522"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-CMMI-1334194"],"award-info":[{"award-number":["NSF-CMMI-1334194"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-CSR-1116282"],"award-info":[{"award-number":["NSF-CSR-1116282"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Intel Science and Technology Center for Cloud Computing"},{"name":"Google Faculty Research Award"},{"name":"Academy of Finland TOP Energy Project","award":["268992"],"award-info":[{"award-number":["268992"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-CMMI-1538204"],"award-info":[{"award-number":["NSF-CMMI-1538204"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11134-016-9485-y","type":"journal-article","created":{"date-parts":[[2016,7,2]],"date-time":"2016-07-02T01:49:56Z","timestamp":1467424196000},"page":"227-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["Queueing with redundant requests: exact analysis"],"prefix":"10.1007","volume":"83","author":[{"given":"Kristen","family":"Gardner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Zbarsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sherwin","family":"Doroudi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mor","family":"Harchol-Balter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esa","family":"Hyyti\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Scheller-Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,2]]},"reference":[{"issue":"1","key":"9485_CR1","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1214\/13-SSY117","volume":"4","author":"I Adan","year":"2014","unstructured":"Adan, I., Weiss, G.: A skill based parallel service system under FCFS-ALIS\u2014steady state, overloads, and abandonments. Stoch. Syst. 4(1), 250\u2013299 (2014)","journal-title":"Stoch. Syst."},{"key":"9485_CR2","unstructured":"Ananthanarayanan, G., Ghodsi, A., Shenker, S., Stoica, I.: Effective straggler mitigation: attack of the clones. In NSDI, pp. 185\u2013198, April 2013"},{"key":"9485_CR3","unstructured":"Ananthanarayanan, G., Hung, M.C.C., Ren, X., Stoica, I., Wierman, A., Yu, M.: Grass: trimming stragglers in approximation analytics. In Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation, pp. 289\u2013302. USENIX Association, 2014"},{"key":"9485_CR4","unstructured":"Baccelli, F., Makowski, A.: Simple computable bounds for the fork-join queue. Technical Report RR-0394, Inria, 1985"},{"key":"9485_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1017\/S0001867800018851","volume":"21","author":"F Baccelli","year":"1989","unstructured":"Baccelli, F., Makowski, A.M., Shwartz, A.: The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds. Adv. Appl. Prob. 21, 629\u2013660 (1989)","journal-title":"Adv. Appl. Prob."},{"key":"9485_CR6","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1287\/opre.1120.1107","volume":"60","author":"A Bassamboo","year":"2012","unstructured":"Bassamboo, A., Randhawa, R.S., Mieghem, J.A.V.: A little flexibility is all you need: on the value of flexible resources in queueing systems. Oper. Res. 60, 1423\u20131435 (2012)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"9485_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1021852431091","volume":"43","author":"S Borst","year":"2003","unstructured":"Borst, S., Boxma, O., Uitert, M.V.: The asymptotic workload behavior of two coupled queues. Queueing Syst. 43(1\u20132), 81\u2013102 (2003)","journal-title":"Queueing Syst."},{"issue":"1","key":"9485_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/15326348708807049","volume":"3","author":"RF Botta","year":"1987","unstructured":"Botta, R.F., Harris, C.M., Marchal, W.G.: Characterizations of generalized hyperexponential distribution functions. Commun. Stat. Stoch. Models 3(1), 115\u2013148 (1987)","journal-title":"Commun. Stat. Stoch. Models"},{"key":"9485_CR9","unstructured":"Boxma, O., Koole, G., Liu, Z.: Queueing-theoretic solution methods for models of parallel and distributed systems. In Performance Evaluation of Parallel and Distributed Systems Solution Methods. CWI Tract 105 & 106, pp. 1\u201324, 1994"},{"issue":"2","key":"9485_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10723-007-9068-6","volume":"5","author":"H Casanova","year":"2007","unstructured":"Casanova, H.: Benefits and drawbacks of redundant batch requests. J. Grid Comput. 5(2), 235\u2013250 (2007)","journal-title":"J. Grid Comput."},{"key":"9485_CR11","volume-title":"Boundary Value Problems in Queueing System Analysis","author":"JW Cohen","year":"1983","unstructured":"Cohen, J.W., Boxma, O.J.: Boundary Value Problems in Queueing System Analysis. North-Holland Publishing Company, Amsterdam (1983)"},{"issue":"2","key":"9485_CR12","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/2408776.2408794","volume":"56","author":"J Dean","year":"2013","unstructured":"Dean, J., Barroso, L.A.: The tail at scale. Commun. ACM 56(2), 74\u201380 (2013)","journal-title":"Commun. ACM"},{"issue":"3","key":"9485_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00535168","volume":"47","author":"G Fayolle","year":"1979","unstructured":"Fayolle, G., Iasnogorodski, R.: Two coupled processors: the reduction to a Riemann-Hilbert problem. Zeitschrift fur Wahrscheinlichkeitstheorie und vervandte Gebiete 47(3), 325\u2013351 (1979)","journal-title":"Zeitschrift fur Wahrscheinlichkeitstheorie und vervandte Gebiete"},{"issue":"5","key":"9485_CR14","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/0145052","volume":"45","author":"L Flatto","year":"1985","unstructured":"Flatto, L.: Two parallel queues created by arrivals with two demands II. SIAM J. Appl. Math. 45(5), 1159\u20131166 (1985)","journal-title":"SIAM J. Appl. Math."},{"issue":"5","key":"9485_CR15","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1137\/0144074","volume":"44","author":"L Flatto","year":"1984","unstructured":"Flatto, L., Hahn, S.: Two parallel queues created by arrivals with two demands I. SIAM J. Appl. Math. 44(5), 250\u2013255 (1984)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"9485_CR16","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10(1), 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc."},{"key":"9485_CR17","doi-asserted-by":"crossref","unstructured":"Harchol-Balter, M., Li, C., Osogami, T., Scheller-Wolf, A., Squillante, M.: Cycle stealing under immediate dispatch task assignment. In Annual Symposium on Parallel Algorithms and Architectures, pp. 274\u2013285, June 2003","DOI":"10.1145\/777412.777462"},{"issue":"5","key":"9485_CR18","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1137\/0148069","volume":"48","author":"G Hooghiemstra","year":"1988","unstructured":"Hooghiemstra, G., Keane, M., de Ree, S.V.: Power series for stationary distributions of coupled processor models. SIAM J. Appl. Math. 48(5), 861\u2013878 (1988)","journal-title":"SIAM J. Appl. Math."},{"key":"9485_CR19","doi-asserted-by":"crossref","unstructured":"Huang, H., Hung, W., Shin, K.G.: FS2: dynamic data replication in free disk space for improving disk performance and energy consumption. In Proceedings of the SOSP\u201905, pp. 263\u2013276, December 2005","DOI":"10.1145\/1095810.1095836"},{"key":"9485_CR20","doi-asserted-by":"crossref","unstructured":"Joshi, G., Liu, Y., Soljanin, E.: Coding for fast content download. In Allerton Conference\u201912, pp. 326\u2013333, 2012","DOI":"10.1109\/Allerton.2012.6483236"},{"issue":"5","key":"9485_CR21","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1109\/JSAC.2014.140518","volume":"32","author":"G Joshi","year":"2014","unstructured":"Joshi, G., Liu, Y., Soljanin, E.: On the delay-storage trade-off in content download from coded distributed storage systems. IEEE J. Sel. Areas Commun. 32(5), 989\u2013997 (2014)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"5","key":"9485_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6377(88)90035-1","volume":"7","author":"J Keilson","year":"1988","unstructured":"Keilson, J., Servi, L.: A distributional form of Little\u2019s Law. Oper. Res. Lett. 7(5), 223\u2013227 (1988)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9485_CR23","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1109\/12.16501","volume":"38","author":"C Kim","year":"1989","unstructured":"Kim, C., Agrawala, A.K.: Analysis of the fork-join queue. IEEE Trans. Comput. 38(2), 1041\u20131053 (1989)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"9485_CR24","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1017\/S0021900200034318","volume":"18","author":"AG Konheim","year":"1981","unstructured":"Konheim, A.G., Meilijson, I., Melkman, A.: Processor-sharing of two parallel lines. J. Appl. Prob. 18(4), 952\u2013956 (1981)","journal-title":"J. Appl. Prob."},{"key":"9485_CR25","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10951-007-0018-8","volume":"11","author":"G Koole","year":"2009","unstructured":"Koole, G., Righter, R.: Resource allocation in grid computing. J. Sched. 11, 163\u2013173 (2009)","journal-title":"J. Sched."},{"issue":"6","key":"9485_CR26","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1109\/12.2213","volume":"37","author":"R Nelson","year":"1988","unstructured":"Nelson, R., Tantawi, A.N.: Approximate analysis of fork\/join synchronization in parallel queues. IEEE Trans. Comput. 37(6), 739\u2013743 (1988)","journal-title":"IEEE Trans. Comput."},{"key":"9485_CR27","doi-asserted-by":"crossref","unstructured":"Osogami, T., Harchol-Balter, M., Scheller-Wolf, A.: Analysis of cycle stealing with switching times and thresholds. In SIGMETRICS, pp. 184\u2013195, June 2003","DOI":"10.1145\/885651.781050"},{"key":"9485_CR28","unstructured":"Ren, X., Ananthanarayanan, G., Wierman, A., Yu, M.: Hopper: decentralized speculation-aware cluster scheduling at scale"},{"key":"9485_CR29","unstructured":"Shah, N.B., Lee, K., Ramchandran, K.: The MDS queue: analysing latency performance of codes and redundant requests. Technical Report \n                    arXiv:1211.5405\n                    \n                  , November 2012"},{"key":"9485_CR30","doi-asserted-by":"crossref","unstructured":"Shah, N.B., Lee, K., Ramchandran, K.: When do redundant requests reduce latency? Technical Report \n                    arXiv:1311.2851\n                    \n                  , June 2013","DOI":"10.1109\/Allerton.2013.6736597"},{"key":"9485_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11134-010-9183-0","volume":"66","author":"AL Stolyar","year":"2010","unstructured":"Stolyar, A.L., Tezcan, T.: Control of systems with flexible multi-server pools: a shadow routing approach. Queueing Syst. 66, 1\u201351 (2010)","journal-title":"Queueing Syst."},{"key":"9485_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/11-SSY033","volume":"2","author":"J Tsitsiklis","year":"2012","unstructured":"Tsitsiklis, J., Xu, K.: On the power of (even a little) resource pooling. Stoch. Syst. 2, 1\u201366 (2012)","journal-title":"Stoch. Syst."},{"key":"9485_CR33","doi-asserted-by":"crossref","unstructured":"Tsitsiklis, J., Xu, K.: Queueing system topologies with limited flexibility. In SIGMETRICS, 2013","DOI":"10.1145\/2465529.2465757"},{"key":"9485_CR34","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s11134-011-9274-6","volume":"70","author":"J Visschers","year":"2012","unstructured":"Visschers, J., Adan, I., Weiss, G.: A product form solution to a system with multi-type jobs and multi-type servers. Queueing Syst. 70, 269\u2013298 (2012)","journal-title":"Queueing Syst."},{"key":"9485_CR35","doi-asserted-by":"crossref","unstructured":"Vulimiri, A., Godfrey, P.B., Mittal, R., Sherry, J., Ratnasamy, S., Shenker, S.: Low latency via redundancy. In CoNEXT, pp. 283\u2013294, December 2013","DOI":"10.1145\/2535372.2535392"},{"key":"9485_CR36","doi-asserted-by":"crossref","unstructured":"Wang, D., Joshi, G., Wornell, G.: Efficient task replication for fast response times in parallel computation. Technical Report \n                    arXiv:1404.1328\n                    \n                  , April 2014","DOI":"10.1145\/2591971.2592042"},{"key":"9485_CR37","doi-asserted-by":"crossref","unstructured":"Xia, C., Liu, Z., Towsley, D., Lelarge, M.: Scalability of fork\/join queueing networks with blocking. In SIGMETRICS, pp. 133\u2013144, June 2007","DOI":"10.1145\/1269899.1254898"},{"key":"9485_CR38","doi-asserted-by":"crossref","unstructured":"Xu, Y., Bailey, M., Noble, B., Jahanian, F.: Small is better: avoiding latency traps in virtualized data centers. In Proceedings of the 4th annual Symposium on Cloud Computing, p. 7. ACM, 2013","DOI":"10.1145\/2523616.2523620"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-016-9485-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-016-9485-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-016-9485-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-016-9485-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:23:27Z","timestamp":1589721807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-016-9485-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,2]]},"references-count":38,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9485"],"URL":"https:\/\/doi.org\/10.1007\/s11134-016-9485-y","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,2]]},"assertion":[{"value":"11 September 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}