Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Indra: A peer-to-peer approach to network intrusion detection and prevention
WETICE '03 Proceedings of the Twelfth International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Brief announcement: randomized rumor spreading with fewer phone calls
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Cache Updates in a Peer-to-Peer Network of Mobile Agents
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
On-Chip Stochastic Communication
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Spatial gossip and resource location protocols
Journal of the ACM (JACM)
Distributed Computing
Correctness of a gossip based membership protocol
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Can unstructured P2P protocols survive flash crowds?
IEEE/ACM Transactions on Networking (TON)
Scalable summary based retrieval in P2P networks
Proceedings of the 14th ACM international conference on Information and knowledge management
IEEE Transactions on Dependable and Secure Computing
Towards on-chip fault-tolerant communication
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
SmartGossip: an improved randomized broadcast protocol for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Efficient gossip-based aggregate computation
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Broadcast in the rendezvous model
Information and Computation
Random walk based node sampling in self-organizing networks
ACM SIGOPS Operating Systems Review
Discovering and exploiting keyword and attribute-value co-occurrences to improve P2P routing indices
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
Agent-based randomized broadcasting in large networks
Discrete Applied Mathematics
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling spread of ideas in online social networks
AusDM '06 Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61
ACM Transactions on Computer Systems (TOCS)
Journal of Systems and Software
On collaborative content distribution using multi-message gossip
Journal of Parallel and Distributed Computing
How robust are gossip-based communication protocols?
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
A generic theoretical framework for modeling gossip-based algorithms
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
The "art" of programming gossip-based systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Partial read from peer-to-peer databases
Computer Communications
Synopsis diffusion for robust aggregation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
The power of memory in randomized broadcasting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
On spreading recommendations via social gossip
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On the complexity of asynchronous gossip
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Gossip-based aggregate computation: computing faster with non address-oblivious schemes
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Gossip-based service coordination for scalability and resilience
Proceedings of the 3rd workshop on Middleware for service oriented computing
On randomized broadcasting in Star graphs
Discrete Applied Mathematics
Araneola: A scalable reliable multicast system for dynamic environments
Journal of Parallel and Distributed Computing
An Analytical Model of Information Dissemination for a Gossip-Based Protocol
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Theoretical Computer Science
Robust live media streaming in swarms
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
An analytical model of information dissemination for a gossip-based protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the runtime and robustness of randomized broadcasting
Theoretical Computer Science
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Multiple Round Random Ball Placement: Power of Second Chance
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
The Weighted Coupon Collector's Problem and Applications
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Performance study of ad hoc routing protocols with gossip-based approach
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
FoG: Fighting the Achilles' Heel of Gossip Protocols with Fountain Codes
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
CLON: Overlay Networks and Gossip Protocols for Cloud Environments
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Strong Robustness of Randomized Rumor Spreading Protocols
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An analytical framework for self-organizing peer-to-peer anti-entropy algorithms
Performance Evaluation
Broadcast in the rendezvous model
Information and Computation
Do neighbor-avoiding walkers walk as if in a small-world network?
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
IEEE Transactions on Signal Processing
Optimizing information flow in the gossip objects platform
ACM SIGOPS Operating Systems Review
On mixing and edge expansion properties in randomized broadcasting
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A low-overhead and reliable switch architecture for Network-on-Chips
Integration, the VLSI Journal
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Probabilistic flooding for efficient information dissemination in random graph topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal gossip-based aggregate computation
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
On the bit communication complexity of randomized rumor spreading
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Complement routing: A methodology to design reliable routing algorithm for Network on Chips
Microprocessors & Microsystems
Retiring replicants: congestion control for intermittently-connected networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Topological properties affect the power of network coding in decentralized broadcast
INFOCOM'10 Proceedings of the 29th conference on Information communications
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Spreading of messages in random graphs
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Distributed agreement with optimal communication complexity
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Rumour spreading and graph conductance
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
How efficient can gossip be? (on the cost of resilient information exchange)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Efficient information exchange in the random phone-call model
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Low communication self-stabilization through randomization
DISC'10 Proceedings of the 24th international conference on Distributed computing
Communication complexity of quasirandom rumor spreading
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
On collaborative content distribution using multi-message gossip
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Location-aided fast distributed consensus in wireless networks
IEEE Transactions on Information Theory
Messy broadcasting - Decentralized broadcast schemes with limited knowledge
Discrete Applied Mathematics
Efficient broadcasting in random power law networks
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
GoDisco: selective gossip based dissemination of information in social community based overlays
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Modeling gossip-based content dissemination and search in distributed networking
Computer Communications
Dynamic networks: models and algorithms
ACM SIGACT News
Epidemic-based information dissemination in wireless mobile sensor networks
IEEE/ACM Transactions on Networking (TON)
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Order optimal information spreading using algebraic gossip
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Research note: On the uniformity of peer sampling based on view shuffling
Journal of Parallel and Distributed Computing
Quasirandom rumor spreading: An experimental analysis
Journal of Experimental Algorithmics (JEA)
Asymptotically optimal randomized rumor spreading
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Faster coupon collecting via replication with applications in gossiping
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
DECA: a hierarchical framework for DECentralized aggregation in DHTs
DSOM'06 Proceedings of the 17th IFIP/IEEE international conference on Distributed Systems: operations and management
Heuristics for flash-dissemination in heterogenous networks
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Rumor spreading and vertex expansion
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Ultra-fast rumor spreading in social networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Gossip-Based greedy gaussian mixture learning
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Randomised broadcasting: memory vs. randomness
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Fast information spreading in graphs with large weak conductance
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the randomness requirements of rumor spreading
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Robust distributed orthogonalization based on randomized aggregation
Proceedings of the second workshop on Scalable algorithms for large-scale systems
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
On randomized broadcasting in power law networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
On randomized broadcasting in star graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Efficient epidemic multicast in heterogeneous networks
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
The scalability of swarming peer-to-peer content delivery
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
On the runtime and robustness of randomized broadcasting
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Why rumors spread so quickly in social networks
Communications of the ACM
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The impact of the power law exponent on the behavior of a dynamic epidemic type process
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Tag-aware recommender systems: a state-of-the-art survey
Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
The worst case behavior of randomized gossip
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Push- and pull-based epidemic spreading in networks: Thresholds and deeper insights
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Asynchronous rumor spreading in preferential attachment graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A denial-of-service resistant DHT
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Push-to-pull peer-to-peer live streaming
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks
Journal of Parallel and Distributed Computing
Experimental analysis of rumor spreading in social networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
Journal of the ACM (JACM)
Pervasive and Mobile Computing
Autonomic cloud resource sharing for intercloud federations
Future Generation Computer Systems
On the precision of social and information networks
Proceedings of the first ACM conference on Online social networks
Chaos: versatile and efficient all-to-all data sharing and in-network processing at scale
Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems
Randomized information dissemination in dynamic environments
IEEE/ACM Transactions on Networking (TON)
Direction-reversing quasi-random rumor spreading with restarts
Information Processing Letters
Randomised broadcasting: Memory vs. randomness
Theoretical Computer Science
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.10 |
Investigates the class of epidemic algorithms that are commonly used for the lazy transmission of updates to distributed copies of a database. These algorithms use a simple randomized communication mechanism to ensure robustness. Suppose n players communicate in parallel rounds in each of which every player calls a randomly selected communication partner. In every round, players can generate rumors (updates) that are to be distributed among all players. Whenever communication is established between two players, each one must decide which of the rumors to transmit. The major problem is that players might not know which rumors their partners have already received. For example, a standard algorithm forwarding each rumor form the calling to the called players for /spl Theta/(ln n) rounds needs to transmit the rumor /spl Theta/(n ln n) times in order to ensure that every player finally receives the rumor with high probability. We investigate whether such a large communication overhead is inherent to epidemic algorithms. On the positive side, we show that the communication overhead can be reduced significantly. We give an algorithm using only O(n ln ln n) transmissions and O(ln n) rounds. In addition, we prove the robustness of this algorithm. On the negative side, we show that any address-oblivious algorithm needs to send /spl Omega/(n ln ln n) messages for each rumor, regardless of the number of rounds. Furthermore, we give a general lower bound showing that time and communication optimality cannot be achieved simultaneously using random phone calls, i.e. every algorithm that distributes a rumor in O(ln n) rounds needs /spl omega/(n) transmissions.