Abstract
We prove one combinatorial result which we found useful in investigations of replication of documents in various storage systems like P2P systems or clouds.
Supported by grant nr 2010/342643 of the Institute of Mathematics and Computers Science of the Wrocław University of Technology.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Knuth, D.E.: The art of computer programming, 3rd edn. Sorting and Searching. Addison-Wesley, Reading (1997)
Klamkin, M., Newman, D.: Extensions of the birthday surprise. J. Combin. Theory 3, 279–282 (1967)
Martins, V.: Data Replication in P2P Systems. PhD thesis, Universite De Nantes Faculte Des Sciences Et Des Techniques (2007)
Caron, S., Giroire, F., Mazauric, D., Monteiro, J., Pérennes, S.: Data life time for different placement policies in p2p storage systems. In: Hameurlain, A., Morvan, F., Tjoa, A.M. (eds.) Globe 2010. LNCS, vol. 6265, pp. 75–88. Springer, Heidelberg (2010)
Cichoń, J., Jasiński, A., Kapelko, R., Zawada, M.: How to Improve the Reliability of Chord? In: Meersman, R., Tari, Z., Herrero, P. (eds.) OTM-WS 2008. LNCS, vol. 5333, pp. 904–913. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cichoń, J., Kapelko, R., Marchwicki, K. (2011). Brief Announcement: A Note on Replication of Documents. In: Défago, X., Petit, F., Villain, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2011. Lecture Notes in Computer Science, vol 6976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24550-3_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-24550-3_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24549-7
Online ISBN: 978-3-642-24550-3
eBook Packages: Computer ScienceComputer Science (R0)