2005
DOI: 10.1145/1052812.1052813
|View full text |Cite
|
Sign up to set email alerts
|

Implementing aggregation and broadcast over Distributed Hash Tables

Abstract: Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive nature of P2P networks is that it is not trivial to aggregate and broadcast global information efficiently. We believe that this aggregation/broadcast functionality is a fundamental service that should be layered over existing Distributed Hash Tables (DHTs), and in this work, we design a novel algorithm for this purpose. Specifically… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
42
0

Year Published

2005
2005
2013
2013

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 51 publications
(43 citation statements)
references
References 10 publications
1
42
0
Order By: Relevance
“…If one of the higher-level nodes fail, a lot of data will be lost. This effect is documented by Li et al [7].…”
Section: Increasing Node Degreesupporting
confidence: 60%
See 2 more Smart Citations
“…If one of the higher-level nodes fail, a lot of data will be lost. This effect is documented by Li et al [7].…”
Section: Increasing Node Degreesupporting
confidence: 60%
“…The current approach to fighting data loss (as suggested by, e.g., [5] and [7]) is replication. This is easily done by creating several independent reduction trees, replicating the whole aggregation process.…”
Section: Replicationmentioning
confidence: 99%
See 1 more Smart Citation
“…However, it is challenging to build aggregation trees explicitly by maintaining the parent-child membership [12]. First, explicit tree construction has limited scalability on a large number of aggregation trees since the parent-child maintenance overhead increases linearly with the number of trees.…”
Section: Distributed Aggregation Treementioning
confidence: 99%
“…Li et al [12] build an aggregation tree by mapping nodes to their parents in the tree with a parent function. By adjusting parameters in a parent function, their approach can build multiple interior-node-disjoint trees to tolerate single points of failure.…”
Section: Related Workmentioning
confidence: 99%