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.
This work has been partially supported by the EU project BLEND and the Italian project DOTS-LCCI.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldoni, R., Bonomi, S., Kermarrec, A.-M., Raynal, M.: Implementing a register in a dynamic distributed system. In: ICDCS, pp. 639–647. IEEE Computer Society (2009)
Dolev, S., Gilbert, S., Lynch, N.A., Schiller, E., Shvartsman, A.A., Welch, J.L.: Virtual mobile nodes for mobile ad hoc networks. In: Proceedings of the 18th International Conference on Distributed Computing, pp. 230–244 (2004)
Bonnet, P., Gehrke, J., Seshadri, P.: Towards sensor database systems. In: Proceedings of the Second International Conference on Mobile Data Management (2001)
Bawa, M., Gionis, A., Garcia-Molina, H., Motwani, R.: The price of validity in dynamic networks. Journal of Computer and System Sciences 73(3), 245–264 (2007)
Saroiu, S., Gummadi, K.P., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Multimedia Computing and Networking (MMCN) (January 2002)
Baldoni, R., Bonomi, S., Cerocchi, A., Querzoni, L.: Virtual tree: a robust overlay network for ensuring interval valid queries in dynamic distributed systems. MIDLAB 4/2011 - Università degli Studi di Roma “La Sapienza” - Tech. Rep. (2011), http://www.dis.uniroma1.it/~midlab/publications.php
Merritt, M., Taubenfeld, G.: Computing with Infinitely Many Processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164–178. Springer, Heidelberg (2000)
Eyal, I., Keidar, I., Rom, R.: Distributed clustering for robust aggregation in large networks. In: Proceedings of the 5th Workshop on Hot Topics in System Dependability (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldoni, R., Bonomi, S., Cerocchi, A., Querzoni, L. (2012). Virtual Tree: A Robust Overlay Network for Ensuring Interval Valid Queries in Dynamic Distributed Systems. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds) Distributed Computing and Networking. ICDCN 2012. Lecture Notes in Computer Science, vol 7129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25959-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-25959-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25958-6
Online ISBN: 978-3-642-25959-3
eBook Packages: Computer ScienceComputer Science (R0)