Advertisement

Virtual Tree: A Robust Overlay Network for Ensuring Interval Valid Queries in Dynamic Distributed Systems

  • Roberto Baldoni
  • Silvia Bonomi
  • Adriano Cerocchi
  • Leonardo Querzoni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7129)

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.

Keywords

Overlay Network Link Failure Query Execution Virtual Link Strong Negative Impact 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Bonnet, P., Gehrke, J., Seshadri, P.: Towards sensor database systems. In: Proceedings of the Second International Conference on Mobile Data Management (2001)Google Scholar
  4. 4.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Roberto Baldoni
    • 1
  • Silvia Bonomi
    • 1
  • Adriano Cerocchi
    • 1
  • Leonardo Querzoni
    • 1
  1. 1.Sapienza Università di RomaRomaItaly

Personalised recommendations