Brief announcement: efficient flooding in power-law networks

Authors:
Farnoush Banaei-Kashani;Cyrus Shahabi
Affiliations:
University of Southern California, Los Angeles, California;University of Southern California, Los Angeles, California
Venue:
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Year:
2003

Citing 1
Cited 1

Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid

SWAM: a family of access methods for similarity-search in peer-to-peer data networks

Proceedings of the thirteenth ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flooding is an effective mechanism for both broadcast and unicast modes of communication (in unstructured networks), providing broad coverage and guaranteeing minimum delay. However, flooding is not a scalable communication mechanism, mainly because of the communication overhead it imposes to the network. We use the percolation theory to formalize the main problem with flooding in the context of power-law networks, propose a remedial approach with our probabilistic flooding technique, and find the optimal operating point for probabilistic flooding rigorously, such that it improves scalability of the normal flooding by 99%.