Simple dynamic load balancing mechanism for structured P2P network and its evaluation

Takeda, Atsushi; Oide, Takuma; Takahashi, Akiko

doi:10.1504/ijguc.2012.047763

Cited by 13 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [49], authors propose a new structured P2P network named the Well-Distribution Algorithm for an Overlay Network (Waon). Each node modifies its location on Waon's identifier ring dynamically to achieve uniform distribution of objects.…”

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

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%

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

2018

View full text Add to dashboard Cite

show abstract

“…Therefore, in this network, it is difficult for each node to get accurate aggregation results such as summation or average. Some structured p2p networks that support range queries have been proposed [12][13] [14] [15]. In these structured p2p networks, a node can calculate an aggregation of values owned by several nodes.…”

Section: Related Workmentioning

confidence: 99%

“…In a structured p2p network that uses hopbased routing, the node gets only one partial aggregation results from an outbound node when a node calculates a new partial aggregation result that is associated with the outbound node. Therefore, in a Chord# network or a Waon network [15], the amount of communication data necessary for updating a routing table is equal to O(log N ).…”

Section: A Asynchronous Data Aggregationmentioning

confidence: 99%

Accurate Data Aggregation on Unstable Structured P2P Network

Takeda

Oide

Takahashi

et al. 2015

2015 IEEE 29th International Conference on Advanced Information Networking and Applications

Self Cite

View full text Add to dashboard Cite

Smartphones and sensor devices have come into widespread use, and we can observe huge amounts of data from the devices via the Internet. In order to develop a network application which uses these devices effectively, we need an accurate and scalable data aggregation mechanism. In this paper, we propose a accurate data aggregation mechanism which is based on a scalable structured p2p network. The proposed mechanism is constructed by two concepts: Asynchronous Data Aggregation and Time-slot-based Data Aggregation. In the proposed mechanism, the amount of communication data required for data aggregation is O(log N), where N is the number of nodes. Additionally, the proposed mechanism achieves accurate data aggregation even if the structured p2p network is unstable. In this paper, we explain an algorithm and a communication protocol for the proposed data aggregation mechanism. Furthermore, using experimentally obtained results, we indicate advantages of our proposal over existing data aggregation mechanisms.

show abstract

An Efficient RFID Reader Network Planning Strategy Based on P2P Computing

Shen

Qian

2016

Advances on P2P, Parallel, Grid, Cloud and Internet Computing

View full text Add to dashboard Cite

Simple dynamic load balancing mechanism for structured P2P network and its evaluation

Cited by 13 publications

References 22 publications

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

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

Accurate Data Aggregation on Unstable Structured P2P Network

An Efficient RFID Reader Network Planning Strategy Based on P2P Computing

Contact Info

Product

Resources

About