Efficient broadcast in structured P2P networks
2003 (English)In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2735, 304-314 p.Article in journal (Refereed) Published
In this position paper, we present an efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks. In a system of N nodes, a broadcast message originating at an arbitrary node reaches all other nodes after exactly N - 1 messages. We emphasize the perception of a class of DHT systems as a form of distributed k-ary search and we take advantage of that perception in constructing a spanning tree that is utilized for efficient broadcasting. We consider broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information.
Place, publisher, year, edition, pages
2003. Vol. 2735, 304-314 p.
IdentifiersURN: urn:nbn:se:kth:diva-25088ISI: 000185936300027OAI: oai:DiVA.org:kth-25088DiVA: diva2:355727
QC 20101008. Ingår i 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), BERKELEY, CALIFORNIA, FEB 21-22, 2003.2010-10-082010-10-082010-10-08Bibliographically approved