Abstract
Kademlia is considered to be one of the most effective key based routing protocols. It is nowadays implemented in many file sharing peer-to-peer networks such as BitTorrent, KAD, and Gnutella.
This paper introduces Shades, a combined routing/caching scheme that significantly shortens the average lookup process in Kademlia and improves its load handling. The paper also includes an extensive performance study demonstrating the benefits of Shades and compares it to other suggested alternatives using both synthetic workloads and traces from YouTube and Wikipedia.
This work is partially supported by the Technion HPI Research School.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
OpenKad, http://code.google.com/p/openkad/
Shades source code, https://code.google.com/p/shades/
Abraham, I., Badola, A., Bickson, D., Malkhi, D., Maloo, S., Ron, S.: Practical locality-awareness for large scale information sharing. In: van Renesse, R., Castro, M. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 173–181. Springer, Heidelberg (2005)
Androutsellis-Theotokis, S., Spinellis, D.: A Survey of P2P Content Distribution Technologies. ACM Computing Survey 36, 335–371 (2004)
Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and zipf-like distributions: Evidence and implications. In: INFOCOM, pp. 126–134 (1999)
Cheng, X., Dale, C., Liu, J.: Statistics and social network of youtube videos. In: 16th Int. Workshop on Quality of Service, IWQoS 2008, pp. 229–238 (June 2008)
DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: Amazon’s highly available key-value store. SIGOPS Oper. Syst. Rev. 41(6), 205–220 (2007)
Einziger, G., Friedman, R.: Tinylfu: A highly efficient cache admission policy. In: 22nd Euromicro Int. Conf. on Parallel, Distributed and Network-Based Processing (PDP), pp. 146–153 (February 2014)
Einziger, G., Friedman, R., Kibbar, E.: Kaleidoscope: Adding colors to kademlia. In: Proc. of the 13th IEEE Int. Conf. on P2P Computing (September 2013)
Freedman, M.J., Freudenthal, E., Mazières, D.: Democratizing content publication with coral. In: Symposium on Networked Systems Design and Implementation, NSDI 2004, pp. 18–18. USENIX Association, Berkeley (2004)
Groß, C., Stingl, D., Richerzhagen, B., Hemel, A., Steinmetz, R., Hausheer, D.: Geodemlia: A robust p2p overlay supporting location-based search. In: Proc. of the 12th IEEE Int. Conf. on P2P Computing. IEEE (September 2012)
Guangmin, L.: An Improved Kademlia Routing Algorithm for P2P Network. In: Int. Conf. on New Trends in Information and Service Science, pp. 63–66 (2009)
Gupta, A., Liskov, B., Rodrigues, R.: One hop lookups for peer-to-peer overlays. In: Proc. of the 9th Conf. on Hot Topics in Operating Systems, HOTOS 2003. USENIX Association, Berkeley (2003)
Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R.: Kelips: Building an efficient and stable p2p dht through increased memory and background overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 160–169. Springer, Heidelberg (2003)
Heep, B.: R/kademlia: Recursive and topology-aware overlay routing. In: 2010 Australasian Telecommunication Networks and Applications Conf (ATNAC), 31 October- November 3, pp. 102–107 (2010)
Kaune, S., Lauinger, T., Kovacevic, A., Pussep, K.: Embracing the peer next door: Proximity in kademlia. In: Eighth Int. Conf. on P2P Computing, P2P 2008, pp. 343–350 (September 2008)
Li, T., Zhou, X., Brandstatter, K., Zhao, D., Wang, K., Rajendran, A., Zhang, Z., Raicu, I.: Zht: A light-weight reliable persistent dynamic scalable zero-hop dht. In: Parallel & Distributed Processing Symposium, IPDPS (2013)
Liu, B., Wei, T., Zhang, J., Li, J., Zou, W., Zhou, M.: Revisiting why kad lookup fails. In: Proc. of the 12th Int. Conf. on P2P Computing, pp. 37–42. IEEE (2012)
Lua, E., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A Survey and Comparison of P2P Overlay Network Schemes. IEEE Communications Surveys Tutorials 7(2), 72–93 (2005)
Maymounkov, P., Mazières, D.: Kademlia: A P2P Information System Based on the XOR Metric. In: Proc. of the 1st Int. Workshop on P2P Systems (IPTPS), pp. 53–65 (2002)
Steiner, M., Carra, D., Biersack, E.W.: Faster content access in kad. In: Proc. of the 8th Int. Conf. on P2P Computing, pp. 195–204. IEEE Computer Society, Washington, DC (2008)
Stutzbach, D., Rejaie, R.: Improving lookup performance over a widely-deployed dht. In: INFOCOM 2006. 25th IEEE Int. Conf. on Computer Communications. Proc., pp. 1–12 (2006)
Urdaneta, G., Pierre, G., van Steen, M.: Wikipedia workload analysis for decentralized hosting. Elsevier Computer Networks 53(11), 1830–1845 (2009)
Vogels, W.: Eventually consistent. Communications of the ACM 52(1), 40–44 (2009)
Wozniak, J.M., Jacobs, B., Latham, R., Lang, S., Son, S.W., Ross, R.B.: C-mpi: A dht implementation for grid and hpc environments. In: Preprint ANL/MCS-P1746-0410, 04/2010 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Einziger, G., Friedman, R., Kantor, Y. (2014). Shades: Expediting Kademlia’s Lookup Process. In: Silva, F., Dutra, I., Santos Costa, V. (eds) Euro-Par 2014 Parallel Processing. Euro-Par 2014. Lecture Notes in Computer Science, vol 8632. Springer, Cham. https://doi.org/10.1007/978-3-319-09873-9_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-09873-9_33
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09872-2
Online ISBN: 978-3-319-09873-9
eBook Packages: Computer ScienceComputer Science (R0)