CFP last date
20 March 2024
Reseach Article

The Server Reassignment Problem for Load Balancing in Structured Peer to Peer Systems

Published on August 2011 by Sumit A. Hirve, Dr. S.H. Patil
journal_cover_thumbnail
National Technical Symposium on Advancements in Computing Technologies
Foundation of Computer Science USA
NTSACT - Number 1
August 2011
Authors: Sumit A. Hirve, Dr. S.H. Patil
36ff8885-a0f2-47df-bcb8-ae8391bde2da

Sumit A. Hirve, Dr. S.H. Patil . The Server Reassignment Problem for Load Balancing in Structured Peer to Peer Systems. National Technical Symposium on Advancements in Computing Technologies. NTSACT, 1 (August 2011), 5-10.

@article{
author = { Sumit A. Hirve, Dr. S.H. Patil },
title = { The Server Reassignment Problem for Load Balancing in Structured Peer to Peer Systems },
journal = { National Technical Symposium on Advancements in Computing Technologies },
issue_date = { August 2011 },
volume = { NTSACT },
number = { 1 },
month = { August },
year = { 2011 },
issn = 0975-8887,
pages = { 5-10 },
numpages = 6,
url = { /proceedings/ntsact/number1/3186-ntst007/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Technical Symposium on Advancements in Computing Technologies
%A Sumit A. Hirve
%A Dr. S.H. Patil
%T The Server Reassignment Problem for Load Balancing in Structured Peer to Peer Systems
%J National Technical Symposium on Advancements in Computing Technologies
%@ 0975-8887
%V NTSACT
%N 1
%P 5-10
%D 2011
%I International Journal of Computer Applications
Abstract

Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. For these systems to be effective, load balancing among the peers is critical. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem and have been known to result in an imbalance factor of θ (log N) in the zone sizes. First addressing the virtual-server-based load balancing problem systematically using an optimization-based approach and derive an proposal in general and its advantages over previous strategies in particular. We also explore other important issues vital to the performance in the virtual server framework, such as the effect of the number of directories employed in the system and the performance ramification of user registration strategies. Second, and perhaps more significantly, we systematically characterize the effect of heterogeneity on load balancing algorithm performance and the conditions in which heterogeneity may be easy or hard to deal with based on an extensive study of a wide spectrum of load and capacity scenarios.

References
  1. Chyouhwa Chen, Kun-Cheng Tsai “The Server Reassignment Problem For Load Balancing In Structured P2P Systems “, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 19, NO. 2, FEBRUARY 2008.
  2. Yingwu Zhu, Yiming Hu” Towards Efficient Load Balancing in Structured P2P Systems” Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS’04), 0- 7695-2132-0/04 (C) 2007 IEEE.
  3. F. Dabek, M. Kaashoek, D. Karger, D. Morris, and I. Stoica, “Wide- Area Cooperative Storage with CFS,” Proc. 18th ACM Symp. Operating Systems Principles (SOSP ’01), pp. 202-215, Oct. 2007.
  4. X. Wang and D. Loguinov, “Load-Balancing Performance of Consistent Hashing: Asymptotic Analysis of Random Node Join,” IEEE/ACM Trans. Networking, vol. 15, no. 5, Oct. 2007.
  5. A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Structured P2P Systems,” Proc. Second Int’l Workshop Peer-to-Peer Systems (IPTPS ’03), Feb. 2006.
  6. B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Dynamic Structured P2P Systems,” Proc. IEEE INFOCOM, 2006.
  7. P.B. Godfrey and I. Stoica, “Heterogeneity and Load Balance in Distributed Hash Tables,” Proc.IEEE INFO 2005.
Index Terms

Computer Science
Information Sciences

Keywords

peer-to-peer (P2P) imbalance factor of θ (log N)