Efficient Broadcast in Structured P2P Networks [chapter]

Sameh El-Ansary, Luc Onana Alima, Per Brand, Seif Haridi
2003 Lecture Notes in Computer Science  
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
more » ... er broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information.
doi:10.1007/978-3-540-45172-3_28 fatcat:6vdus2qat5a4tomgrsgo4ol2me