Corpus ID: 15108583

Broadcasting at the Critical Threshold in Peer-to-Peer Networks 1

@inproceedings{Arteconi2006BroadcastingAT,
  title={Broadcasting at the Critical Threshold in Peer-to-Peer Networks 1},
  author={Stefano Arteconi and D. Hales and O. Babaoglu},
  year={2006}
}
Peer-to-peer (P2P) applications often require periodic broadcasting of messages from a single node to the entire network. For example, a node may wish to inform the network the availability of a new service or resource, or a node may want to query the network for a particular file or service. In unstructured P2P networks, a simple solution to this problem is to use a “flood-fill” algorithm. In flood-filling, each node passes the message to all of its neighbors in the network when it first… Expand
3 Citations

Figures and Tables from this paper

References

SHOWING 1-10 OF 12 REFERENCES
Gossip-based aggregation in large dynamic networks
Applying a socially inspired technique (tags) to improve cooperation in P2P networks
  • D. Hales, B. Edmonds
  • Computer Science
  • IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
  • 2005
SLACER: a self-organizing protocol for coordination in peer-to-peer networks
An optimized adaptive broadcast scheme for inter-vehicle communication
Probabilistic broadcast for flooding in wireless mobile ad hoc networks
Greedy Cheating Liars and the Fools Who Believe Them
Lightweight probabilistic broadcast
Percolation in Multi-hop Wireless Networks
Information dissemination in self-organizing intervehicle networks
...
1
2
...