Abstract
We propose a data replication scheme on a random apollonian P2P overlay that benefits from the small world and scale free properties. The proposed algorithm features a replica density estimation and a space filling mechanism designed to avoid redundant messages. Not only it provides uniform replication of the data stored into the network but it also improves on classical flooding approaches by removing any redundancy. This last property is obtained at the cost of maintaining a random apollonian overlay. Thanks to the small world and scale free properties of the random apollonian P2P overlay, the search efficiency of the space filling tree algorithm we propose has comparable performances with the classical flooding algorithm on a random network.
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
Andrade, J., Herrmann, J.H., Andrade, R.F.S., da Silva, L.R.: Apollonian networks: Simultaneously scale-free, small world, euclidean, space filling, and with matching graphs. Phys. Rev. Lett. 94(1), 018702 (2005)
Bonnel, N., Ménier, G., Marteau, P.-F.: Search in p2p triangular mesh by space filling trees. In: 16th IEEE Int. Conf. on Networks (ICON 2008), New Delhi, India, December 2008. IEEE, Los Alamitos (2008)
Chamberlin, D.: Xquery: An xml query language. IBM Syst. J. 41(4), 597–615 (2002)
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46–66. Springer, Heidelberg (2001)
Clip2. The gnutella protocol specification v0.4 (2002)
Cohen, E., Shenker, S.: Replication strategies in unstructured peer-to-peer networks (August 2002)
Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: VLDB, pp. 661–672 (2005)
Jiang, S., Guo, L., Zhang, X., Wang, H.: Lightflood: Minimizing redundant messages and maximizing scope of peer-to-peer search. IEEE Transactions on Parallel and Distributed Systems 19(5), 601–614 (2008)
Liang, J., Kumar, R., Ross, K.: The kazaa overlay: A measurement study (2004)
Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the xor metric (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. Technical Report TR-00-010, Berkeley, CA (2000)
Robie, J., Fernández, M.F., Boag, S., Chamberlin, D., Berglund, A., Kay, M., Siméon, J.: XML path language (XPath) 2.0. W3C proposed reccommendation, W3C (November 2006), http://www.w3.org/TR/2006/PR-xpath20-20061121/
Saroiu, S., Gummadi, K., Gribble, S.: Measuring and analyzing the characteristics of napster and gnutella hosts (2003)
Sit, E., Haeberlen, A., Dabek, F., Chun, B., Weatherspoon, H., Morris, R., Kaashoek, M., Kubiatowicz, J.: Proactive replication for data durability (2006)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM 2001: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 149–160. ACM, New York (2001)
Terpstra, W.W., Kangasharju, J., Leng, C., Buchmann, A.P.: Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search. In: SIGCOMM 2007: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 49–60. ACM, New York (2007)
Zhang, Z., Comellas, F., Fertin, G., Rong, L.: High dimensional apollonian networks (2005)
Zhang, Z., Rong, L., Comellas, F.: High dimensional random apollonian networks (2005)
Zhou, T., Yan, G., Zhou, P.-L., Fu, Z.-Q., Wang, B.-H.: Random apollonian networks (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonnel, N., Ménier, G., Marteau, PF. (2009). Proactive Uniform Data Replication by Density Estimation in Apollonian P2P Networks. In: Hameurlain, A., Tjoa, A.M. (eds) Data Management in Grid and Peer-to-Peer Systems. Globe 2009. Lecture Notes in Computer Science, vol 5697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03715-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-03715-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03714-6
Online ISBN: 978-3-642-03715-3
eBook Packages: Computer ScienceComputer Science (R0)