Churn Handling Strategies to Support Dependable and Survivable Structured Overlay Networks

References

• Y. Hassanzadeh-Nazarabadi, A. Küpçü, and O. Ozkasap, “Decentralized utility-and locality-aware replication for heterogeneous DHT-based P2P cloud storage systems,” IEEE Trans. Parallel Distrib. Syst., Vol. 31, no. 5, pp. 1183–93, 2019. doi:https://doi.org/10.1109/TPDS.2019.2960018
   Google Scholar
• B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph. “Tapestry: An infrastructure for fault-tolerant wide-area location and routing”, Technical Report, 2001. UCB//CSD-01-1141, U. C. Berkeley.
   Google Scholar
• A. Rowstron, and P. Druschel. “Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems”, In IFIP/ACM International Conference on Distributed Systems Platforms and Open Distributed Processing, Berlin, Heidelberg, 2001, pp. 329–50.
   Google Scholar
• I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: a scalable peer-to-peer lookup protocol for internet applications,” IEEE Transactions on Networking (TON, Vol. 11, no. 1, pp. 17–32, 2003. doi:https://doi.org/10.1109/TNET.2002.808407
   Web of Science ®Google Scholar
• M. F. Kaashoek, and D. R. Karger. “Koorde: A simple degree-optimal distributed hash table”, In International Workshop on Peer-to-Peer Systems, Berkeley, CA, USA, 2003, pp. 98–107.
   Google Scholar
• L. O. Alima, S. El-Ansary, P. Brand, and S. Haridi. “DKS (N, k, f): a family of low communication, scalable and fault-tolerant infrastructures for P2P applications”, in 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, Tokyo, Japan, 2003, pp. 344–50.
   Google Scholar
• K. Aberer, P. Cudré-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt, “P-Grid: a self-organizing structured P2P system,” ACM SIGMOD Record, Vol. 32, no. 3, pp. 29–33, 2003. doi:https://doi.org/10.1145/945721.945729
   Google Scholar
• M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. “Topology-aware routing in structured peer-to-peer overlay networks”, in Future directions in distributed computing, Bertinoro, Italy, 2003, pp. 103–7.
   Google Scholar
• A. Ghodsi, L. O. Alima, and S. Haridi. “Low-bandwidth topology maintenance for robustness in structured overlay networks”, in Proceedings of the IEEE 38th Annual Hawaii International Conference on System Sciences, Big Island, HI, USA, 2005, pp. 302a–12a.
   Google Scholar
• B. Leong, B. Liskov, and E. D. Demaine, “Epichord: parallelizing the chord lookup algorithm with reactive routing state management,” Comput. Commun., Vol. 29, no. 9, pp. 1243–59, 2006. doi:https://doi.org/10.1016/j.comcom.2005.10.002
   Google Scholar
• B. Porter, F. Taiani, and G. Coulson. “Generalized repair for overlay networks”, in 25th IEEE Symposium on Reliable Distributed Systems, Leeds, UK, 2006, pp. 132–42.
   Google Scholar
• G. Ghinita, and Y. M. Teo. An adaptive stabilization framework for distributed hash tables”, in IEEE 20th International Parallel and Distributed Processing Symposium, Rhodes Island, Greece, 2006, pp. 10–20.
   Google Scholar
• S. Krishnamurthy, S. El-Ansary, E. Aurell, and S. Haridi. “Comparing maintenance strategies for overlays”, in the 16th IEEE Euro micro Conference on Parallel, Distributed and Network-Based Processing, Toulouse, France, 2008, pp. 473–82.
   Google Scholar
• J. Kurian, and K. Sarac, “A survey on the design, applications, and enhancements of application-layer overlay networks,” ACM Computing Surveys (CSUR, Vol. 43, no. 1, pp. 5–35, 2010. doi:https://doi.org/10.1145/1824795.1824800
   Google Scholar
• W. C. Chung, C. J. Hsu, K. C. Lai, K. C. Li, and Y. C. Chung, “Maintenance of cooperative overlays in multi-overlay networks,” IET Commun., Vol. 8, no. 15, pp. 2676–83, 2014. doi:https://doi.org/10.1049/iet-com.2013.0709
   Google Scholar
• A. Malatras, “State-of-the-art survey on P2P overlay networks in pervasive computing environments,” J. Netw. Comput. Appl., Vol. 55, pp. 1–23, 2015. doi:https://doi.org/10.1016/j.jnca.2015.04.014
   Web of Science ®Google Scholar
• C. Selvaraj, and S. Anand, “A survey on security issues of reputation management systems for peer-to-peer networks,” Computer Science Review, Vol. 6, no. 4, pp. 145–60, 2012. doi:https://doi.org/10.1016/j.cosrev.2012.04.001
   Google Scholar
• M. Feldmann, C. Scheideler, and S. Schmid, “Survey on algorithms for self-Stabilizing overlay networks,” ACM Computing Surveys (CSUR, Vol. 53, no. 4, pp. 1–24, 2020. doi:https://doi.org/10.1145/3397190
   Google Scholar
• Z. Trifa, and M. Khemakhem, ““Taxonomy of structured p2p overlay networks security attacks”, world Academy of science,” Engineering and Technology, Vol. 6, no. 4, pp. 469–75, 2012.
   Google Scholar
• R. Kaur, A. L. Sangal, and K. Kumar, ““Churn handling strategies for structured overlay networks: A Survey”, J Multiagent grid Systems, Vol. 13, no. 4, pp. 331–51, 2017. doi:https://doi.org/10.3233/MGS-170274
   Google Scholar
• A. Poenaru, R. Istrate, and F. Pop, “AFT: adaptive and fault tolerant peer-to-peer overlay—A user-centric solution for data sharing,” Future Gener. Comput. Syst., Vol. 80, pp. 583–95, 2018. doi:https://doi.org/10.1016/j.future.2016.05.022
   Google Scholar
• F. Boustanifar, and Z. Movahedi. “A trust-based offloading for mobile M2M communications”, In Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress, 2016, pp. 1139–1143.
   Google Scholar
• K. Sonbol, O. Ozkasap, I. Al-Oqily, and M. Aloqaily, “EdgeKV: decentralized, scalable and consistent storage for the edge,” J. Parallel. Distrib. Comput., Vol. 144, pp. 28–40, 2020. doi:https://doi.org/10.1016/j.jpdc.2020.05.009
   Google Scholar
• N. Ramzan, H. Park, and E. Izquierdo, “Video streaming over P2P networks: challenges and opportunities,” Signal Process., Image Commun., Vol. 27, no. 5, pp. 401–11, 2012. doi:https://doi.org/10.1016/j.image.2012.02.004
   Google Scholar
• S. Keshav, “Paradoxes of Internet architecture,” IEEE Internet Comput., Vol. 22, no. 1, pp. 96–102, 2018. doi:https://doi.org/10.1109/MIC.2018.011581523
   Google Scholar
• B. Cohen. “Incentives build robustness in Bit Torrent”, in Workshop on Economics of Peer-to-Peer systems, Berkeley, CA, USA, Vol. 6, 2003, pp. 68–72.
   Google Scholar
• S. Tetarave, S. Tripathy, and R. Ghosh, “Enhancing quality of experience using peer-to-peer overlay on device-to-device communications,” Int. J. Commun Syst, Vol. 33, no. 15, pp. 1–18, 2020.
   Web of Science ®Google Scholar
• X. Qi, M. Qiang, and L. Liu, “A balanced strategy to improve data invulnerability in structured P2P system,” Peer-to-Peer Networking and Applications, Vol. 13, no. 1, pp. 368–87, 2020. doi:https://doi.org/10.1007/s12083-019-00773-9
   Google Scholar
• T. Wang, and M. Wang, “Distributed collaborative filtering recommendation algorithm based on DHT,” Cluster. Comput., Vol. 22, no. 2, pp. 2931–41, 2019. doi:https://doi.org/10.1007/s10586-018-1699-9
   Google Scholar
• H. S. Nguyen, D. N. Nguyen, and S. Sugawara, “A dynamic-clustering backup scheme for high-availability distributed File sharing Systems,” IEICE Trans. Commun., Vol. E102.B, no. 3, pp. 545–56, 2019. doi:https://doi.org/10.1587/transcom.2018EBP3108
   Google Scholar
• D. Sandler, A. Mislove, A. Post, and P. Druschel. “Feedtree: Sharing web micro news with peer-to-peer event notification”, In International Workshop on Peer-to-Peer Systems, Ithaca, NY, USA, 2005, pp. 141–51.
   Google Scholar
• B. Javadi, and K. M. Matawie, “Modelling of correlated resources availability in distributed computing systems,” Simul. Model. Pract. Theory., Vol. 82, pp. 147–59, 2018. doi:https://doi.org/10.1016/j.simpat.2017.12.017
   Google Scholar
• R. Kaur, A. L. Sangal, and K. Kumar, “Modelling and simulation of adaptive Neuro-fuzzy based intelligent system for predictive stabilization in structured overlay networks,” Engineering Science and Technology, an International Journal, Vol. 20, no. 1, pp. 310–320, 2017. doi:https://doi.org/10.1016/j.jestch.2016.06.015
   Google Scholar
• R. Kaur, A. L. Sangal, and K. Kumar. “Performance analysis of predictive stabilization for churn handling in structured overlay networks”, in Proceedings of the International Conference on Big Data and Advanced Wireless Technologies, Bulgaria, 2016, pp. 39–45.
   Google Scholar
• R. Kaur, A. L. Sangal, and K. Kumar. “Analysis of different churn models in chord-based overlay networks”, in Proceedings of Recent Advances in Engineering and Computational Sciences (RAECS), Chandigarh, India, 2014, pp. 1–6.
   Google Scholar
• R. Kaur, A. L. Sangal, and K. Kumar, “A persistent structured hierarchical overlay network to counter intentional churn attack,” Journal of Computer Networks and Communications, Vol. 2016, pp. 4–14, 2016.
   Web of Science ®Google Scholar
• P. Linga, I. Gupta, and K. Birman. “A churn-resistant peer-to-peer web caching system”, in Proceedings of the ACM workshop on Survivable and self-regenerative systems: in association with the 10th ACM Conference on Computer and Communications Security, Washington, DC, USA, pp. 1–10.
   Google Scholar
• J. Saia, A. Fiat, S. D. Gribble, A. R. Karlin, and S. Saroiu, “Dynamically fault-tolerant content addressable networks,” In Peer to Peer Systems, Vol. 1, pp. 270–9, 2002. doi:https://doi.org/10.1007/3-540-45748-8_26
   Google Scholar
• F. Kuhn, S. Schmid, and R. Wattenhofer, “Towards worst-case churn resistant peer-to-peer systems,” Distrib. Comput., Vol. 22, no. 4, pp. 249–67, 2010. doi:https://doi.org/10.1007/s00446-010-0099-z
   Google Scholar
• J. C. Chu, K. S. Labonte, and B. N. Levine, “Availability and locality measurements of peer-to-peer file systems”, In ITCom: The Convergence of Information Technologies and Communications, Boston, MA, United States, 2002, pp. 310–21.
   Google Scholar
• R. Bhagwan, S. Savage, and G. Voelker. “Understanding availability”, International Workshop on Peer-to-Peer Systems II, Berkeley, CA, USA, 2003, pp. 256–67.
   Google Scholar
• J. R. Douceur, “Is remote host availability governed by a universal law?,” ACM SIGMETRICS Performance Evaluation Review, Vol. 31, no. 3, pp. 25–9, 2003. doi:https://doi.org/10.1145/974036.974039
   Google Scholar
• M. Castro, M. Costa, and A. Rowstron. “Performance and dependability of structured peer-to-peer overlays”, in IEEE International Conference on Dependable Systems and Networks, Florence, Italy, 2004, pp. 9–18.
   Google Scholar
• S. Guha, N. Daswani, and R. Jain. “An experimental study of the Skype peer-to-peer voip system”, in Proceedings of the 5th International Workshop on Peer-to-Peer Systems (IPTPS ‘06), Santa Barbara, USA, 2005, pp. 1–6.
   Google Scholar
• J. W. Mickens, and B. D. Noble. “Exploiting availability prediction in distributed systems”, in Proceedings of the 3rd conference on Networked Systems Design & Implementation, San Jose, CA, USA,Vol. 3, 2006, pp.6–6.
   Google Scholar
• B. Javadi, D. Kondo, J. M. Vincent, and D. P. Anderson. “Mining for availability models in large-scale distributed systems: A case study of seti@ home”, IEEE International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems, London, United Kingdom, 2009, pp. 276–83.
   Google Scholar
• S. Saroiu, P. K. Gummadi, and S. D. Gribble. , “Measurement study of peer-to-peer file sharing systems.” in Electronic Imaging International Society for Optics and Photonics, 2002, pp. 156–170.
   Google Scholar
• D. Stutzbach, and R. Rejaie. “Understanding churn in peer-to-peer networks.” in Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, Rio de Janeiro, Brazil, 2006, pp. 189–202.
   Google Scholar
• S. L. Blond, F. L. Fessant, and E. L. Merrer. Finding good partners in availability-aware P2P Networks”, Anglais. Tech. rep. RR-6795. INRIA, 2009, p. 17. URL: http://hal.inria.fr/inria-00352529.
   Google Scholar
• A. Pace, V. Quema, and V. Schiavoni. “Exploiting node connection regularity for DHT replication”, in IEEE Symposium on Reliable Distributed Systems, 2011, pp. 111–20. ISSN: 1060-9857.
   Google Scholar
• G. Song, S. Kim, and D. Seo. “Replica placement algorithm for highly available peer-to-peer storage systems”, in Proceedings of the First International Conference on Advances in P2P Systems. AP2PS ‘09. Washington, DC, USA, 2009, pp. 160–7.
   Google Scholar
• S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. “A scalable content-addressable network”, in Proceedings of the ACM SIGCOMM Computer Communication Review, San Diego, California, USA, Vol. 31, no. 4, 2001, pp. 161–172.
   Google Scholar
• K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. “The impact of DHT routing geometry on resilience and proximity”, In Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications, Karlsruhe, Germany, 2003, pp. 381–94.
   Google Scholar
• D. Loguinov, A. Kumar, V. Rai, and S. Ganesh. “Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience”, in Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications, Karlsruhe, Germany, 2003, pp. 395–406.
   Google Scholar
• Z. Liu, R. Yuan, Z. Li, H. Li, and G. Chen, “ Survive under high churn in structured P2P systems: Evaluation and strategy”, Computational Science–ICCS, UK, 2006, pp. 404–11.
   Google Scholar
• B. G. Chun, B. Y. Zhao, and J. D. Kubiatowicz. “Impact of neighbor selection on performance and resilience of structured P2P networks”, in International Workshop on Peer-to-Peer Systems, Ithaca, NY, USA, 2005, pp. 264–74.
   Google Scholar
• G. S. Manku, M. Naor, and U. Wieder. “Know the neighbour’s neighbour: the power of look ahead in randomized P2P networks”, in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, 2004, pp. 54–63.
   Google Scholar
• P. Godfrey, S. Shenker, and I. Stoica. “Minimizing churn in distributed systems”, in Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, Pisa, Italy, Vol. 36, no. 4, 2006, pp. 147–58.
   Google Scholar
• J. Li, J. Stribling, R. Morris, and M. F. Kaashoek. “Bandwidth-efficient management of DHT routing tables”, in Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation, Boston, MA, USA, Vol. 2, 2005, pp. 99–114.
   Google Scholar
• H. Zhang, A. Goel, and R. Govindan. “Incrementally improving lookup latency in distributed hash table systems”, in ACM SIGMETRICS Performance Evaluation Review, Vol. 31, no. 1, 2003, pp. 114–25.
   Google Scholar
• X. Meng, X. Chen, and Y. Ding, “Using the complementary nature of node joining and leaving to handle churn problem in P2P networks,” Comput. Electr. Eng., Vol. 39, no. 2, pp. 326–37, 2013. doi:https://doi.org/10.1016/j.compeleceng.2012.11.001
   Google Scholar
• P. Maymounkov, and D. Mazieres. “Kademlia: A peer-to-peer information system based on the XOR metric”, in International Workshop on Peer-to-Peer Systems, Cambridge, MA, USA, 2002, pp. 53–65.
   Google Scholar
• D. Wu, Y. Tian, and K. W. Ng, “An analytical study on optimizing the lookup performance of distributed hash table systems under churn,” Concurrency and Computation: Practice and Experience, Vol. 19, no. 4, pp. 543–69, 2007. doi:https://doi.org/10.1002/cpe.1152
   Google Scholar
• X. Li, J. Misra, and C. G. Plaxton, “Active and concurrent topology maintenance”, in International Symposium on Distributed Computing, Amsterdam, Netherland, 2004, pp. 320–34.
   Google Scholar
• E. Sit, and R. Morris. “Security considerations for peer-to-peer distributed hash tables”, in International Workshop on Peer-to-Peer Systems, Cambridge, MA, USA, 2002, pp. 261–9.
   Google Scholar
• M. Srivatsa, and L. Liu. “Vulnerabilities and security threats in structured overlay networks: A quantitative analysis”, in 20th Annual Computer Security Applications Conference, Tucson, AZ, USA, 2004, pp. 252–61.
   Google Scholar
• B. Pretre. “Attacks on peer-to-peer networks”, Department of Computer Science, Swiss Federal Institute of Technology (ETH) Zurich, 2005.
   Google Scholar
• Y. K. Kwok, “Autonomic peer-to-peer systems: Incentive and security issues”, in Autonomic Computing and Networking, Y. Zhang, L. Yang, and M. Denko Eds. Boston, MA: Springer, 2009, pp. 205–236. doi:https://doi.org/10.1007/978-0-387-89828-5_9.
   Google Scholar
• S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, ““Handling churn in a DHT”, in proceedings of the USENIX Annual Technical conference, Boston, MA,” USA, Vol. 6, 2004, pp. 127–40.
   Google Scholar
• M. E. Dick, E. Pacitti, R. Akbarinia, and B. Kemme, “Building a peer-to-peer content distribution network with high performance, scalability and robustness,” Inf. Syst., Vol. 36, no. 2, pp. 222–47, 2011. doi:https://doi.org/10.1016/j.is.2010.08.007
   Google Scholar
• B. B. Yang, and H. Garcia-Molina. “Designing a super-peer network”, in Proceedings of the 19th IEEE International Conference on Data Engineering, Bangalore, India, 2003, pp. 49–60.
   Google Scholar
• L. Garces-Erice, E. W. Biersack, K. W. Ross, P. A. Felber, and G. Urvoy-Keller, “Hierarchical peer-to-peer systems,” Parallel. Process. Lett., Vol. 13, no. 04, pp. 643–57, 2003. doi:https://doi.org/10.1142/S0129626403001574
   Google Scholar
• W. Nejdl, M. Wolpers, W. Siberski, C. Schmitz, M. Schlosser, I. Brunkhorst, and A. Löser. “Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks”, in Proceedings of the 12th international conference on World Wide Web, Budapest, Hungary, 2003, pp. 536–43.
   Google Scholar
• J. Sacha, J. Dowling, R. Cunningham, and R. Meier. “Discovery of stable peers in a self-organising peer-to-peer gradient topology”, in IFIP International Conference on Distributed Applications and Interoperable Systems, Bologna, Italy, 2006, pp. 70–83.
   Google Scholar
• S. Zöls, Q. Hofstätter, Z. Despotovic, and W. Kellerer. “Achieving and maintaining cost-optimal operation of a hierarchical DHT system”, in Proceedings of the IEEE international conference on Communications, Dresden, Germany, 2009, pp. 2194–9.
   Google Scholar
• Z. Trifa, and M. Khemakhem, “A novel replication technique to attenuate churn effects,” Peer-to-Peer Networking and Applications, Vol. 9, no. 2, pp. 344–55, 2016. doi:https://doi.org/10.1007/s12083-015-0340-4
   Google Scholar
• D. Korzun, and A. Gurtov, “Hierarchical architectures in structured peer-to-peer overlay networks,” Peer-to-Peer Networking and Applications, Vol. 7, no. 4, pp. 359–95, 2014. doi:https://doi.org/10.1007/s12083-013-0200-z
   Google Scholar
• T. Koskela, E. Harjula, O. Kassinen, and M. Ylianttila. “Robustness of a P2P community management system based on two-level hierarchical DHT overlays”, in IEEE Symposium on Computers and Communications (ISCC), 2011, pp. 881–6.
   Google Scholar
• J. Mariela, B. Rocamora, J. Rhodette, and I. Pedrasa, “Evaluation of hierarchical DHTs to mitigate churn effects in mobile networks,” Comput. Commun., Vol.85, pp. 41–57, 2016. doi:https://doi.org/10.1016/j.comcom.2016.02.003
   Google Scholar
• P. Ganesan, K. Gummadi, and H. Garcia-Molina. “Canon in G major: designing DHTs with hierarchical structure”, in proceedings of the 24th international conference on Distributed computing systems, Tokyo, Japan, 2004, pp. 263–72.
   Google Scholar
• M. J. Freedman, K. Lakshminarayanan, and I. Stoica. “Non-Transitive Connectivity and DHTs”, in WORLDS, Vol. 5, 2005, pp. 10–10.
   Google Scholar
• A. Ghodsi. “Distributed k-ary system: Algorithms for distributed hash tables”, Doctoral dissertation, The Royal Institute of Technology, 2006.
   Google Scholar
• T. M. Shafaat. “Partition tolerance and data consistency in structured overlay networks”, Doctoral dissertation, KTH, School of Information and Communication Technology (ICT), 2013.
   Google Scholar
• R. R. Paul, P. V. Roy, and V. Vlassov. “Interaction between network partitioning and churn in a self-healing structured overlay network”, in 21st International Conference on Parallel and Distributed Systems (ICPADS),” Melbourne, Victoria, Australia, 2015, pp. 232–41.
   Google Scholar
• R. Paul, J. Melchior, P. V. Roy, and V. Vlassov. “Designing distributed applications using a phase-aware, reversible system.”, in IEEE International Conference on Edge Computing (EDGE), 2017, pp. 55–64.
   Google Scholar