{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T08:25:39Z","timestamp":1787905539203,"version":"build-2784847793"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["S2018\/TCS-4423 (CABAHLA-CM: Convergencia Big data-Hpc: de los sensores a las Aplicacione)"],"award-info":[{"award-number":["S2018\/TCS-4423 (CABAHLA-CM: Convergencia Big data-Hpc: de los sensores a las Aplicacione)"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10586-020-03139-6","type":"journal-article","created":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T05:02:41Z","timestamp":1592802161000},"page":"611-624","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Enhancing the power of two choices load balancing algorithm using round robin policy"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5067-1502","authenticated-orcid":false,"given":"Felix","family":"Garcia-Carballeira","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alejandro","family":"Calderon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesus","family":"Carretero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"3139_CR1","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2020.2968443","author":"R Belardi","year":"2020","unstructured":"Belardi, R., Mattia, G.P.: Power of random choices made efficient for fog computing. IEEE Trans. Cloud Comput. Early Access (2020). https:\/\/doi.org\/10.1109\/TCC.2020.2968443","journal-title":"IEEE Trans. Cloud Comput. Early Access"},{"key":"3139_CR2","doi-asserted-by":"crossref","unstructured":"Bramson, M., Lu, Y., Prabhakar, B.: Randomized load balancing with general service time distributions. In: SIGMETRICS\u201910, 14\u201318 June, New York, USA (2010)","DOI":"10.1145\/1811039.1811071"},{"issue":"3","key":"3139_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s11134-012-9311-0","volume":"71","author":"M Bramson","year":"2012","unstructured":"Bramson, M., Lu, Y., Prabhakar, B.: Asymptotic independence of queues under randomized load balancing. Queueing Syst. 71(3), 247\u2013292 (2012)","journal-title":"Queueing Syst."},{"issue":"5","key":"3139_CR4","doi-asserted-by":"publisher","first-page":"1841","DOI":"10.1214\/12-AAP888","volume":"23","author":"M Bramson","year":"2013","unstructured":"Bramson, M., Lu, Y., Prabhakar, B.: Decay of tails at equilibrium for FIFO join the shortest queue networks. Ann. Appl. Probab. 23(5), 1841\u20131878 (2013)","journal-title":"Ann. Appl. Probab."},{"issue":"1","key":"3139_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/JSAC.2010.100108","volume":"28","author":"D Breitgand","year":"2010","unstructured":"Breitgand, D., Cohen, R., Nahir, A., Raz, D.: On cost-aware monitoring for self-adaptive load sharing. IEEE J. Sel. Areas Commun. 28(1), 70\u201383 (2010)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"74","key":"3139_CR6","doi-asserted-by":"publisher","first-page":"2899","DOI":"10.1016\/j.jpdc.2014.06.008","volume":"10","author":"H Casanova","year":"2014","unstructured":"Casanova, H., Giersch, A., Legrand, A., Quison, M., Sutero, F.: Higher order approximations for the single server queue with splitting, merging and feedback. J. Parallel Distrib. Comput. 10(74), 2899\u20132917 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"3139_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y., Sun, M.: TSSA: A two step scheduling algorithm for the event-driven clusters. In: 2018 20th International Conference on Advanced Communication Technology (ICACT), IEEE, pp. 184\u2013189 (2018)","DOI":"10.23919\/ICACT.2018.8323690"},{"issue":"1","key":"3139_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/opre.1110.0998","volume":"60","author":"H Chen","year":"2012","unstructured":"Chen, H., Ye, H.Q.: Asymptotic optimality of balanced routing. Oper. Res. 60(1), 163\u2013179 (2012)","journal-title":"Oper. Res."},{"key":"3139_CR9","unstructured":"Crovella, M.E., Taqqu, M.S., Bestavros, A.: Heavy-tailed probability distributions in the World Wide Web. In: A Practical Guide to Heavy Tails, vol. 1, pp. 3\u201326. Birkha\u00fcser, Boston (1998)"},{"key":"3139_CR10","doi-asserted-by":"crossref","unstructured":"Da Costa, G., Grange, L., De Courchelle, I.: Modeling and generating large-scale Google-like Workload. In: International Workshop on Resilience and\/or Energy-Aware Techniques for High-Performance Computing, November 2016, Hangzhou, China (2016)","DOI":"10.1109\/IGCC.2016.7892623"},{"key":"3139_CR11","doi-asserted-by":"crossref","unstructured":"Dai, D., Chen, Y., Kimpe, D., Ross, R.: Two-choice randomized dynamic I\/O scheduler for object storage systems. In: SC\u201914 Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 635\u2013646 (2014)","DOI":"10.1109\/SC.2014.57"},{"issue":"5","key":"3139_CR12","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TSE.1986.6312961","volume":"SE\u201312","author":"LD Eager","year":"1996","unstructured":"Eager, L.D., Lazowska, E.D., Zahorjan, J.: Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Softw. Eng. SE\u201312(5), 662\u2013675 (1996)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"3139_CR13","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. Autom. Control 25(4), 690\u2013693 (1980)","journal-title":"IEEE Trans. Autom. Control"},{"key":"3139_CR14","doi-asserted-by":"crossref","unstructured":"Fanti, G., Jiao, J., Makkuva, A., Oh, S., Rana, R., Viswanath, P.: Barracuda: the power of l-polling in proof-of-stake blockchains. In: Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 351\u2013360 (2019)","DOI":"10.1145\/3323679.3326533"},{"key":"3139_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0377-2217(99)00174-5","volume":"124","author":"MK Girish","year":"2000","unstructured":"Girish, M.K., Hu, J.-Q.: Higher order approximations for the single server queue with splitting, merging and feedback. Eur. J. Oper. Res. 124, 447\u2013467 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"9\u201312","key":"3139_CR16","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.: Analysis of join-the-shortest-queue routing for web server farms. Perform. Eval. 64(9\u201312), 1062\u20131081 (2007)","journal-title":"Perform. Eval."},{"key":"3139_CR17","doi-asserted-by":"crossref","unstructured":"Hellemans, T., Van Houdt, B.: On the power-of-d-choices with least loaded server selection. In: Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 2(2), pp. 1\u201322 (2018)","DOI":"10.1145\/3219617.3219664"},{"issue":"04","key":"3139_CR18","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S0269964800001777","volume":"4","author":"A Hordijk","year":"1990","unstructured":"Hordijk, A., Koole, G.: On the optimality of the generalized shortest queue policy. Probab. Eng. Inf. Sci. 4(04), 477\u2013487 (1990)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"3139_CR19","unstructured":"Hyytia, E., Aalto, S.: Round-robin routing policy. In: ValueTools\u201913, 10\u201312 December 2013, Turin, Italy"},{"key":"3139_CR20","doi-asserted-by":"crossref","unstructured":"Izagirre, A., Makowskid, A.M.: Light traffic performance under the power-of-two load balancing strategy: the case of server heterogeneity. In: Conference IFIP Performance 2014, Turin, Italy","DOI":"10.1145\/2667522.2667527"},{"issue":"1","key":"3139_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1287\/ijoc.5.1.69","volume":"5","author":"MA Johnson","year":"1993","unstructured":"Johnson, M.A.: Selecting parameters of phase distributions: combining nonlinear programming, heuristics and Erlang distributions. ORSA J. Comput. 5(1), 69\u201383 (1993)","journal-title":"ORSA J. Comput."},{"issue":"4","key":"3139_CR22","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1017\/S0305004100036094","volume":"57","author":"JFC Kingman","year":"1961","unstructured":"Kingman, J.F.C.: The single server queue in heavy traffic. Math. Proc. Camb. Philos. Soc. 57(4), 902\u2013904 (1961)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"3139_CR23","unstructured":"Liu, A., Bai, Z., Liu, Z., Li, X., Kim, C., Braverman, V., Jin, X., Stoica, I.: Distcache: provable load balancing for large-scale storage systems with distributed caching. In: 17th $\\{$USENIX$\\}$ Conference on File and Storage Technologies ($\\{$FAST$\\}$ 19), pp. 143\u2013157 (2019)"},{"issue":"11","key":"3139_CR24","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1016\/j.peva.2011.07.015","volume":"68","author":"Y Lu","year":"2011","unstructured":"Lu, Y., Xie, Q., Kliot, G., Geller, A., Larus, J.R., Greenberg, A.: Join-Idle-Queue: a novel load balancing algorithm for dynamically scalable web services. Perform. Eval. 68(11), 1056\u20131071 (2011)","journal-title":"Perform. Eval."},{"issue":"3","key":"3139_CR25","first-page":"2038","volume":"15","author":"JM Luczak","year":"2005","unstructured":"Luczak, J.M., Norris, J.: Strong approximation for the supermarket model. Ann. Appl. Probab. 15(3), 2038\u20132061 (2005)","journal-title":"Ann. Appl. Probab."},{"issue":"1","key":"3139_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1080\/15427951.2007.10129136","volume":"4","author":"S Lumetta","year":"2009","unstructured":"Lumetta, S., Mitzenmacher, M.: Using the power of two choices to improve bloom filters. Internet Math. 4(1), 17\u201333 (2009)","journal-title":"Internet Math."},{"key":"3139_CR27","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne Twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8, 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"issue":"4","key":"3139_CR28","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1773394.1773400","volume":"37","author":"AK Mishra","year":"2009","unstructured":"Mishra, A.K., Hellerstein, J.L., Crime, W., Das, C.R.: Towards characterizing cloud backend workloads: insights from Google compute clusters. ACM SIGMETRICS Perform. Eval. Rev. 37(4), 34\u201341 (2009)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"issue":"10","key":"3139_CR29","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/71.963420","volume":"12","author":"M Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M.: The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst. 12(10), 1094\u20131104 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3139_CR30","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-1-4615-0013-1_9","volume-title":"Handbook of Randomized Computing","author":"M Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M., Richa, A., Sitaraman, R.: The power of two random choices: a survey of techniques and results. In: Pardalos, P., Rajasekaran, S., Rolim, J. (eds.) Handbook of Randomized Computing, vol. 1, pp. 255\u2013312. Springer, New York (2001)"},{"key":"3139_CR31","doi-asserted-by":"crossref","unstructured":"Nasir, M.A.U., Morales, G.F., Garcia-Soriano, D., Kourtellis, N.: The power of both choices: practical load balancing for distributed stream processing engines. In: Proceedings of the 31st International Conference on Data Engineering, ICDE2015, April 2015, Korea","DOI":"10.1109\/ICDE.2015.7113279"},{"key":"3139_CR32","doi-asserted-by":"crossref","unstructured":"Quian, A., Gao, Y., Ji, M., Peng, H., Jin, Y., Lu, S.: Scheduling, workload-aware, for data analytics upon heterogeneous storage. In: 2009 IEEE International Conference on Parallel and Distributed Processing with Applications, Big Data and Cloud Computing, Sustainable Computing and Communications, Social Computing and Networking (ISPA\/BDCloud\/SocialCom\/SustainCom), pp. 580\u2013587. IEEE (2019)","DOI":"10.1109\/ISPA-BDCloud-SustainCom-SocialCom48970.2019.00088"},{"key":"3139_CR33","unstructured":"Reiss, C., Wilkes, J., Joseph, L.: Google Cluster Usage: Format + Schema, Technical Report. Google, Inc., Mountain View (2011). Revised 2012. http:\/\/code.google.com\/p\/googleclusterdata\/wiki\/TraceVersion2"},{"key":"3139_CR34","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/B:CLUS.0000018564.05723.a2","volume":"7","author":"B Schroeder","year":"2004","unstructured":"Schroeder, B., Harchol-Balter, M.: Evaluation of task assignment policies for supercomputing servers: the case for load unbalancing and fairness. Clust. Comput. 7, 151\u2013161 (2004)","journal-title":"Clust. Comput."},{"key":"3139_CR35","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2020.2968444","author":"V Sosa-Sosa","year":"2020","unstructured":"Sosa-Sosa, V., Barron, A., Gonzalez, J.L., Carretero, J.: Improving performance and capacity utilization in cloud storage for content delivery and sharing services. IEEE Trans. Cloud Comput. (2020). https:\/\/doi.org\/10.1109\/TCC.2020.2968444","journal-title":"IEEE Trans. Cloud Comput."},{"key":"3139_CR36","doi-asserted-by":"crossref","unstructured":"Stavrinides, G.L., Karatza, H.D.: Task group scheduling in distributed systems. In: 2018 International Conference on Computer, Information and Telecommunication Systems (CITS), pp. 1\u20135. IEEE","DOI":"10.1109\/CITS.2018.8440181"},{"key":"3139_CR37","unstructured":"The Spark Project, Lightning-Fast Cluster Computing. http:\/\/spark.apache.org (2019)"},{"key":"3139_CR38","doi-asserted-by":"publisher","first-page":"406","DOI":"10.2307\/3213411","volume":"15","author":"RW Weber","year":"1978","unstructured":"Weber, R.W.: On optimal assignment of customers to parallel servers. J. Appl. Probab. 15, 406\u2013413 (1978)","journal-title":"J. Appl. Probab."},{"key":"3139_CR39","unstructured":"Venkataraman, S., Panda, A., Ananthanarayanan, G., Franklin, M.J., Sotica, I.: The power of choice in data-aware cluster scheduling. In: Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation, pp. 301\u2013316. USENIX Association (2014)"},{"issue":"1","key":"3139_CR40","first-page":"20","volume":"32","author":"ND Vvedenskaya","year":"1996","unstructured":"Vvedenskaya, N.D., Dobrushin, R.L., Karpelevich, F.I.: Queueing system with selection of the shortest of two queues: an asymptotic approach. Probl. Pereda. Inf. 32(1), 20\u201334 (1996)","journal-title":"Probl. Pereda. Inf."},{"key":"3139_CR41","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."},{"key":"3139_CR42","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2943473","author":"S Wu","year":"2019","unstructured":"Wu, S., Chen, H., Jin, H., Ibrahim, S.: Shadow: exploiting the power of choice for efficient shuffling in MapReduce. IEEE Trans. Big Data (2019). https:\/\/doi.org\/10.1109\/TBDATA.2019.2943473","journal-title":"IEEE Trans. Big Data"},{"key":"3139_CR43","doi-asserted-by":"crossref","unstructured":"Xu, J., Hajek, B.: The supermarket fame. In: 2012 IEEE International Symposium on Information Theory, pp. 2511\u20132515 (2012)","DOI":"10.1109\/ISIT.2012.6283969"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-020-03139-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-020-03139-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-020-03139-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T19:40:48Z","timestamp":1624304448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-020-03139-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["3139"],"URL":"https:\/\/doi.org\/10.1007\/s10586-020-03139-6","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}