Load balancing in dynamic structured P2P systems

Godfrey, Brighten; Lakshminarayanan, Karthik; Surana, Sonesh; Karp, Richard M.; Stoica, Ion

doi:10.1109/infcom.2004.1354648

Cited by 233 publications

(175 citation statements)

References 9 publications

Supporting

Mentioning

167

Contrasting

Unclassified

Order By: Relevance

“…Representative applications include load-balancing in web servers [2] and P2P networks [10]. These applications commonly involve many nodes, which can range from web servers to P2P clients, each with a finite resource capacity.…”

Section: ) Acoustic Applicationsmentioning

confidence: 99%

EnviroMic: Towards Cooperative Storage and Retrieval in Audio Sensor Networks

Luo

Cao

Huang

et al. 2007

27th International Conference on Distributed Computing Systems (ICDCS '07)

View full text Add to dashboard Cite

This paper presents the design, implementation, and evaluation of EnviroMic, a novel distributed acoustic monitoring, storage, and trace retrieval system. Audio represents one of the least exploited modalities in sensor networks to date. The relatively high frequency and large size of audio traces motivate distributed algorithms for coordinating recording tasks, reducing redundancy of data stored by nearby sensors, filtering out silence, and balancing storage utilization in the network. Applications of acoustic monitoring with EnviroMic range from the study of mating rituals and social behavior of animals in the wild to audio surveillance of military targets. EnviroMic is designed for disconnected operation, where the luxury of having a basestation cannot be assumed.We implement the system on a TinyOS-based platform and systematically evaluate its performance through both indoor testbed experiments and a preliminary outdoor deployment. Results demonstrate up to a 4-fold improvement in effective storage capacity of the network compared to uncoordinated recording.

show abstract

Section: ) Acoustic Applicationsmentioning

confidence: 99%

EnviroMic: Towards Cooperative Storage and Retrieval in Audio Sensor Networks

Luo

Cao

Huang

et al. 2007

27th International Conference on Distributed Computing Systems (ICDCS '07)

View full text Add to dashboard Cite

show abstract

“…Another complementary load-balancing technique is to migrate the files in a heavily-loaded server to lightly loaded servers [9], [29], [13]. There, the nodal overload is caused by having too many files mapped to the node rather than by having too many requests for one or a few files.…”

Section: B Existing Load-balancing Techniquesmentioning

confidence: 99%

“…It has been implemented in most P2P file sharing applications. Finally, we may also adapt some other load-balancing techniques for resolving nodal hotspot, as introduced in [9], [29], [13].…”

Section: B Simulation With Multiple Filesmentioning

confidence: 99%

Algorithms and performance of load-balancing with multiple hash functions in massive content distribution

et al. 2009

View full text Add to dashboard Cite

Abstract-We consider a two-tier content distribution system for distributing massive content, consisting of an infrastructure content distribution network (CDN) and a large number of ordinary clients. The nodes of the infrastructure network form a structured, distributed-hash-table-based (DHT) peer-to-peer (P2P) network. Each file is first placed in the CDN, and possibly, is replicated among the infrastructure nodes depending on its popularity. In such a system, it is particularly pressing to have proper load-balancing mechanisms to relieve server or network overload. The subject of the paper is on popularitybased file replication techniques within the CDN using multiple hash functions. Our strategy is to set aside a large number of hash functions. When the demand for a file exceeds the overall capacity of the current servers, a previously unused hash function is used to obtain a new node ID where the file will be replicated. The central problems are how to choose an unused hash function when replicating a file and how to choose a used hash function when requesting the file. Our solution to the filereplication problem is to choose the unused hash function with the smallest index, and our solution to the file-request problem is to choose a used hash function uniformly at random. Our main contribution is that we have developed a set of distributed, robust algorithms to implement the above solutions and we have evaluated their performance. In particular, we have analyzed a random binary search algorithm for file request and a random gap-removal algorithm for failure recovery.

show abstract

“…In the past, numerous load balancing algorithms were proposed with different characteristics [11,6,2,16,4]. However, few of them are able to deal with both the dynamism and proximity.…”

Section: Introductionmentioning

confidence: 99%

“…In general, the dynamic feature of DHTs should be dealt with by randomized matching between heavily loaded nodes with lightly loaded nodes. Rao and Godfrey et al [6,2] proposed randomized load balancing algorithms for dynamic DHTs with churn. The algorithms treat all nodes equally in random probing, without consideration of node proximity information in load balancing.…”

Section: Introductionmentioning

confidence: 99%

Locality-Aware Randomized Load Balancing Algorithms for DHT Networks

Shen

2005 International Conference on Parallel Processing (ICPP'05)

View full text Add to dashboard Cite

show abstract

Load balancing in dynamic structured P2P systems

Cited by 233 publications

References 9 publications

EnviroMic: Towards Cooperative Storage and Retrieval in Audio Sensor Networks

EnviroMic: Towards Cooperative Storage and Retrieval in Audio Sensor Networks

Algorithms and performance of load-balancing with multiple hash functions in massive content distribution

Locality-Aware Randomized Load Balancing Algorithms for DHT Networks

Contact Info

Product

Resources

About