Virtual tree: a robust overlay network for ensuring interval valid queries in dynamic distributed systems

Authors:
Roberto Baldoni;Silvia Bonomi;Adriano Cerocchi;Leonardo Querzoni
Affiliations:
Sapienza Università di Roma, Roma, Italy;Sapienza Università di Roma, Roma, Italy;Sapienza Università di Roma, Roma, Italy;Sapienza Università di Roma, Roma, Italy
Venue:
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Year:
2012

Citing 4
Cited 1

Computing with Infinitely Many Processes

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Towards Sensor Database Systems

MDM '01 Proceedings of the Second International Conference on Mobile Data Management
The price of validity in dynamic networks

Journal of Computer and System Sciences
Implementing a Register in a Dynamic Distributed System

ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems

Virtual Tree: A robust architecture for interval valid queries in dynamic distributed systems

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Today's large scale distributed systems are characterized by strong dynamics caused by the inherent unreliability of their constituting elements (e.g. process and link failures, processes joining or leaving the system). This continuous dynamism has a strong negative impact on distributed algorithms designed to work on such systems. Regular registers [1], Replication [2], in-network aggregation[3], are all examples of such problem.