2011
DOI: 10.1016/j.peva.2011.07.015
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
282
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 318 publications
(296 citation statements)
references
References 9 publications
4
282
0
Order By: Relevance
“…Join Idle Queue: Join Idle Queue load balancing algorithm [14] is applied for dynamically scalable web services. This technique involves a dispatcher to whom processors informs at the time of their idleness, without interfering with job arrivals.…”
Section: Existing Load Balancing Algorithms In Cloudcomputingmentioning
confidence: 99%
“…Join Idle Queue: Join Idle Queue load balancing algorithm [14] is applied for dynamically scalable web services. This technique involves a dispatcher to whom processors informs at the time of their idleness, without interfering with job arrivals.…”
Section: Existing Load Balancing Algorithms In Cloudcomputingmentioning
confidence: 99%
“…This algorithm uses a queue based memory in which information about the idle processor is kept and if an availability request comes idle process is allotted and it reduces queue length [17] …”
Section: Platform Used-cloud Data Centermentioning
confidence: 99%
“…Often load-balancing policies consider web server systems as a target [11,26], where one of the most important result is to bound the maximum response time that the clients are exposed to [19]. Load-balancing strategies can be guided by many different purposes, for example geographical [2,33], driven by the electricity price to reduce the datacenter operation cost [15], or specifically designed for cloud applications [5,23,24].…”
Section: Related Workmentioning
confidence: 99%
“…Despite the fact that load-balancing techniques have been widely studied [5,23,24,29], state-of-the-art load-balancers forward requests based on metrics that cannot discriminate between a replica that is avoiding overload by not executing the optional code and a replica that is not subject to overload. Therefore, the novelty of our problem consists in finding a brownout-compliant load-balancing technique that is aware of each replica's self-adaptation mechanism.…”
Section: Introductionmentioning
confidence: 99%