Efficient, proximity-aware load balancing for DHT-based P2P systems

Zhu, Yingwu; Hu, Yiming

doi:10.1109/tpds.2005.46

Cited by 151 publications

(94 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Although a lot of extensions have been proposed for Chord, such as biasing Id assignment to load balance data over nodes [25] and network-awareness to reduce latencies [31], we consider these issues to be outside the scope of this paper. However, one extension we provide that is an address caching mechanism to preserve connection information for future session establishment.…”

Section: Usurp Sonmentioning

confidence: 99%

Usurp: Distributed NAT Traversal for Overlay Networks

Niazi¹,

Dowling²

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Section: Usurp Sonmentioning

confidence: 99%

Usurp: Distributed NAT Traversal for Overlay Networks

Niazi¹,

Dowling²

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

“…Thus, structured P2P IR systems needs load balancing techniques. Those load balancing techniques include the virtual server [2], the local and random probes algorithms [16], pair-wise interactions of peers [4], and proximity-aware balancing [17]. These techniques can improve the node ID assignment in a DHT and can be used in any P2P applications.…”

Section: Related Workmentioning

confidence: 99%

Load Balancing Scheme on the Basis of Huffman Coding for P2P Information Retrieval

Kurasawa

Takasu

Adachi

2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYAlthough a distributed index on a distributed hash table (DHT) enables efficient document query processing in Peer-to-Peer information retrieval (P2P IR), the index costs a lot to construct and it tends to be an unfair management because of the unbalanced term frequency distribution. We devised a new distributed index, named Huffman-DHT, for P2P IR. The new index uses an algorithm similar to Huffman coding with a modification to the DHT structure based on the term distribution. In a Huffman-DHT, a frequent term is assigned to a short ID and allocated a large space in the node ID space in DHT. Throuth ID management, the Huffman-DHT balances the index registration accesses among peers and reduces load concentrations. Huffman-DHT is the first approach to adapt concepts of coding theory and term frequency distribution to load balancing. We evaluated this approach in experiments using a document collection and assessed its load balancing capabilities in P2P IR. The experimental results indicated that it is most effective when the P2P system consists of about 30,000 nodes and contains many documents. Moreover, we proved that we can construct a Huffman-DHT easily by estimating the probability distribution of the term occurrence from a small number of sample documents.

show abstract

“…Some approaches [13,14,15] combine transmission capacities and proximity issues. In [13] Magellan is proposed, which is a multicast scheme based on cooperative applications.…”

Section: Related Workmentioning

confidence: 99%

“…The authors evaluate their proposed scheme using application layer multicast, however, they do not show the strategy to build the multicast tree. Zhu et al propose in [15] to combine node capabilities and proximity relationship on load balancing schemes for DHT-based P2P systems. Our work has some similarity to [15] in the sense that we use node upload capacities and proximity relationship in combination with an m-ary tree for content delivery.…”

Section: Related Workmentioning

confidence: 99%

“…Zhu et al propose in [15] to combine node capabilities and proximity relationship on load balancing schemes for DHT-based P2P systems. Our work has some similarity to [15] in the sense that we use node upload capacities and proximity relationship in combination with an m-ary tree for content delivery. However, several features make our approach different.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation