Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Matrix analysis
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Linear programming without the matrix
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A parallel approximation algorithm for positive linear programming
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
On-Line End-to-End Congestion Control
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
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
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Convex Optimization
A decentralized algorithm for spectral analysis
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Fastest Mixing Markov Chain on a Graph
SIAM Review
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Geographic gossip: efficient aggregation 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
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
Optimal throughput-delay scaling in wireless networks: part I: the fluid model
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Mathematical aspects of mixing times in Markov chains
Foundations and Trends® in Theoretical Computer Science
Automatica (Journal of IFAC)
Fully Distributed Algorithms for Convex Optimization Problems
DISC '07 Proceedings of the 21st international symposium on Distributed Computing
Markov Chains and Stochastic Stability
Markov Chains and Stochastic Stability
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Information theoretic bounds for distributed computation
Information theoretic bounds for distributed computation
Distributed cross-layer algorithms for the optimal control of multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
The capacity of wireless networks
IEEE Transactions on Information Theory
Product Multicommodity Flow in Wireless Networks
IEEE Transactions on Information Theory
Fast Distributed Algorithms for Computing Separable Functions
IEEE Transactions on Information Theory
Randomized scheduling algorithms for high-aggregate bandwidth switches
IEEE Journal on Selected Areas in Communications
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
In-network coding for resilient sensor data storage and efficient data mule collection
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
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
Robust distributed orthogonalization based on randomized aggregation
Proceedings of the second workshop on Scalable algorithms for large-scale systems
Push- and pull-based epidemic spreading in networks: Thresholds and deeper insights
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Supporting information spread in a social internetworking scenario
NFMCP'12 Proceedings of the First international conference on New Frontiers in Mining Complex Patterns
A reinforcement learning-based routing for delay tolerant networks
Engineering Applications of Artificial Intelligence
An Efficient Multi-Path Self-Organizing Strategy in Internet of Things
Wireless Personal Communications: An International Journal
The VLDB Journal — The International Journal on Very Large Data Bases
Majority dynamics and aggregation of information in social networks
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.07 |
Unlike the Telephone network or the Internet, many of the next generation networks are not engineered for the purpose of providing efficient communication between various networked entities. Examples abound: sensor networks, peer-to-peer networks, mobile networks of vehicles and social networks. Indeed, these emerging networks do require algorithms for communication, computation, or merely spreading information. For example, estimation algorithms in sensor networks, broadcasting news through a peer-to-peer network, or viral advertising in a social network. These networks lack infrastructure; they exhibit unpredictable dynamics and they face stringent resource constraints. Therefore, algorithms operating within them need to be extremely simple, distributed, robust against networks dynamics, and efficient in resource utilization. Gossip algorithms, as the name suggests, are built upon a gossip or rumor style unreliable, asynchronous information exchange protocol. Due to their immense simplicity and wide applicability, this class of algorithms has emerged as a canonical architectural solution for the next generation networks. This has led to exciting recent progress to understand the applicability as well as limitations of the Gossip algorithms. In this review, we provide a systematic survey of many of these recent results on Gossip network algorithms. The algorithmic results described here utilize interdisciplinary tools from Markov chain theory, Optimization, Percolation, Random graphs, Spectral graph theory, and Coding.