Skip to main content

Distributed Overlay Maintenance with Application to Data Consistency

  • Conference paper
Book cover Data Management in Grid and Peer-to-Peer Systems (Globe 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6864))

Included in the following conference series:

Abstract

The proliferation of connected device rises new challenges for data maintenance in terms of efficiency, scalability and security. In the context of data replication at a large scale, weak consistency has been adopted as a standard in uniformly trusted systems. Recently, a distributed framework has been proposed to handle untrusted systems, by adding access control at the file level. Yet, if no particular care is paid to the connectivity of the network used for replication, w.r.t. dynamically evolving access rights, updates at replicas may not propagate correctly.

This paper proposes the design of a middleware application in charge of maintaining the connectivity of the overlay used for update propagation. We propose to improve the resilience of any overlay that may be disconnected as access right policies are modified or as critical nodes crash. This is achieved by reacting to a blocking node by rewiring the overlay in order to preserve at least one path between any pairs of replicas, while conserving the structural characteristics of the overlay. Simulations show that at a tunable overhead, connectivity is maintained, despite local decisions that would have otherwise disrupted the replication service.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1) (2002)

    Google Scholar 

  2. Bansal, T., Mittal, N.: A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems. In: IPDPS (2010)

    Google Scholar 

  3. Cardoso, J.C.S., Baquero, C., Almeida, P.S.: Probabilistic estimation of network size and diameter. In: LADC (2009)

    Google Scholar 

  4. DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazon’s highly available key-value store. Oper. Syst. Rev. 41(6) (2007)

    Google Scholar 

  5. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: PODC (1987)

    Google Scholar 

  6. Eugster, P.T., Guerraoui, R., Kouznetsov, P.: Delta-reliable broadcast: A probabilistic measure of broadcast reliability. In: ICDCS (2004)

    Google Scholar 

  7. Fekete, A., Gupta, D., Luchangco, V., Lynch, N., Shvartsman, A.: Eventually-serializable data services. In: PODC (1996)

    Google Scholar 

  8. Hamid, B., Le Sac, B., Mosbah, M.: Distributed local 2-connectivity test of graphs and applications. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds.) ISPA 2007. LNCS, vol. 4742, pp. 195–207. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Hayes, T.P., Saia, J., Trehan, A.: The forgiving graph: a distributed data structure for low stretch under adversarial attack. In: PODC (2009)

    Google Scholar 

  10. Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. Trans. Comput. Syst. 23(3) (2005)

    Google Scholar 

  11. http://mercurial.selenic.com/

  12. Le Merrer, E., Straub, G.: Weak consistency vs. access control: Distributed path maintenance,Technical Report, http://hal.inria.fr/inria-00543240/en/

  13. Miltchev, S., Smith, J.M., Prevelakis, V., Keromytis, A., Ioannidis, S.: Decentralized access control in distributed file systems. Comput. Surv. 40(3) (2008)

    Google Scholar 

  14. Petersen, K., Spreitzer, M.J., Terry, D.B., Theimer, M.M., Demers, A.J.: Flexible update propagation for weakly consistent replication. In: SOSP (1997)

    Google Scholar 

  15. Saito, Y., Shapiro, M.: Optimistic replication. Comput. Surv. 37(1) (2005)

    Google Scholar 

  16. Sanchez-Artigas, M.: Distributed access enforcement in p2p networks: When privacy comes into play. In: P2P (2010)

    Google Scholar 

  17. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393 (1998)

    Google Scholar 

  18. Wobber, T., Rodeheffer, T.L., Terry, D.B.: Policy-based access control for weakly consistent replication. In: EuroSys (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Le Merrer, E., Straub, G. (2011). Distributed Overlay Maintenance with Application to Data Consistency. In: Hameurlain, A., Tjoa, A.M. (eds) Data Management in Grid and Peer-to-Peer Systems. Globe 2011. Lecture Notes in Computer Science, vol 6864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22947-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22947-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22946-6

  • Online ISBN: 978-3-642-22947-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics