Journal of the ACM (JACM) - The MIT Press scientific computation series
Journal of the ACM (JACM)
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
ACM Computing Surveys (CSUR)
The computational beauty of nature
The computational beauty of nature
The ant colony optimization meta-heuristic
New ideas in optimization
Templates for the solution of algebraic eigenvalue problems: a practical guide
Templates for the solution of algebraic eigenvalue problems: a practical guide
Self-stabilizing systems in spite of distributed control
Communications of the ACM
ACM Transactions on Computer Systems (TOCS)
Self-Reproduction in Asynchronous Cellular Automata
EH '02 Proceedings of the 2002 NASA/DoD Conference on Evolvable Hardware (EH'02)
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
SLACER: A Self-Organizing Protocol for Coordination in Peer-to-Peer Networks
IEEE Intelligent Systems
IEEE/ACM Transactions on Networking (TON)
Fireflies: scalable support for intrusion-tolerant network overlays
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Distributed Slicing in Dynamic Systems
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Firefly-inspired Heartbeat Synchronization in Overlay Networks
SASO '07 Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems
Ants and reinforcement learning: a case study in routing in dynamic networks
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Gossip-based clock synchronization for large decentralized systems
SelfMan'06 Proceedings of the Second IEEE international conference on Self-Managed Networks, Systems, and Services
Epidemic-Style management of semantic overlays for content-based searching
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
MeanField analysis for the evaluation of gossip protocols
ACM SIGMETRICS Performance Evaluation Review
Prestige-based peer sampling service: interdisciplinary approach to secure gossip
Proceedings of the 2009 ACM symposium on Applied Computing
An evaporative approach to handle dynamics in diffusive aggregation schemes
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
Mean-field framework for performance evaluation of push-pull gossip protocols
Performance Evaluation
A peer's-eye view: network term clouds in a peer-to-peer system
Proceedings of the 20th ACM international conference on Information and knowledge management
Hi-index | 0.00 |
In recent years the labels "gossip" and "gossip-based" have been applied to an increasingly general class of algorithms, including approaches to information aggregation, overlay network management and clock synchronization. These algorithms are intuitively similar, irrespective of their purpose. Their distinctive features include relying on local information, being round-based and relatively simple, and having a bounded information transmission and processing complexity in each round. Our position is that this class can and should be significantly extended to involve algorithms from other disciplines that share the same or similar distinctive features, like certain parallel numerical algorithms, routing protocols, bio-inspired algorithms and cellular automata, to name but a few. Such a broader perspective would allow us to import knowledge and tools to design and understand gossip-based distributed systems, and we could also export accumulated knowledge to re-interpret some of the problems in other disciplines, such as vehicular traffic control. In this position paper we describe a number of areas that show parallels with gossip protocols. These example areas will hopefully serve as inspiration for future research. In addition, we believe that comparisons with other fields also helps clarify the definition of gossip protocols and represents a necessary first step towards an eventual formal definition.