Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,498,992 papers from all fields of science
Search
Sign In
Create Free Account
Load balancing (computing)
Known as:
Ip sprayer
, GSLB
, Component Load Balancing
Expand
In computing, load balancing improves the distribution of workloads across multiple computing resources, such as computers, a computer cluster…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ActiveReports
Apache Geronimo
Autoscaling
Channel bonding
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
A novel delay-aware routing algorithm (DARA) for a hybrid wireless-optical broadband access network (WOBAN)
S. Sarkar
,
Hong-Hsu Yen
,
S. Dixit
,
B. Mukherjee
IEEE Network
2008
Corpus ID: 17303198
A hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future access networks. Recently, the…
Expand
Highly Cited
2006
Highly Cited
2006
Load Balancing in a Cluster Computer
P. Werstein
,
Hailing Situ
,
Zhiyi Huang
International Conference on Parallel and…
2006
Corpus ID: 16349131
This paper proposes a load balancing algorithm for distributed use of a cluster computer. It uses load information including CPU…
Expand
Highly Cited
2005
Highly Cited
2005
On the Suitability of Load Balancing Principles in Heterogeneous Wireless Access Networks
X. Gelabert
,
J. Pérez-Romero
,
O. Sallent
,
R. Agustí
2005
Corpus ID: 8748076
Initial RAT selection is a key Common RRM strategy, where users requiring service are to be efficiently allocated in the existing…
Expand
2005
2005
Attribute-based clustering for information dissemination in wireless sensor networks
W. Ke
,
S. A. Ayyash
,
T. Little
,
P. Basu
Second Annual IEEE Communications Society…
2005
Corpus ID: 797221
Data routing in large wireless sensor networks is challenged by requirements for scalability, robustness, and energy use, as well…
Expand
Highly Cited
2002
Highly Cited
2002
A load management system for running HLA-based distributed simulations over the grid
Wentong Cai
,
S. Turner
,
Hanfeng Zhao
Proceedings. Sixth IEEE International Workshop on…
2002
Corpus ID: 27234285
Running a large-scale distributed simulation may need a large amount of computing resources at geographically different locations…
Expand
Highly Cited
2001
Highly Cited
2001
Overlay Networks A Scalable Alternative for P 2
2001
Corpus ID: 10573364
P eer-to-peer systems are distributed systems that operate without centralized organization or control. To find a particular…
Expand
Highly Cited
2001
Highly Cited
2001
Proxy servers for scalable interactive video support
H. Fabmi
,
M. Latif
,
S. Sedigh-Ali
,
A. Ghafoor
,
Ping Liu
,
L. Hsu
2001
Corpus ID: 8269565
Targeting scalability, load balance and resource efficiency in streaming multimedia applications, proxy servers facilitate faster…
Expand
Highly Cited
1998
Highly Cited
1998
Reasoning about Action Systems using the B-Method
M. Waldén
,
K. Sere
Formal Methods Syst. Des.
1998
Corpus ID: 5355322
The action system formalism has been succesfully used when constructing parallel and distributed systems in a stepwise manner…
Expand
Highly Cited
1997
Highly Cited
1997
Disk striping strategies for large video-on-demand servers
Tat-Seng Chua
,
Jiandong Li
,
B. Ooi
,
K. Tan
MULTIMEDIA '96
1997
Corpus ID: 16099978
The storage structure of videos on disks affects the number of concurrent users a videoon-demand system can support and hence the…
Expand
Highly Cited
1988
Highly Cited
1988
Process and dataflow control in distributed data-intensive systems
W. Alexander
,
G. Copeland
ACM SIGMOD Conference
1988
Corpus ID: 17683665
In dataflow architectures, each dataflow operation is typically executed on a single physical node. We are concerned with…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE