The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A tight lower bound for randomized synchronous consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Methods for Observing Global Properties in Distributed Systems
IEEE Parallel & Distributed Technology: Systems & Technology
Paradigms for Structure in an Amorphous Computer
Paradigms for Structure in an Amorphous Computer
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Probabilistic Queries in Large-Scale Networks
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Dimensions: why do we need a new data handling architecture for sensor networks?
ACM SIGCOMM Computer Communication Review
An environmental energy harvesting framework for sensor networks
Proceedings of the 2003 international symposium on Low power electronics and design
Fault-tolerant grid architecture and practice
Journal of Computer Science and Technology - Grid computing
The price of validity in dynamic networks
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Spatial gossip and resource location protocols
Journal of the ACM (JACM)
Distributed Data Streams Indexing using Content-Based Routing Paradigm
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
IEEE Transactions on Dependable and Secure Computing
Efficient gossip-based aggregate computation
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Secure hierarchical in-network aggregation in sensor networks
Proceedings of the 13th ACM conference on Computer and communications security
The price of validity in dynamic networks
Journal of Computer and System Sciences
Approximate wireless sensor network health monitoring
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
The "art" of programming gossip-based systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Synopsis diffusion for robust aggregation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Aggregation methods for large-scale sensor networks
ACM Transactions on Sensor Networks (TOSN)
An efficient integrity-preserving scheme for hierarchical sensor aggregation
WiSec '08 Proceedings of the first ACM conference on Wireless network security
Improving denial of service resistance using dynamic local adaptations
Proceedings of the 2008 ACM symposium on Applied computing
An unstructured peer-to-peer approach to aggregate node selection
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
San Fermín: aggregating large data sets using a binomial swap forest
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Self-estimation of Neighborhood Density for Mobile Wireless Nodes
UIC '09 Proceedings of the 6th International Conference on Ubiquitous Intelligence and Computing
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Counter-based reliability optimization for gossip-based broadcasting
Computer Communications
Self-healing network for scalable fault-tolerant runtime environments
Future Generation Computer Systems
Facilitating gossip programming with the GossipKit framework
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
International Journal of Wireless and Mobile Computing
Holistic operations in large-scale sensor network systems: a probabilistic peer-to-peer approach
Future directions in distributed computing
Network imprecision: a new consistency metric for scalable monitoring
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Efficient and optimally secure in-network aggregation in wireless sensor networks
WISA'10 Proceedings of the 11th international conference on Information security applications
Scalable fault tolerant protocol for parallel runtime environments
EuroPVM/MPI'06 Proceedings of the 13th European PVM/MPI User's Group conference on Recent advances in parallel virtual machine and message passing interface
Improving the robustness of epidemic communication in scale-free networks
BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology
Journal of Network and Computer Applications
Decentralized computation of threshold crossing alerts
DSOM'05 Proceedings of the 16th IFIP/IEEE Ambient Networks international conference on Distributed Systems: operations and Management
Fault-Tolerant aggregation: flow-updating meets mass-distribution
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
Autonomic cloud resource sharing for intercloud federations
Future Generation Computer Systems
Virtual Tree: A robust architecture for interval valid queries in dynamic distributed systems
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Abstract: This paper discusses fault-tolerant, scalable solutions to the problem of accurately and scalably calculating global aggregate functions in large process groups communicating over unreliable networks. These groups could represent sensors or processes communicating over a network that is either fixed (e.g., the Internet) or dynamic (eg., multihop ad-hoc). Group members are prone to failures. The ability to evaluate global aggregate properties (eg., the average of sensor temperature readings) is important for higher-level coordination activities in such large groups. We first define the setting and problem, laying down metrics to evaluate different algorithms for the same. We discuss why the usual approaches to solve this problem are unviable and unscalable over an unreliable network prone to message delivery failures and crash failures. We then propose a technique to impose an abstract hierarchy on such large groups, describing how this hierarchy can be made to mirror the network topology. We discuss several alternatives to use this technique to solve the global aggregate function evaluation problem. Finally, we present a protocol based on gossiping that uses this hierarchical technique. We present mathematical analysis and performance results to validate the robustness, efficiency and accuracy of the Hierarchical Gossiping algorithm.