Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Scalable Fault-Tolerant Aggregation in Large Process Groups
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Towards Sensor Database Systems
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
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
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
The price of validity in dynamic networks
Journal of Computer and System Sciences
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn
SASO '08 Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Implementing a Register in a Dynamic Distributed System
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Semantic self-assessment of query results in dynamic environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Network imprecision: a new consistency metric for scalable monitoring
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Improving validity of query answering in dynamic systems
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Modeling and evaluating targeted attacks in large scale dynamic systems
DSN '11 Proceedings of the 2011 IEEE/IFIP 41st International Conference on Dependable Systems&Networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Looking for a definition of dynamic distributed systems
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Connectivity in eventually quiescent dynamic distributed systems
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
| Hi-index | 0.00 |
This paper studies the problem of answering aggregation queries, satisfying the interval validity semantics, in a distributed system prone to continuous arrival and departure of participants. The interval validity semantics states that the query answer must be calculated considering contributions of at least all processes that remained in the distributed system for the whole query duration. Satisfying this semantics in systems experiencing unbounded churn is impossible due to the lack of connectivity and path stability between processes. This paper presents a novel architecture, namely Virtual Tree, for building and maintaining a structured overlay network with guaranteed connectivity and path stability in settings characterized by bounded churn rate. The architecture includes a simple query answering algorithm that provides interval valid answers. The overlay network generated by the Virtual Tree architecture is a tree-shaped topology with virtual nodes constituted by clusters of processes and virtual links constituted by multiple communication links connecting processes located in adjacent virtual nodes. We formally prove a bound on the churn rate for interval valid queries in a distributed system where communication latencies are bounded by a constant unknown by processes. Finally, we carry out an extensive experimental evaluation that shows the degree of robustness of the overlay network generated by the virtual tree architecture under different churn rates.