Load balancing (computing)

Known as: Ip sprayer, Gslb, Component Load Balancing 
In computing, load balancing improves the distribution of workloads across multiple computing resources, such as computers, a computer cluster… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Energy expenditure has become a significant fraction of data center operating costs. Recently, "geographical load balancing" has… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Today’s data centers host online services on multiple servers, with a front-end load balancer directing each client request to a… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The traffic load of wireless LANs is often unevenly distributed among the access points (APs), which results in unfair bandwidth… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Dynamic load balancing is a popular recent technique that protects ISP networks from sudden congestion caused by load spikes or… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Load balancing is a critical issue for the efficient operation of peer-to-peer (P2P) networks. We give two new load-balancing… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Most P2P systems that provide a DHT abstraction distribute objects randomly among "peer nodes" in a way that results in some… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Most P2P systems that provide a DHT abstraction distribute objects among “peer nodes” by choosing random identifiers for the… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In this paper we address power conservation for clusters of workstations or PCs, such as those that support a large number of… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
ÐWe consider the following natural model: Customers arrive as a Poisson stream of rate n, < 1, at a collection of n servers. Each… (More)
  • figure 1
  • table 2
  • table 1
  • figure 2
  • table 3
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In this paper we study diffusion schemes for dynamic load balancing on message passing multiprocessor networks. One of the main… (More)
  • table I
  • table II
Is this relevant?