Implementing aggregation and broadcast over Distributed Hash Tables Export

@article{li-etal-sigcomm05, 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, we build an aggregation/broadcast tree in a bottom-up fashion by mapping nodes to their parents in the tree with a parent function. The particular parent function family we propose allows the efficient construction of multiple interior-node-disjoint trees, thus preventing single points of failure in tree structures. In this way, we provide DHTs with an ability to collect and disseminate information efficiently on a global scale. Simulation results demonstrate that our algorithm is efficient and robust.}, address = {New York, NY, USA}, author = {Li, Ji and Sollins, Karen and Lim, Dah Y.}, citeulike-article-id = {1965338}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1052812.1052813}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1052812.1052813}, doi = {10.1145/1052812.1052813}, issn = {0146-4833}, journal = {SIGCOMM Comput. Commun. Rev.}, keywords = {aggregation, dht, distributed}, month = {January}, number = {1}, pages = {81--92}, posted-at = {2009-05-17 22:47:46}, priority = {2}, publisher = {ACM}, title = {Implementing aggregation and broadcast over Distributed Hash Tables}, url = {http://dx.doi.org/10.1145/1052812.1052813}, volume = {35}, year = {2005} }

TY - JOUR ID - li-etal-sigcomm05 L3 - citeulike-article-id:1965338 N2 - 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, we build an aggregation/broadcast tree in a bottom-up fashion by mapping nodes to their parents in the tree with a parent function. The particular parent function family we propose allows the efficient construction of multiple interior-node-disjoint trees, thus preventing single points of failure in tree structures. In this way, we provide DHTs with an ability to collect and disseminate information efficiently on a global scale. Simulation results demonstrate that our algorithm is efficient and robust. IS - 1 JF - SIGCOMM Comput. Commun. Rev. SN - 0146-4833 AD - New York, NY, USA EP - 92 TI - Implementing aggregation and broadcast over Distributed Hash Tables PB - ACM VL - 35 SP - 81 KW - aggregation KW - dht KW - distributed AU - Li, Ji AU - Sollins, Karen AU - Lim, Dah PY - 2005/01// UR - http://dx.doi.org/10.1145/1052812.1052813 ER -