Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Dynamic load balancing in RCAN content addressable network
Boukhelef D., Kitagawa H.  ICUIMC 2009 (Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, Suwon, Korea, Jan 15-16, 2009)98-106.2009.Type:Proceedings
Date Reviewed: Jul 13 2009

The peer-to-peer (P2P) diagram is gaining popularity in data sharing among large numbers of nodes. It can be viewed as a decentralized overlay network over the Internet. The basic idea is that every node in the network takes the same responsibility in locating, transferring, and storing shared data. There is no central authority--the nodes only keep information for a limited number of other nodes, typically their direct neighbors (logically, not necessarily physically). An obvious and important issue of the P2P diagram is how, in the absence of a central authority, to ensure the same responsibility ideal (at least roughly). In computer science language, this is how to ensure the load balance.

Based on other researchers’ efforts, Boukhelef and Kitagawa present some new ideas. Their study focuses on dynamically balancing the load in their previously proposed multi-ring content addressable network (RCAN). The basic idea of RCAN is to establish connections between distant nodes, besides the connections between neighbors. Like other P2P networks, RCAN has load balancing issues that need to be addressed. The main contribution of this paper is the proposal of three load sharing schemes that do not require a node to know any load information other than that of its neighbors. The authors provide simulation data to back their schemes. The simulations show that good load balancing is achievable.

One drawback of the paper is that it doesn’t clarify how long it might take, when using the proposed protocol, for heavily loaded nodes to unload their burden to lightly loaded nodes. Since the authors’ protocol prohibits the use of any global load information, it is reasonable to argue that the protocol may take a longer time to cool imbalanced hot spots on the network. Another drawback is that the paper contains some spelling and grammatical errors.

Reviewer:  Jingping Long Review #: CR137086 (1009-0913)
Bookmark and Share
 
Distributed Applications (C.2.4 ... )
 
 
Distributed Data Structures (E.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Distributed Applications": Date
The art of distributed applications
Corbin J., Springer-Verlag New York, Inc., New York, NY, 1991. Type: Book (9780387972473)
Jun 1 1992
Client-server computing
Sinha A. Communications of the ACM 35(7): 77-98, 1992. Type: Article
Jan 1 1994
APPC/MVS distributed application support
Voss F. IBM Systems Journal 31(2): 381-408, 1992. Type: Article
May 1 1994
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy