Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Materialized views: techniques, implementations, and applications
Materialized views: techniques, implementations, and applications
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
ACM Transactions on Computer Systems (TOCS)
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
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
NUTSS: a SIP-based approach to UDP and TCP network connectivity
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
The case for a hybrid p2p search infrastructure
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Decentralized real-time monitoring of network-wide aggregates
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Modeling RPS and evaluating video repair with VQM
IEEE Transactions on Multimedia
A two-layered model for scalable, heterogeneous group communications
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Internet, sensor fusion, search in peer-to-peer networks, coordinated intrusion detection, and Top-K queries in stream-oriented databases. Efficient algorithms that determine approximate global state could enable near-optimal local decision-making with little overhead. In this position paper, we model this problem and summarize recent work on randomized algorithms that navigate a four-way tradeo between accuracy, robustness, performance and overhead. Despite these recent successes, many open problems remain. We believe that solving these problems can radically improve the design of robust, efficient and self-managed distributed systems