Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services

The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly wide web-facing front end. Horizontal scaling in the Cloud is favored for its elasticity, and distributed design of load balancers is highly desirable. Existing algorithm...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Performance evaluation Ročník 68; číslo 11; s. 1056 - 1071
Hlavní autoři:	Lu, Yi, Xie, Qiaomin, Kliot, Gabriel, Geller, Alan, Larus, James R., Greenberg, Albert
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.11.2011
Témata:	Algorithms Cloud computing Clouds Design engineering Load balancing Load balancing (computing) Queueing analysis Randomized algorithm Searching Servers Web services Cloud computing Load balancing Randomized algorithm Queueing analysis
ISSN:	0166-5316, 1872-745X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly wide web-facing front end. Horizontal scaling in the Cloud is favored for its elasticity, and distributed design of load balancers is highly desirable. Existing algorithms with a centralized design, such as Join-the-Shortest-Queue ( JSQ), incur high communication overhead for distributed dispatchers. We propose a novel class of algorithms called Join-Idle-Queue ( JIQ) for distributed load balancing in large systems. Unlike algorithms such as Power-of-Two, the JIQ algorithm incurs no communication overhead between the dispatchers and processors at job arrivals. We analyze the JIQ algorithm in the large system limit and find that it effectively results in a reduced system load, which produces 30-fold reduction in queueing overhead compared to Power-of-Two at medium to high load. An extension of the basic JIQ algorithm deals with very high loads using only local information of server load.
AbstractList	The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly wide web-facing front end. Horizontal scaling in the Cloud is favored for its elasticity, and distributed design of load balancers is highly desirable. Existing algorithms with a centralized design, such as Join-the-Shortest-Queue (JSQ), incur high communication overhead for distributed dispatchers. We propose a novel class of algorithms called Join-Idle-Queue (JIQ) for distributed load balancing in large systems. Unlike algorithms such as Power-of-Two, the JIQ algorithm incurs no communication overhead between the dispatchers and processors at job arrivals. We analyze the JIQ algorithm in the large system limit and find that it effectively results in a reduced system load, which produces 30-fold reduction in queueing overhead compared to Power-of-Two at medium to high load. An extension of the basic JIQ algorithm deals with very high loads using only local information of server load. The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly wide web-facing front end. Horizontal scaling in the Cloud is favored for its elasticity, and distributed design of load balancers is highly desirable. Existing algorithms with a centralized design, such as Join-the-Shortest-Queue ( JSQ), incur high communication overhead for distributed dispatchers. We propose a novel class of algorithms called Join-Idle-Queue ( JIQ) for distributed load balancing in large systems. Unlike algorithms such as Power-of-Two, the JIQ algorithm incurs no communication overhead between the dispatchers and processors at job arrivals. We analyze the JIQ algorithm in the large system limit and find that it effectively results in a reduced system load, which produces 30-fold reduction in queueing overhead compared to Power-of-Two at medium to high load. An extension of the basic JIQ algorithm deals with very high loads using only local information of server load.
Author	Larus, James R. Lu, Yi Greenberg, Albert Geller, Alan Xie, Qiaomin Kliot, Gabriel
Author_xml	– sequence: 1 givenname: Yi surname: Lu fullname: Lu, Yi email: yilu4@illinois.edu organization: Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, United States – sequence: 2 givenname: Qiaomin surname: Xie fullname: Xie, Qiaomin organization: Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, United States – sequence: 3 givenname: Gabriel surname: Kliot fullname: Kliot, Gabriel organization: Extreme Computing Group, Microsoft Research, United States – sequence: 4 givenname: Alan surname: Geller fullname: Geller, Alan organization: Extreme Computing Group, Microsoft Research, United States – sequence: 5 givenname: James R. surname: Larus fullname: Larus, James R. organization: Extreme Computing Group, Microsoft Research, United States – sequence: 6 givenname: Albert surname: Greenberg fullname: Greenberg, Albert organization: Microsoft Azure, United States
BookMark	eNp9kD1PwzAURS0EEqXwB5i8MSXYTmIniKWq-CiqhJBAsFm281JcuXax06L-e1KViYHpLvdcvXfO0LEPHhC6pCSnhPLrZb6GrcoZoTQnIie0OkIjWguWibL6OEajocSzqqD8FJ2ltCSEVKIgI_T-FKzPZq2D7GUDG7jBE-zDFhx2QbVYK6e8sX6BlVuEaPvPFe5CxO3Oq5U1yrkdTkMo7QB_g8YJ4tYaSOfopFMuwcVvjtHb_d3r9DGbPz_MppN5ZgrB-6wSTBWtaYqy1LxiNdGk7qjptFBM8VrzgkHTaQ6mI40qKWdaNKXgUJWaNWVXjNHVYXcdw9cGUi9XNhlww9kQNkk2bJgQJS2GJjs0TQwpRejkOtqVijtJidxLlEu5lyj3EiURcpA4QPUfyNhe9Tb4Pirr_kdvDygM728tRJmMBW-gtRFML9tg_8N_AA3dj6k
CitedBy_id	crossref_primary_10_1016_j_jcss_2016_10_009 crossref_primary_10_1017_jpr_2016_68 crossref_primary_10_1007_s11277_014_2005_7 crossref_primary_10_1287_moor_2023_0050 crossref_primary_10_1016_j_comnet_2020_107507 crossref_primary_10_1145_3712170_3712174 crossref_primary_10_4018_IJGHPC_301587 crossref_primary_10_1145_2964791_2901478 crossref_primary_10_1145_3447385 crossref_primary_10_1007_s10586_020_03139_6 crossref_primary_10_1016_j_orl_2020_04_006 crossref_primary_10_1109_TNET_2019_2902531 crossref_primary_10_1108_IJPCC_02_2021_0038 crossref_primary_10_1145_3152042_3152058 crossref_primary_10_1007_s11134_019_09603_4 crossref_primary_10_1145_3366698 crossref_primary_10_1109_TNET_2013_2276427 crossref_primary_10_1017_jpr_2017_49 crossref_primary_10_1109_TNET_2013_2270445 crossref_primary_10_1016_j_peva_2018_09_005 crossref_primary_10_1145_3453953_3453965 crossref_primary_10_1016_j_peva_2024_102463 crossref_primary_10_1007_s00446_022_00437_7 crossref_primary_10_1109_TNSM_2020_3045059 crossref_primary_10_1016_j_jnca_2016_06_003 crossref_primary_10_1109_LNET_2024_3496842 crossref_primary_10_1109_TNET_2019_2939040 crossref_primary_10_1145_3305218_3305225 crossref_primary_10_1287_ijoc_2021_1100 crossref_primary_10_1109_TCC_2017_2648785 crossref_primary_10_1109_ACCESS_2016_2631490 crossref_primary_10_1016_j_peva_2017_04_005 crossref_primary_10_1016_j_peva_2017_04_004 crossref_primary_10_1109_ACCESS_2019_2944420 crossref_primary_10_1109_TNET_2022_3220931 crossref_primary_10_1109_TNSE_2018_2878403 crossref_primary_10_1007_s11277_024_11479_4 crossref_primary_10_1007_s11134_020_09684_6 crossref_primary_10_1016_j_peva_2021_102209 crossref_primary_10_1145_2964791_2901454 crossref_primary_10_1016_j_peva_2018_09_010 crossref_primary_10_1145_3639040 crossref_primary_10_1049_iet_com_2019_0800 crossref_primary_10_1007_s10922_014_9307_7 crossref_primary_10_1016_j_compeleceng_2018_07_018 crossref_primary_10_1287_opre_2021_2125 crossref_primary_10_1137_23M1552231 crossref_primary_10_1109_TNET_2021_3105480 crossref_primary_10_1080_15326349_2023_2250418 crossref_primary_10_1145_3374888_3374894 crossref_primary_10_1002_cpe_4368 crossref_primary_10_1007_s11134_020_09669_5 crossref_primary_10_26634_jcc_7_1_17156 crossref_primary_10_1016_j_peva_2023_102381 crossref_primary_10_1109_TNET_2024_3368130 crossref_primary_10_1007_s11134_022_09736_z crossref_primary_10_1145_3322205_3311075 crossref_primary_10_1016_j_conengprac_2016_03_020 crossref_primary_10_1145_2964791_2901463 crossref_primary_10_1137_20M1323746 crossref_primary_10_1214_19_AAP1519 crossref_primary_10_1016_j_peva_2021_102217 crossref_primary_10_1287_moor_2021_0212 crossref_primary_10_1007_s10479_022_04532_7 crossref_primary_10_1109_TNET_2018_2851379 crossref_primary_10_1109_TNET_2020_2978195 crossref_primary_10_1145_3084454 crossref_primary_10_1155_2021_6650053 crossref_primary_10_1016_j_peva_2020_102151 crossref_primary_10_1007_s11227_019_02801_0 crossref_primary_10_1214_24_AAP2090 crossref_primary_10_1109_TNET_2018_2869092 crossref_primary_10_1109_TPDS_2019_2950621 crossref_primary_10_1287_opre_2019_1940 crossref_primary_10_1145_3154499 crossref_primary_10_1007_s10586_020_03108_z crossref_primary_10_1016_j_peva_2024_102396 crossref_primary_10_1109_TCNS_2015_2428331 crossref_primary_10_1109_TNET_2017_2744607 crossref_primary_10_1145_3154498 crossref_primary_10_1007_s11134_019_09605_2 crossref_primary_10_1155_2014_959782 crossref_primary_10_1080_24751839_2017_1356159 crossref_primary_10_1007_s11134_023_09897_5 crossref_primary_10_1002_nav_21986 crossref_primary_10_1145_3084463 crossref_primary_10_1145_3199524_3199528 crossref_primary_10_1145_3199524_3199529 crossref_primary_10_1016_j_peva_2014_07_019 crossref_primary_10_1016_j_proeng_2012_06_261 crossref_primary_10_1016_j_peva_2024_102427 crossref_primary_10_1109_TPDS_2019_2920121 crossref_primary_10_1145_3366705 crossref_primary_10_1016_j_peva_2020_102147 crossref_primary_10_1016_j_peva_2020_102146 crossref_primary_10_32628_IJSRST24114336 crossref_primary_10_1186_s13677_019_0142_y crossref_primary_10_1007_s11036_017_0840_y crossref_primary_10_1016_j_jnca_2017_08_020 crossref_primary_10_1145_3543516_3456279 crossref_primary_10_1017_jpr_2020_13 crossref_primary_10_1145_3179424 crossref_primary_10_1007_s11134_017_9559_5 crossref_primary_10_1007_s11134_019_09633_y crossref_primary_10_1145_3308897_3308924 crossref_primary_10_1145_3649477_3649496 crossref_primary_10_1145_3428327 crossref_primary_10_1016_j_peva_2021_102259 crossref_primary_10_1145_3376930_3376935 crossref_primary_10_1109_TNET_2021_3110186 crossref_primary_10_1287_moor_2021_1191 crossref_primary_10_3390_s22062404 crossref_primary_10_1007_s10479_014_1747_7 crossref_primary_10_1016_j_jnca_2017_04_007 crossref_primary_10_1016_j_comcom_2019_05_007 crossref_primary_10_1145_3287323 crossref_primary_10_1287_opre_2022_0359 crossref_primary_10_1287_stsy_2023_0054 crossref_primary_10_1016_j_peva_2024_102408 crossref_primary_10_1287_opre_2018_1768 crossref_primary_10_1145_3625386 crossref_primary_10_1016_j_peva_2022_102320 crossref_primary_10_1109_TPDS_2015_2400456 crossref_primary_10_1287_opre_2019_1976 crossref_primary_10_1016_j_peva_2021_102260 crossref_primary_10_4018_IJISMD_2020010102 crossref_primary_10_1109_TNET_2020_2980061 crossref_primary_10_1145_3428330 crossref_primary_10_1145_3379468 crossref_primary_10_1007_s11518_018_5399_z crossref_primary_10_1145_3341617_3326150 crossref_primary_10_1007_s11134_024_09918_x crossref_primary_10_1007_s11277_024_11311_z crossref_primary_10_1007_s11134_022_09847_7 crossref_primary_10_1016_j_cor_2019_05_022 crossref_primary_10_1145_3159172
Cites_doi	10.1109/SFCS.1994.365680 10.1145/277651.277687 10.1145/1654059.1654113 10.1239/jap/1014842277 10.1145/107972.107987 10.1016/j.peva.2007.06.012 10.1109/TSE.1986.6312961 10.1145/1811039.1811071 10.1109/90.650143 10.1214/00911790500000710
ContentType	Journal Article
Copyright	2011
Copyright_xml	– notice: 2011
DBID	AAYXX CITATION 7TA 8FD JG9
DOI	10.1016/j.peva.2011.07.015
DatabaseName	CrossRef Materials Business File Technology Research Database Materials Research Database
DatabaseTitle	CrossRef Materials Research Database Technology Research Database Materials Business File
DatabaseTitleList	Materials Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1872-745X
EndPage	1071
ExternalDocumentID	10_1016_j_peva_2011_07_015 S0166531611001064
GroupedDBID	--K --M -~X .DC .~1 0R~ 123 1B1 1~. 1~5 29O 4.4 457 4G. 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABJNI ABMAC ABTAH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADEZE ADGUI ADJOM ADMUD AEBSH AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HLZ HVGLF HX~ HZ~ IHE J1W KOM LG9 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TN5 WUQ ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7TA 8FD JG9
ID	FETCH-LOGICAL-c376t-572a3dc9344b65280b08f1cfb7a2a68b632e9fb6ecf09a4162b79476e54b294f3
ISICitedReferencesCount	202
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000296543000006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0166-5316
IngestDate	Sun Sep 28 00:03:51 EDT 2025 Sat Nov 29 08:13:15 EST 2025 Tue Nov 18 22:33:25 EST 2025 Fri Feb 23 02:31:01 EST 2024
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	11
Keywords	Cloud computing Load balancing Randomized algorithm Queueing analysis
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c376t-572a3dc9344b65280b08f1cfb7a2a68b632e9fb6ecf09a4162b79476e54b294f3
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
OpenAccessLink	http://infoscience.epfl.ch/record/192818
PQID	926327413
PQPubID	23500
PageCount	16
ParticipantIDs	proquest_miscellaneous_926327413 crossref_primary_10_1016_j_peva_2011_07_015 crossref_citationtrail_10_1016_j_peva_2011_07_015 elsevier_sciencedirect_doi_10_1016_j_peva_2011_07_015
PublicationCentury	2000
PublicationDate	2011-11-01
PublicationDateYYYYMMDD	2011-11-01
PublicationDate_xml	– month: 11 year: 2011 text: 2011-11-01 day: 01
PublicationDecade	2010
PublicationTitle	Performance evaluation
PublicationYear	2011
Publisher	Elsevier B.V
Publisher_xml	– name: Elsevier B.V
References	M.S. Squillante, R.D. Nelson, Analysis of task migration in shared-memory multiprocessor scheduling, in: Proc. ACM Conference on the Measurement and Modeling of Computer Systems, 1991, pp. 143–155. N. Ahmad, A.G. Greenberg, P. Lahiri, D. Maltz, P.K. Patel, S. Sengupta, K.V. Vaid, Distributed load balancer, Google Patents, August 2008. US Patent App. 12/189, 438. Gupta, Harchol-Balter, Sigman, Whitt (br000015) 2007 K. Salchow, Load balancing 101: nuts and bolts, White Paper, F5 Networks, Inc., 2007. R.D. Blumofe, C.E. Leiserson, Scheduling multithreaded computations by work stealing, in: Proc. 35th IEEE Conference on Foundations of Computer Science, 1994, pp. 356–368. E. Schurman, J. Brutlag, The user and business impact of server delays, additional bytes and HTTP chunking in web search, in: O’Reilly Velocity Web Performance and Operations Conference, June 23rd 2009. M. Mitzenmacher, The power of two choices in randomized load balancing, Ph.D. Thesis, Berkeley, 1996. Crovella, Bestavros (br000080) 1997; 5 Vvedenskaya, Dobrushin, Karpelevich (br000025) 1996; 32 M. Bramson, Y. Lu, B. Prabhakar, Randomized load balancing with general service time distributions, in: ACM Sigmetrics, 2010. M. Mitzenmacher, Analyses of load stealing models based on differential equations, in: Proc. 10th ACM Symposium on Parallel Algorithms and Architetures, 1998, pp. 212–221. Luczak, McDiarmid (br000045) 2006; 34 Graham (br000040) 2000; 37 J. Dinan, D.B. Larkins, P. Sadayappan, S. Krishnamoorthy, J. Nieplocha, Scalable work stealing, in: Proc. ACM Conf. on High Performance Computing Networking, Storage and Analysis, 2009. Eager, Lazowska, Zahorjan (br000075) 1986; SE-12 Wang, Morris (br000070) 1985; C-34 Gupta (10.1016/j.peva.2011.07.015_br000015) 2007 10.1016/j.peva.2011.07.015_br000030 Eager (10.1016/j.peva.2011.07.015_br000075) 1986; SE-12 Graham (10.1016/j.peva.2011.07.015_br000040) 2000; 37 10.1016/j.peva.2011.07.015_br000010 10.1016/j.peva.2011.07.015_br000065 10.1016/j.peva.2011.07.015_br000020 10.1016/j.peva.2011.07.015_br000050 10.1016/j.peva.2011.07.015_br000060 10.1016/j.peva.2011.07.015_br000005 Wang (10.1016/j.peva.2011.07.015_br000070) 1985; C-34 10.1016/j.peva.2011.07.015_br000055 Crovella (10.1016/j.peva.2011.07.015_br000080) 1997; 5 10.1016/j.peva.2011.07.015_br000035 Luczak (10.1016/j.peva.2011.07.015_br000045) 2006; 34 Vvedenskaya (10.1016/j.peva.2011.07.015_br000025) 1996; 32
References_xml	– reference: N. Ahmad, A.G. Greenberg, P. Lahiri, D. Maltz, P.K. Patel, S. Sengupta, K.V. Vaid, Distributed load balancer, Google Patents, August 2008. US Patent App. 12/189, 438. – reference: M.S. Squillante, R.D. Nelson, Analysis of task migration in shared-memory multiprocessor scheduling, in: Proc. ACM Conference on the Measurement and Modeling of Computer Systems, 1991, pp. 143–155. – start-page: 1062 year: 2007 end-page: 1081 ident: br000015 article-title: Analysis of join-the-shortest-queue routing for web server farms publication-title: Perform. Eval. – reference: J. Dinan, D.B. Larkins, P. Sadayappan, S. Krishnamoorthy, J. Nieplocha, Scalable work stealing, in: Proc. ACM Conf. on High Performance Computing Networking, Storage and Analysis, 2009. – reference: M. Mitzenmacher, The power of two choices in randomized load balancing, Ph.D. Thesis, Berkeley, 1996. – volume: SE-12 year: 1986 ident: br000075 article-title: Adaptive load sharing in homogeneous distributed systems publication-title: IEEE Trans. Softw. Eng. – reference: K. Salchow, Load balancing 101: nuts and bolts, White Paper, F5 Networks, Inc., 2007. – volume: 32 start-page: 20 year: 1996 end-page: 34 ident: br000025 article-title: Queueing system with selection of the shortest of two queues: an asymptotic approach publication-title: Probl. Inf. Transm. – reference: R.D. Blumofe, C.E. Leiserson, Scheduling multithreaded computations by work stealing, in: Proc. 35th IEEE Conference on Foundations of Computer Science, 1994, pp. 356–368. – reference: M. Mitzenmacher, Analyses of load stealing models based on differential equations, in: Proc. 10th ACM Symposium on Parallel Algorithms and Architetures, 1998, pp. 212–221. – volume: 37 start-page: 198 year: 2000 end-page: 211 ident: br000040 article-title: Chaoticity on path space for a queueing network with selection of the shortest queue among several publication-title: J. Appl. Probab. – volume: C-34 year: 1985 ident: br000070 article-title: Load sharing in distributed systems publication-title: IEEE Trans. Comput. – reference: E. Schurman, J. Brutlag, The user and business impact of server delays, additional bytes and HTTP chunking in web search, in: O’Reilly Velocity Web Performance and Operations Conference, June 23rd 2009. – volume: 5 start-page: 835 year: 1997 end-page: 846 ident: br000080 article-title: Self-similarity in world wide web traffic: evidence and possible causes publication-title: IEEE/ACM Trans. Netw. – volume: 34 start-page: 493 year: 2006 end-page: 527 ident: br000045 article-title: On the maximum queue length in the supermarket model publication-title: Ann. Probab. – reference: M. Bramson, Y. Lu, B. Prabhakar, Randomized load balancing with general service time distributions, in: ACM Sigmetrics, 2010. – ident: 10.1016/j.peva.2011.07.015_br000005 – ident: 10.1016/j.peva.2011.07.015_br000030 – ident: 10.1016/j.peva.2011.07.015_br000055 doi: 10.1109/SFCS.1994.365680 – volume: 32 start-page: 20 issue: 1 year: 1996 ident: 10.1016/j.peva.2011.07.015_br000025 article-title: Queueing system with selection of the shortest of two queues: an asymptotic approach publication-title: Probl. Inf. Transm. – ident: 10.1016/j.peva.2011.07.015_br000060 doi: 10.1145/277651.277687 – ident: 10.1016/j.peva.2011.07.015_br000065 doi: 10.1145/1654059.1654113 – volume: 37 start-page: 198 year: 2000 ident: 10.1016/j.peva.2011.07.015_br000040 article-title: Chaoticity on path space for a queueing network with selection of the shortest queue among several publication-title: J. Appl. Probab. doi: 10.1239/jap/1014842277 – ident: 10.1016/j.peva.2011.07.015_br000050 doi: 10.1145/107972.107987 – ident: 10.1016/j.peva.2011.07.015_br000010 – start-page: 1062 issue: 64 year: 2007 ident: 10.1016/j.peva.2011.07.015_br000015 article-title: Analysis of join-the-shortest-queue routing for web server farms publication-title: Perform. Eval. doi: 10.1016/j.peva.2007.06.012 – volume: C-34 issue: 3 year: 1985 ident: 10.1016/j.peva.2011.07.015_br000070 article-title: Load sharing in distributed systems publication-title: IEEE Trans. Comput. – volume: SE-12 issue: 5 year: 1986 ident: 10.1016/j.peva.2011.07.015_br000075 article-title: Adaptive load sharing in homogeneous distributed systems publication-title: IEEE Trans. Softw. Eng. doi: 10.1109/TSE.1986.6312961 – ident: 10.1016/j.peva.2011.07.015_br000035 doi: 10.1145/1811039.1811071 – volume: 5 start-page: 835 issue: 6 year: 1997 ident: 10.1016/j.peva.2011.07.015_br000080 article-title: Self-similarity in world wide web traffic: evidence and possible causes publication-title: IEEE/ACM Trans. Netw. doi: 10.1109/90.650143 – ident: 10.1016/j.peva.2011.07.015_br000020 – volume: 34 start-page: 493 issue: 2 year: 2006 ident: 10.1016/j.peva.2011.07.015_br000045 article-title: On the maximum queue length in the supermarket model publication-title: Ann. Probab. doi: 10.1214/00911790500000710
SSID	ssj0005730
Score	2.4573169
Snippet	The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly wide web-facing front end.... The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly wide web-facing front end....
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1056
SubjectTerms	Algorithms Cloud computing Clouds Design engineering Load balancing Load balancing (computing) Queueing analysis Randomized algorithm Searching Servers Web services
Title	Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services
URI	https://dx.doi.org/10.1016/j.peva.2011.07.015 https://www.proquest.com/docview/926327413
Volume	68
WOSCitedRecordID	wos000296543000006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-745X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005730 issn: 0166-5316 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLeqjQMXvhHbAPnArcqU5sOOuVVowCY0bdKA3izbcSBTllRtU213_nCeHccNFZvYgUvaRI2V9P38_HvP7wOhd6bKmbVUTTWyIIlVakreFkFeEKEiCWaR3dH99oWenmazGTsbjX71uTDritZ1dn3N5v9V1HANhG1SZ-8hbj8oXIDvIHQ4gtjh-E-CP2nKOjjOKx2ct7p1qed1s9bVuGoE8E0TzKhsbmL1o1mUq59XNtYw73rTi6q6GS_hw-ZUmUzGpVMnQx57Nsg32BQM99E9rdXsZX8-6zZBzkvRXJWbbX8TLWL98kKCwe5DPT7pPj1xWjns5t7POvFuCeepJCSACU6GqpZkQ0hNBooTaB4ZLMJglE7-quA7X8Pl4RzezRVgpYdhlxH6ZzXtrVXOxx72YW2X3IzBzRg8pDw0lQp2I5oyUO-70-Oj2ckmVIjanjX-lVzyVRcnuP0ktxGcraXe8peLJ-iRMzzwtAPMUzTS9TP0uG_qgZ2Of46-b-HnPZ5iix5s0IM9erBHDwYk4AF6cI8eDOjBPXpeoK8fjy4-fA5c941AwaKzClIaiThXLE4SSdIoC2WYFRNVSCoiQTJJ4kizQhKtipAJ4PUws1lCiU4TGbGkiF-inbqp9SuElcqTlBGqU6qSPI4yFRmmKIhIJZNM7aFJ_5dx5UrTmw4pFb9dWHto7O-Zd4VZ7vx12kuCO2rZUUYOwLrzPtyLjYPeNZtpotZNu-TMNDoAOh7v3-tBDtDDzWx5jXZWi1a_QQ_UelUuF28d8H4DpiSklg
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Join-Idle-Queue%3A+A+novel+load+balancing+algorithm+for+dynamically+scalable+web+services&rft.jtitle=Performance+evaluation&rft.au=Lu%2C+Yi&rft.au=Xie%2C+Qiaomin&rft.au=Kliot%2C+Gabriel&rft.au=Geller%2C+Alan&rft.date=2011-11-01&rft.issn=0166-5316&rft.volume=68&rft.issue=11&rft.spage=1056&rft.epage=1071&rft_id=info:doi/10.1016%2Fj.peva.2011.07.015&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_peva_2011_07_015
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-5316&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-5316&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-5316&client=summon