메뉴 건너뛰기




Volumn 68, Issue 11, 2011, Pages 1056-1071

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

Author keywords

Cloud computing; Load balancing; Queueing analysis; Randomized algorithm

Indexed keywords

COMMUNICATION OVERHEADS; DISTRIBUTED DESIGN; DISTRIBUTED LOAD BALANCING; FRONT END; HIGH LOAD; HORIZONTAL SCALING; JOIN-THE-SHORTEST-QUEUE; LARGE SYSTEM; LOAD BALANCER; LOAD BALANCING ALGORITHMS; LOAD-BALANCING; LOCAL INFORMATION; POWER-OF-TWO; QUEUEING ANALYSIS; RANDOMIZED ALGORITHMS; REDUCED SYSTEMS; SCALABLE WEB SERVICES; SERVER LOADS;

EID: 80053383179     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2011.07.015     Document Type: Conference Paper
Times cited : (316)

References (16)
  • 2
    • 84912029269 scopus 로고    scopus 로고
    • Load balancing 101: Nuts and bolts
    • F5 Networks, Inc.
    • K. Salchow, Load balancing 101: nuts and bolts, White Paper, F5 Networks, Inc., 2007.
    • (2007) White Paper
    • Salchow, K.1
  • 3
    • 34548130717 scopus 로고    scopus 로고
    • Analysis of join-the-shortest-queue routing for web server farms
    • DOI 10.1016/j.peva.2007.06.012, PII S0166531607000624
    • V. Gupta, M. Harchol-Balter, K. Sigman, and W. Whitt Analysis of join-the-shortest-queue routing for web server farms Perform. Eval. 64 2007 1062 1081 (Pubitemid 47302130)
    • (2007) Performance Evaluation , vol.64 , Issue.9-12 , pp. 1062-1081
    • Gupta, V.1    Harchol Balter, M.2    Sigman, K.3    Whitt, W.4
  • 5
    • 0029695556 scopus 로고    scopus 로고
    • Queueing system with selection of the shortest of two queues: An asymptotic approach
    • N.D. Vvedenskaya, R.L. Dobrushin, and F.I. Karpelevich Queueing system with selection of the shortest of two queues: an asymptotic approach Probl. Inf. Transm. 32 1 1996 20 34
    • (1996) Probl. Inf. Transm. , vol.32 , Issue.1 , pp. 20-34
    • Vvedenskaya, N.D.1    Dobrushin, R.L.2    Karpelevich, F.I.3
  • 7
    • 79960194299 scopus 로고    scopus 로고
    • Randomized load balancing with general service time distributions
    • M. Bramson, Y. Lu, B. Prabhakar, Randomized load balancing with general service time distributions, in: ACM Sigmetrics, 2010.
    • (2010) ACM Sigmetrics
    • Bramson, M.1    Lu, Y.2    Prabhakar, B.3
  • 8
    • 0034341983 scopus 로고    scopus 로고
    • Chaoticity on path space for a queueing network with selection of the shortest queue among several
    • C. Graham Chaoticity on path space for a queueing network with selection of the shortest queue among several J. Appl. Probab. 37 2000 198 211
    • (2000) J. Appl. Probab. , vol.37 , pp. 198-211
    • Graham, C.1
  • 9
    • 33745033128 scopus 로고    scopus 로고
    • On the maximum queue length in the supermarket model
    • DOI 10.1214/00911790500000710
    • M. Luczak, and C. McDiarmid On the maximum queue length in the supermarket model Ann. Probab. 34 2 2006 493 527 (Pubitemid 43875115)
    • (2006) Annals of Probability , vol.34 , Issue.2 , pp. 493-527
    • Luczak, M.J.1    Mcdiarmid, C.2
  • 14
    • 0022028304 scopus 로고
    • Load sharing in distributed systems
    • Y.-T. Wang, and R. Morris Load sharing in distributed systems IEEE Trans. Comput. C-34 3 1985
    • (1985) IEEE Trans. Comput. , vol.C-34 , Issue.3
    • Wang, Y.-T.1    Morris, R.2
  • 16
    • 0031383380 scopus 로고    scopus 로고
    • Self-similarity in world wide web traffic: Evidence and possible causes
    • PII S1063669297087827
    • M. Crovella, and A. Bestavros Self-similarity in world wide web traffic: evidence and possible causes IEEE/ACM Trans. Netw. 5 6 1997 835 846 (Pubitemid 127768491)
    • (1997) IEEE/ACM Transactions on Networking , vol.5 , Issue.6 , pp. 835-846
    • Crovella, M.E.1    Bestavros, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.