Skip to main content
Springer Nature Link
Log in

Evaluation of alternatives for the broadcast operation in Kademlia under churn

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

Abstract

During recent years, considerable effort has been devoted to the enhancement of Distributed Hash Table (DHT) systems with broadcasting capabilities. Such systems typically provide individual node routing but a broadcast primitive is required for functionalities such as information dissemination or data aggregation. Broadcasting can also be used as the basis for partial keyword searches. Little work has however specifically addressed Kademlia, a well known DHT, used in real applications. Our work exposes the particularities of this system, notably its XOR-based distance metrics, and analytically studies what broadcasting techniques can be applied to it. A model that estimates node coverage as a function of the probability that individual messages reach their destination has been also developed. For validation, several broadcasting algorithms have been implemented and comprehensively evaluated, considering node coverage, messages to nodes ratio, latency and imbalance factor. Moreover, several techniques are proposed to enhance the bare protocols when adverse circumstances such as churn and failure rate conditions are present. These include redundancy, resubmissions or flooding, and also combinations of those. All have been implemented and fully tested. An analysis of the strengths and weaknesses of algorithms and additional techniques, and a discussion on the choices and compromises to make, depending on system characteristics or application priorities, is finally presented.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

Notes

  1. We use λ instead of the original K, not to confuse with Kademlia’s K contacts per bucket.

References

  1. Balakrishnan H, Kaashoek M, Karger D, Morris R, Stoica I (2003) Looking up data in P2P systems. Commun ACM 46(2):43–48

    Article  Google Scholar 

  2. Crosby S, Wallach D (2007) An analysis of BitTorrent’s two Kademlia-based DHTs. Tech. rep., Technical Report TR07-04 Rice University

  3. Czirkos Z, Hosszú G (2013) Solution for the broadcasting in the Kademlia peer-to-peer overlay. Comput Networks 57(8): 1853–1862. doi:10.1016/j.comnet.2013.02.021

    Article  Google Scholar 

  4. Delgado Peris A, Hernández JM, Huedo E (2012) Evaluation of the broadcast operation in Kademlia. In: Min G, Hu J, Liu LC, Yang LT, Seelam S, Lefevre L (eds) IEEE 14th International Conference on High Performance Computing and Communication & IEEE 9th Intl. Conf. on Embedded Software and Systems (HPCC-ICESS). IEEE Computer Society, pp 756–763

  5. Delgado Peris A, Hernández JM, Huedo E (2014) Distributed scheduling and data sharing in late-binding overlays, International Conference on High Performance Computing Simulation (HPCS), 2014 , pp 129–136

  6. El-Ansary S, Alima L, Brand P, Haridi S (2003) Efficient broadcast in structured P2P networks 2nd International Workshop On Peer-To-Peer Systems (IPTPS’03). Springer, pp 304–314

  7. Ghodsi A, Onana Alima L, El-Ansary S, Brand P, Haridi S (2003) Self-correcting broadcast in distributed hash tables 15th IASTED International Conference, Parallel and Distributed Computing and Systems (PDCS). ACTA Press

  8. Hasham K, Delgado Peris A et al (2011) CMS workflow execution using intelligent job scheduling and data access strategies. Nuclear Science. IEEE Trans 58(3):1221–1232

    Google Scholar 

  9. Huang K, Zhang D (2010) Dht-based lightweight broadcast algorithms in large-scale computing infrastructures. Future Gen Comput Sys 26(3):291–303

    Article  Google Scholar 

  10. Li J, Sollins K, Lim D (2005) Implementing aggregation and broadcast over distributed hash tables. ACM SIGCOMM Comput Commun Rev 35(1):81–92

    Article  Google Scholar 

  11. Li W, Chen S, Zhou P, Li X, Li Y (2007) An efficient broadcast algorithm in distributed hash table under churn International Conference on Wireless Communications, Networking and Mobile Computing (WiCom), 2007, pp 1929–1932. IEEE

  12. Lin F, Henricsson C, Abbas S, Sandkuhl K (2009) Hypercircle: An efficient broadcast protocol for super-peer P2P networks International Conference on Computational Science and Engineering (CSE), 2009, vol 2, pp 426–433. IEEE

  13. Maymounkov P, Mazieres D (2002) Kademlia: A peer-to-peer information system based on the XOR metric Revised Papers from the First International Workshop on Peer-to-Peer Systems (IPTPS ’01). Springer-Verlag, London, pp 53–65

    Google Scholar 

  14. Merz P, Gorunova K (2005) Efficient broadcast in P2P grids, IEEE International Symposium on Cluster Computing and the Grid (CCGrid), 2005, vol 1, IEEE

  15. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. ACM SIGCOMM Comput Commun Rev 31(4):161–172

    Article  Google Scholar 

  16. Rowstron A, Druschel P (2001) Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems Middleware 2001

  17. Stoica I, Morris R, Karger D, Kaashoek M, Balakrishnan H. (2001) Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Comput Commun Rev 31(4):149–160

    Article  Google Scholar 

  18. Wahlisch M, Schmidt T, Wittenburg G (2009) Broadcasting in prefix space: P2P data dissemination with predictable performance Fourth International Conference on Internet and Web Applications and Services (ICIW’09), IEEE

Download references

Acknowledgments

We acknowledge the funding support provided by the Spanish funding agency SEIDI, through the grant FPA2010-21638-C02-02.

Author information

Authors and Affiliations

  1. CIEMAT. Av. Complutense, 40, 28040, Madrid, Spain

    Antonio Delgado Peris & José M. Hernández

  2. Facultad de Informática, Universidad Complutense de Madrid (UCM), Madrid, Spain

    Eduardo Huedo

Authors
  1. Antonio Delgado Peris
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José M. Hernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eduardo Huedo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonio Delgado Peris.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Delgado Peris, A., Hernández, J.M. & Huedo, E. Evaluation of alternatives for the broadcast operation in Kademlia under churn. Peer-to-Peer Netw. Appl. 9, 313–327 (2016). https://doi.org/10.1007/s12083-015-0338-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-015-0338-y

Keywords