ScholarLens Back to search
2010•Unpublished venueRequires access

LSB-Chord: Load balancing in DHT based P2P systems under churn

Dehui Liu, Feng Chen, Gang George Yin, Huaimin Wang, Peng Zou

Open publisher page 3 citations

Abstract

Peer-to-Peer (P2P) systems receive growing acceptance, especially DHT based P2P systems. DHT based P2P systems have an inherent workload uneven distribution problem. Skewed workload distribution will influence the availability and the performance of the system seriously. In this paper, an algorithm based on local state for load balancing in DHT based P2P systems under churn, LSB-Chord (local state based chord), is proposed. Each node places the duplication of its data objects to its successors, and collects their load state. Receiving query request, the original node works as a coordinator to balancing the load. Simulation results show that: LSB-Chord can avoid data lost effectively; if the load upon data objects follows uniform distribution, LSB-Chord can achieve the similar balancing to CRA; LSB-Chord can achieve better balancing, if the load upon data objects follows Zipf distribution.

About this research paper

What this paper is about

Peer-to-Peer (P2P) systems receive growing acceptance, especially DHT based P2P systems. DHT based P2P systems have an inherent workload uneven distribution problem. Skewed workload distribution will influence the availability and the performance of the system seriously. In this paper, an algorithm based on local state for load balancing in DHT based P2P systems under churn, LSB-Chord (local state based chord), is proposed. Each node places the duplication of its data objects to its successors, and collects their load state. Receiving query request, the original node works as a coordinator to balancing the load. Simulation results show that: LSB-Chord can avoid data lost effectively; if the load upon data objects follows uniform distribution, LSB-Chord can achieve the similar balancing to CRA; LSB-Chord can achieve better balancing, if the load upon data objects follows Zipf distribution.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Peer-to-Peer (P2P) systems receive growing acceptance, especially DHT based P2P systems. DHT based P2P systems have an inherent workload uneven distribution problem. Skewed workload distribution will influence the availability and the performance of the system seriously. In this paper, an algorithm based on local state for load balancing in DHT based P2P systems under churn, LSB-Chord (local state based chord), is proposed. Each node places the duplication of its data objects to its successors, and collects their load state. Receiving query request, the original node works as a coordinator to balancing the load. Simulation results show that: LSB-Chord can avoid data lost effectively; if the load upon data objects follows uniform distribution, LSB-Chord can achieve the similar balancing to CRA; LSB-Chord can achieve better balancing, if the load upon data objects follows Zipf distribution.

Key concepts: Chord (peer-to-peer), Computer science, Load balancing (electrical power), Workload, Distributed computing, Computer network, Mathematics, Operating system

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
LSB-Chord: Load balancing in DHT based P2P systems under churn — Research Paper | ScholarLens