Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Counting Distinct Elements in a Data Stream
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A decentralized algorithm for spectral analysis
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
On the spread of viruses on the internet
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Hierarchical spatial gossip for multi-resolution representations in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Summarizing data using bottom-k sketches
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Practical summation via gossip
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
DoS-resilient secure aggregation queries in sensor networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
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
On spreading recommendations via social gossip
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Computing Frequent Elements Using Gossip
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Tighter estimation using bottom k sketches
Proceedings of the VLDB Endowment
Maintaining replicas in unstructured P2P systems
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Leveraging discarded samples for tighter estimation of multiple-set aggregates
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Fast summation via sampling in large-scale sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Fault-Tolerant Aggregation by Flow Updating
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Distributed Information Forwarding Using Delay Function in Wireless Mobile Networks
FMN '09 Proceedings of the 2nd International Workshop on Future Multimedia Networking
IEEE Transactions on Signal Processing
Broadcast gossip algorithms for consensus
IEEE Transactions on Signal Processing
Gossiping for threshold detection
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Optimal gossip-based aggregate computation
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Distributed averaging in dynamic networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributed cross-layer algorithms for the optimal control of multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Towards efficient designs for in-network computing with noisy wireless channels
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
Identifying frequent items in a network using gossip
Journal of Parallel and Distributed Computing
Information theoretic bounds for distributed computation over networks of point-to-point channels
IEEE Transactions on Information Theory
Distributed SQL queries with BubbleStorm
From active data management to event-based systems and more
Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
Order optimal information spreading using algebraic gossip
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Are evolutionary algorithm competitions characterizing landscapes appropriately
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Fast information spreading in graphs with large weak conductance
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
LiMoSense --- live monitoring in dynamic sensor networks
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The cost of fault tolerance in multi-party communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On message complexity of extrema propagation techniques
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Extreme propagation in an ad-hoc radio network - revisited
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
Evolutionary algorithm characterization in real parameter optimization problems
Applied Soft Computing
Hi-index | 0.07 |
Motivated by applications to sensor, peer-to-peer, and ad-hoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed manner. In particular, we consider separable functions, which can be written as linear combinations of functions of individual variables. Known iterative algorithms for averaging can be used to compute the normalized values of such functions, but these algorithms do not extend in general to the computation of the actual values of separable functions.The main contribution of this paper is the design of a distributed randomized algorithm for computing separable functions based on properties of exponential random variables. We bound the running time of our algorithm in terms of the running time of an information spreading algorithm used as a subroutine by the algorithm. Since we are interested in totally distributed algorithms, we consider a randomized gossip mechanism for information spreading as the subroutine. Combining these algorithms yields a complete and simple distributed algorithm for computing separable functions.The second contribution of this paper is an analysis of the information spreading time of the gossip algorithm. This analysis yields an upper bound on the information spreading time, and therefore a corresponding upper bound on the running time of the algorithm for computing separable functions, in terms of the conductance of an appropriate stochastic matrix. These bounds imply that, for a class of graphs with small spectral gap (such as grid graphs), the time used by our algorithm to compute averages is of a smaller order than the time required for the computation of averages by a known iterative gossip scheme [5].