Efficient Dynamic Load Balancing for Structured P2P Network

Takeda, Atsushi; Oide, Takuma; Takahashi, Akiko; Suganuma, Takuo

doi:10.1109/nbis.2015.66

Cited by 5 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thereafter, the focus has shifted to the solutions that reduce the cost of maintaining data distribution information. The problem of data skew has been addressed in two main ranges of research: Peer-to-Peer Systems: in P2P networks, A number of recent load balancing approaches have been proposed [17,1,11,50,37,36]. Structured P2P networks [30] are an efficient tool for storage and location of data since there is no central server which could become a bottleneck.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

OLAPS: Online load-balancing in range-partitioned main memory database with approximate partition statistics

2018

View full text Add to dashboard Cite

Modern database systems can achieve high throughput main-memory query execution by being aware of the dynamics of highly parallel hardware. In such systems, data is partitioned into smaller pieces to reach a better parallelism. Unfortunately, data skew is one of the main problems faced during parallel processing in a parallel main memory database. In some data-intensive applications, parallel range queries over a dynamic range partitioned system are important. Continuous insertions/deletions can lead to a very high degree of data skew and consequently a poor performance of parallel range queries. In this paper, we propose an approach for maintaining balanced loads over a set of nodes as in a system of communicating vessels, by migrating tuples between neighboring nodes. These frequent (or even continuous) data transfers inevitably involve dynamic changes in the partition statistics. To avoid the performance degradation typically associated with this dynamism, we provide a solution based on an approximate Partition Statistics Table. The basic idea behind this table is that both clients and nodes may have an imperfect knowledge about the effective load distribution. They can nevertheless locate any data with almost the same efficiency as using exact partition statistics. Furthermore, maintaining load distribution statistics do not require exchanging additional messages as opposed to the cost of efficient solutions from the state-of-art (which requires at least O(logn) messages). We show through intensive experiments that our proposal supports efficient range queries, while simultaneously guaranteeing storage balance even in the presence of numerous concurrent insertions/deletions generating a heavy skewed data distribution.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In addition, the number of communication messages necessary for maintaining the network and searching objects is O(log n), where n denotes the number of nodes. In [50]'s work, an efficient dynamic load balancing scheme for Waon is proposed. Each node collects load values from other nodes in order to obtain entire network information.…”

Section: Related Workmentioning

confidence: 99%

OLAPS: Online load-balancing in range-partitioned main memory database with approximate partition statistics

2018

View full text Add to dashboard Cite

show abstract

“…Load balancing is an important aspect of structured P2P networks [18,[32][33][34][35]. A robust and resilient system should be able to fairly distribute the keys in the network over the participating nodes [32,34,35].…”

Section: Load Balancingmentioning

confidence: 99%

“…A robust and resilient system should be able to fairly distribute the keys in the network over the participating nodes [32,34,35]. This will avert inundating nodes with keys and hence improving resources accessibility in the network.…”

Section: Load Balancingmentioning

confidence: 99%

SHAM: Scalable Homogeneous Addressing Mechanism for structured P2P networks

Zghaibeh

Hassan

2017

J Wireless Com Network

View full text Add to dashboard Cite

In designing structured P2P networks, scalability, resilience, and load balancing are features that are needed to be handled meticulously. The P2P overlay has to handle large scale of nodes while maintaining minimized path lengths in performing lookups. It has also to be resilient to nodes' failure and be able to distribute the load uniformly over its participant. In this paper, we introduce SHAM: a Scalable, Homogenous, Addressing Mechanism for structured P2P networks. SHAM is a multi-dimensional overlay that places nodes in the network based on geometric addressing and maps keys onto values using consistent hashing. Our simulation results show that SHAM locates keys in the network efficiently, is highly resilient to major nodes' failure, and has an effective load balancing property. Furthermore, unlike other DHTs and due to its distinguished naming scheme, SHAM deploys homogenous addressing which drastically reduces latency in the underlying network.

show abstract