Improving Data Availability in Chord p2p System

  • Rafał Kapelko
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7030)


In this paper we investigate the information availability in the direct union of 2 copies of chord which is the improved version of popular P2P Chord system. We present precise asymptotic formula describing the resistance to the loss of documents stored in them.

After unexpected departures of \(k=o(\sqrt{n})\) nodes from the system no information disappears with high probability probability and \(\sqrt{n}=o(k)\) unexpected departures lead to loss some data with high probability.

Our modification of Chord is very soft and requires only a small interference in the programming code of the original Chord protocol.


peer-to-peer network Chord information threshold order statistics incomplete Beta function 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Derek, L., Zhong, Y., Vivek, R., Loguinov, D.: On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks. IEEE/ACM Transactions on Networking 15, 644–656 (2007)CrossRefGoogle Scholar
  2. 2.
    Cichoń, J., Jasiński, A., Kapelko, R., Zawada, M.: How to Improve the Reliability of Chord? In: Meersman, R., Herrero, P. (eds.) OTM-WS 2008. LNCS, vol. 5333, pp. 904–913. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Park, G., Kim, S., Cho, Y., Kook, J., Hong, J.: Chordet: An Efficient and Transparent Replication for Improving Availability of Peer-to-Peer Networked Systems. In: 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, pp. 221–225 (2010)Google Scholar
  4. 4.
    Hong, F., Li, M., Yu, J.: SChord: Handling Churn in Chord by Exploiting Node Session Time. In: Zhuge, H., Fox, G.C. (eds.) GCC 2005. LNCS, vol. 3795, pp. 919–929. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    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, San Diego, California, USA, pp. 149–160 (2001)Google Scholar
  6. 6.
    Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the Evolution of Peer-to-Peer Systems. In: ACM Conference on Principles of Distributed Computing, Monterey, California, USA, pp. 233–242 (2002)Google Scholar
  7. 7.
    Arnold, B., Balakrishnan, N., Nagaraja, H.: A First Course in Order Statistics. John Wiley & Sons, New York (1992)zbMATHGoogle Scholar
  8. 8.
    Kechriniotis, A.I., Theodorou, Y.A.: New Integral Inequalities for n-Time Differentiable Functions with Applications for pdfs. Applied Mathematical Sciences 2, 353–362 (2008)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Grinshpan, A.Z.: Weighted Integral and Integro-differential Inequalities. Advances in Applied Mathematics 41, 227–246 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Flajolet, F., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)CrossRefzbMATHGoogle Scholar
  11. 11.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-addressable Network. In: SIGCOMM 2001, San Diego, California, USA, pp. 161–172 (2001)Google Scholar
  12. 12.
    Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Rafał Kapelko
    • 1
  1. 1.Institute of Mathematics and Computer ScienceWrocław University of TechnologyPoland

Personalised recommendations