Skip to main content
SpringerLink
Log in

Towards Fault-Tolerant Chord P2P System: Analysis of Some Replication Strategies

  • Conference paper
Book cover Web Technologies and Applications (APWeb 2013)

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

Included in the following conference series:

Abstract

In Peer-to-peer systems the process of unexpected nodes failures becomes critical. When some nodes depart from the network without uploading gathered information into the system, some data which are stored on the departed nodes will not be available. In our paper we address this issue for Chord-based P2P systems. We investigate two replication schemes: successor list and multiple Chord rings. We propose a novel analytical model to describe the process of unexpected nodes failures for investigated replication scheme. Let ε > 0. Let d be replication degree in Chord with successor-list replication. We prove that for large n after failure of \(n^{1-\frac{1}{d}-\epsilon}\) nodes from Chord with successor list replication no document is lost with high probability. We also prove that for k multiple chord rings after unexpected departures of \(\frac{n^{1-\frac{1}{k}}}{n^{\frac{1}{2k}}}\) nodes, the system stays in safe configuration with high probability. As a practical illustration of our detailed theoretical analysis of replication schemes we discuss the recovery mechanism of partially lost information. We show how the system fault tolerance changes depending of different replica degree.

Supported by grant nr 2012/S20027 of the Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Chen, S., Li, Y., Rao, K., Zhao, L., Li, T., Chen, S.: Building a scalable P2P network with small routing delay. In: Zhang, Y., Yu, G., Bertino, E., Xu, G. (eds.) APWeb 2008. LNCS, vol. 4976, pp. 456–467. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. Cichoń, J., Kapelko, R., Marchwicki, K.: Brief announcement: A note on replication of documents. In: Défago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 439–440. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Cooper, R.B.: Introduction To Queueing Theory, 2nd edn. Elsevier North Holland, Inc. (1981)

    Google Scholar 

  5. Dabek, F., Kaashoek, M., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storgae with cfs. In: 18th ACM Symposium on Operating Systems Principles (SOSP), New York, USA, pp. 202–215 (2001)

    Google Scholar 

  6. 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 5(15), 644–656 (2007)

    Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. Flocchini, P., Nayak, A., Xie, M.: Hybrid-chord: A peer-to-peer system based on chord. In: Ghosh, R.K., Mohanty, H. (eds.) ICDCIT 2004. LNCS, vol. 3347, pp. 194–203. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Flocchini, P., Nayak, A., Xie, M.: Enhancing peer-to-peer systems through redundancy. IEEE Journal on Selected Areas in Communications 1(25), 15–24 (2007)

    Article  Google Scholar 

  10. Ghodsi, A., Alima, L.O., Haridi, S.: Symmetric replication for structured peer-to-peer systems. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2005 and DBISP2P 2006. LNCS, vol. 4125, pp. 74–85. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. 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 

  12. Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage systems. ACM SIGOPS Operating Systems Review 2(44), 35–40 (2010)

    Article  Google Scholar 

  13. Li, Z., Hwang, K.: Churn resilient protocol for massive data dissemination in p2p networks. IEEE Transactions on Parallel and Distributed Systems 22, 1342–1349 (2011)

    Article  Google Scholar 

  14. 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 

  15. Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Pitoura, T., Ntarmos, N., Triantafillou, P.: Replication, load balancing and efficient range query processing in dHTs. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 131–148. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. 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 

  18. Rieche, S., Wehrle, K., Landsiedel, O., Götz, S., Petrak, L.: Reliability of data in structured peer-to-peer systes. In: HOT-P2P 2004, Volendam, The Netherland, pp. 108–113 (2004)

    Google Scholar 

  19. Kapelko, R.: Towards efficient replication of documents in chord: Case (r,s) erasure codes. In: Liu, B., Ma, M., Chang, J. (eds.) ICICA 2012. LNCS, vol. 7473, pp. 477–483. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  20. Shafaat, T.M., Ahmad, B., Haridi, S.: ID-replication for structured peer-to-peer systems. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds.) Euro-Par 2012. LNCS, vol. 7484, pp. 364–376. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  21. 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 

  22. Vu, Q., Lupu, M., Ooi, B.: Peer-to-Peer Computing. Springer (2010)

    Google Scholar 

  23. Wang, C., Harfoush, K.: On the stability-scalability tradeoff of dht deployment. In: INFOCOM 2007, 26th IEEE International Conference on Computer Communications, Anchorage, Alaska, USA, pp. 2207–2215 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science Faculty of Fundamental Problems of Technology, Wrocław University of Technology, Poland

    Rafał Kapelko

Authors
  1. Rafał Kapelko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Engineering, Nagoya University, 464-8601, Nagoya, Japan

    Yoshiharu Ishikawa

  2. Department of Computer Science and Technology, Harbin Institute of Technology, 150006, Harbin, China

    Jianzhong Li

  3. School of Computer Science and Engineering, University of New South Wales, 2031, Sydney, NSW, Australia

    Wei Wang  & Wenjie Zhang  & 

  4. Department of Computing and Information Systems, University of Melbourne, 3052, Melbourne, VIC, Australia

    Rui Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kapelko, R. (2013). Towards Fault-Tolerant Chord P2P System: Analysis of Some Replication Strategies. In: Ishikawa, Y., Li, J., Wang, W., Zhang, R., Zhang, W. (eds) Web Technologies and Applications. APWeb 2013. Lecture Notes in Computer Science, vol 7808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37401-2_67

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37401-2_67

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37400-5

  • Online ISBN: 978-3-642-37401-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation