Skip to main content
Log in

Towards software defined low maintenance structured peer-to-peer overlays

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Structured Peer-to-Peer (P2P) overlay networks are scalable and efficient networks. This efficiency comes at a cost as there is a need for regular maintenance of an overlay structure to handle the continuous churn of peers. This results in huge overhead in terms of maintenance traffic generated by peers. This problem becomes more critical when logical overlay topology differs from actual physical network topology, a common phenomenon in P2P overlay networks. In this paper, we present a novel approach to designing a Distributed Hash Table (DHT) based P2P overlays with the help of Software Defined Networks (SDN) concepts. SDN is an upcoming technology that provides enough flexibility in deciding application-specific network policies and rules dynamically. In our approach, we have attempted to bring the overlay topology closer to actual physical topology and reduce the maintenance traffic as much as possible. We have also tested our work on a hybrid network consisting of both virtual and physical switches. The experimental results suggest and establish the applicability of our approach.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Zodiac FX User Guide (2017). https://forums.northboundnetworks.com/downloads/zodiac_fx/guides/ZodiacFX_UserGuide_0317.pdf . Accessed 20 Oct 2019

  2. https://northboundnetworks.com/products/zodiac-fx (2019). [Online; accessed 26August-2019]

  3. http://www.oversim.org/wiki/OverSimChurn (2020). [Online; accessed 24- Oct −2020]

  4. Abdallah HBH, Louati W (2019) Ftree-cdn: hybrid cdn and p2p architecture for efficient content distribution. In: 2019 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 438–445. IEEE

  5. Banerjea S, Pandey M, Gore M, Kumar A (2020) Publish/subscribe-based p2p-cloud of underutilized computing resources for providing computation-as-a-service. Proceedings of the National Academy of Sciences, India Section A: Physical Sciences:1–10

  6. Baraglia R, Dazzi P, Guidi B, Ricci L (2012) Godel: Delaunay overlays in p2p networks via gossip. In: 2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P), pp. 1–12. IEEE

  7. Buchegger S, Schi¨oberg D, Vu LH, Datta A (2009) Peerson: P2p social networking: early experiences and insights. In: Proceedings of the Second ACM EuroSys Workshop on Social Network Systems, pp. 46–52

  8. Castro M, Costa M, Rowstron A (2004) Performance and dependability of structured peerto-peer overlays. In: null, p. 9. IEEE

  9. Castro M, Druschel P, Hu YC, Rowstron A (2003) Topology-aware routing in structured peer-to-peer overlay networks. In: Future directions in distributed computing, pp. 103–107. Springer

  10. Cuevas Rum’ın, R. (2010) Dynamic and location aware server discovery based on a fair distributed hash table

  11. Dabek F, Li J, Sit E, Robertson J, Kaashoek MF, Morris R (2004) Designing a dht for low latency and high throughput. In: NSDI 4:85–98

    Google Scholar 

  12. Dang NB, Vu ST, Nguyen HS (2009) Building a low-latency, proximity-aware dht-based p2p network. In: Knowledge and Systems Engineering, 2009. KSE’09. International Conference on, pp. 195–200. IEEE

  13. D’Angelo M, Caporuscio M (2018) Sa-chord: A self-adaptive p2p overlay network. In: 2018 IEEE 3rd International Workshops on Foundations and Applications of Self* Systems. (FAS* W), pp. 118–123. IEEE

  14. Eastlake 3rd D, Jones P (2001) Us secure hash algorithm 1 (sha1). Tech Rep

  15. El Samad M, Morvan F, Hameurlain A (2009) Resource discovery for query processing in data grids. In: ISCA PDCCS, pp. 59–66

  16. Fujita S (2011) Proximity-aware dht for efficient lookup service in peer-to-peer applications. In: Computational Science and Engineering (CSE), 2011 IEEE 14th International Conference on, pp. 464–470. IEEE

  17. Galluccio L, Morabito G, Palazzo S, Pellegrini M, Renda ME, Santi P (2007) Georoy: a location-aware enhancement to viceroy peer-to-peer algorithm. Comput Netw 51(8):1998–2014

    Article  Google Scholar 

  18. Ganesan P, Gummadi K, Garcia-Molina H (2004) Canon in g major: designing dhts with hierarchical structure. In: Distributed computing systems, 2004. proceedings. 24th international conference on, pp. 263–272. IEEE

  19. Guidi B (2020) When blockchain meets online social networks. Pervasive and Mobile Computing 62:101131

    Article  Google Scholar 

  20. Guidi B, Amft T, De Salve A, Graffi K, Ricci L (2016) Didusonet: a p2p architecture for distributed Dunbar-based social networks. Peer-to-Peer Networking and Applications 9(6):1177–1194

    Article  Google Scholar 

  21. Guidi B, Kapanova KG, Koidl K, Michienzi A, Ricci L (2020) The contextual ego network p2p overlay for the next generation social networks. Mobile Networks and Applications 25(3):1062–1074

    Article  Google Scholar 

  22. Hacini A, Amad M (2020) A new overlay p2p network for efficient routing in group communication with regular topologies. International Journal of Grid and Utility Computing 11(1):30–48

    Article  Google Scholar 

  23. Han J, Watson D, Jahanian F (2005) Topology aware overlay networks. In: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 4, pp. 2554–2565. IEEE

  24. Joung YJ, Wang JC (2007) Chord2: a two-layer chord for reducing maintenance overhead via heterogeneity. Comput Netw 51(3):712–731

    Article  Google Scholar 

  25. Kim DW, Park WR, Park CI (2007) Effect of unstable routing in location-aware mobile ad hoc networks on a geographic dht protocol. In: Parallel and Distributed Systems, 2007 International Conference on, vol. 2, pp. 1–8. IEEE

  26. Kwon M, Fahmy S (2002) Topology-aware overlay networks for group communication. In: Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video, pp. 127–136. ACM

  27. Leong B, Liskov B, Demaine ED (2006) Epichord: parallelizing the chord lookup algorithm with reactive routing state management. Comput Commun 29(9):1243–1259

    Article  Google Scholar 

  28. Li J, Stribling J, Morris R, Kaashoek MF (2005) Bandwidth-efficient management of dht routing tables. In: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation-Volume 2, pp. 99–114. USENIX Association

  29. Lua EK, Crowcroft J, Pias M, Sharma R, Lim S (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys & Tutorials 7(2):72–93

    Article  Google Scholar 

  30. McKeown N, Anderson T, Balakrishnan H, Parulkar G, Peterson L, Rexford J, Shenker S, Turner J (2008) Openflow: enabling innovation in campus networks. ACM SIGCOMM Computer Communication Review 38(2):69–74

    Article  Google Scholar 

  31. Mokadem R, Hameurlain A, Tjoa AM (2012) Resource discovery service while minimizing maintenance overhead in hierarchical dht systems. International Journal of Adaptive, Resilient and Autonomic Systems (IJARAS) 3(2):1–17

    Article  Google Scholar 

  32. Montresor A (2004) A robust protocol for building superpeer overlay topologies. In: Peer-toPeer Computing, 2004. Proceedings. Proceedings. Fourth International Conference on, pp. 202–209. IEEE

  33. Nguyen TT, Do BL (2020) A novel model using cdn, p2p, and ipfs for content delivery. In: International Conference on Future Data and Security Engineering, pp. 51–62. Springer

  34. Orebaugh A, Ramirez G, Beale J (2006) Wireshark & Ethereal network protocol analyzer toolkit. Syngress

  35. Pietzuch P, Ledlie J, Mitzenmacher M, Seltzer M (2006) Network-aware overlays with network coordinates. In: Distributed Computing Systems Workshops, 2006. ICDCS Workshops 2006. 26th IEEE International Conference on, pp. 12–12. IEEE

  36. Ratnasamy S, Handley M, Karp R, Shenker S (2002) Topologically-aware overlay construction and server selection. In: INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol. 3 , pp. 1190–1199. IEEE

  37. Rhea S, Geels D, Roscoe T, Kubiatowicz J, et al. (2004) Handling churn in a dht. In: Proceedings of the USENIX Annual Technical Conference, vol. 6, pp. 127–140. Boston, MA, USA

  38. Rowstron A, Druschel P (2001) 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, pp. 329–350. Springer

  39. Sharma P, Xu Z, Banerjee S, Lee SJ (2006) Estimating network proximity and latency. ACM SIGCOMM Computer Communication Review 36(3):39–50

    Article  Google Scholar 

  40. Shen H, Xu CZ (2006) Hash-based proximity clustering for load balancing in heterogeneous dht networks. In: Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International, pp. 10–pp. IEEE

  41. Shukla N, Bamal A, Srivastava S, Pandey M (2018) Software defined underlay-aware structured peer-to-peer overlay. In: Proceedings of the 19th International Conference on Distributed Computing and Networking, p. 52. ACM

  42. Sterbini A, Temperini M (2011) Socialx: reputation based support to social collaborative learning through exercise sharing and project teamwork. International Journal of Information Systems and Social Change (IJISSC) 2(1):64–79

    Article  Google Scholar 

  43. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Computer Communication Review 31(4):149–160

    Article  Google Scholar 

  44. Subratie K, Aditya S, Daneshmand V, Ichikawa K, Figueiredo R (2020) On the design and implementation of ip-over-p2p overlay virtual private networks. IEICE Trans Commun 103(1):2–10

    Article  Google Scholar 

  45. Tian, R., Xiong, Y., Zhang, Q., Li, B., Zhao, B.Y., Li, X. (2005) Hybrid overlay structure based on random walks. In: International Workshop on Peer-to-Peer Systems, pp. 152–162. Springer

  46. Waldvogel M, Rinaldi R (2003) Efficient topology-aware overlay network. ACM SIGCOMM Computer Communication Review 33(1):101–106

    Article  Google Scholar 

  47. Wu J, Liu B, Zhang S, et al. (2008) Peercdn: A novel p2p network assisted streaming content delivery network scheme. In: 2008 8th IEEE International Conference on Computer and Information Technology, pp. 601–606. IEEE

  48. Wu W, Chen Y, Zhang X, Shi X, Cong L, Deng B, Li X (2008) Ldht: Locality-aware distributed hash tables. In: Information Networking, 2008. ICOIN 2008. International Conference on, pp. 1–5. IEEE

  49. Xu Z, Min R, Hu Y (2003) Reducing maintenance overhead in dht based peer-to-peer algorithms. In: Peer-to-Peer Computing, 2003. (P2P 2003). Proceedings. Third International Conference on, pp. 218–219. IEEE

  50. Zhou S, Ganger GR, Steenkiste PA (2003) Location-based node ids: enabling explicit locality in dhts

    Google Scholar 

Download references

Acknowledgements

This work has been supported by the Ministry of Electronics and Information Technology, Government of India under project named Visvesvaraya PhD Scheme, Implementation No. PhD-MLA-4(20)/2014.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nitin Shukla.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shukla, N., Datta, D., Pandey, M. et al. Towards software defined low maintenance structured peer-to-peer overlays. Peer-to-Peer Netw. Appl. 14, 1242–1260 (2021). https://doi.org/10.1007/s12083-021-01112-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-021-01112-7

Keywords

Navigation