Skip to main content
Log in

Kademlia based routing on locator-ID separated networks for new generation networks

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

Abstract

We propose an efficient ID-based routing method using Kademlia on Locator-ID separated networks for New Generation Networks. Due to the increase in Internet traffic, many people pointed out problems of the Internet. Therefore, studies on New Generation Networks by clean-slate approach are hot topics. New Generation Network discussions include locator-ID separation for resolving the problems of routing tables and mobility support. IETF and IRTF proposed some protocols for Locator-ID separation, but they have problems in Name servers for Locator-ID mapping resolutions. Therefore, we propose a method for communicating specified ID hosts using hierarchical Kademlia without resolving Locator-ID mapping explicitly. Our method does not need Name servers of Locator-ID mappings. We can also support host mobility by updating Kademlia links, and hierarchical Kademlia achieves efficient routings considering physical distances. We discuss the communication delay and size of routing tables of our proposed method, and also show the effectiveness of hierarchical Kademlia through simulation experiments.

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

Similar content being viewed by others

References

  1. FIND (Future Internet Design) web site, http://www.nets-find.net/

  2. GENI (Global Environment for Network Innovations) web site, http://www.geni.net/

  3. AKARI architecture design project web site, http://akari-project.nict.go.jp/eng/index2.htm

  4. Perkins C (2002) IP mobility support for IPv4. IETF RFC 3344, Aug. 2002

  5. Devarapalli V, Wakikawa R, Petrescu A and Thubert P (2005) Network Mobility (NEMO) Basic Support Protocol. IETF RFC 3963, Jan. 2005

  6. Teraoka F, Ishiyama M and Kunishi M (2003) LIN6: A solution to multihoming and mobility in IPv6. IETF Internet-Draft, Dec. 2003

  7. Meyer D, Zhang L and Fall K (2007) Report from the IA8 workshop on routing and addressing. IETF RFC 4984, Sep. 2007

  8. Huston G and Armitage G (2006) Projecting future IPv4 router requirements from trends in dynamic BGP behavior. Proceedings of Australian Telecommunication Networks & Applications Conference (ATNAC), Dec. 2006

  9. Ishiyama M, Kunishi M, Uehara K, Esaki H, Teraoka F (2001) LINA: A new approach to mobility support in wide area networks. IEICE Trans Comm E84-B(8):2076–2086

    Google Scholar 

  10. APNIC bgp-stats Mailing List, APNIC web site, http://www.apnic.net/

  11. Moskowitz R and Nikander P (2006) Host Identity Protocol (HIP) Architecture. IETF RFC4423, May 2006

  12. Farinacci D, Fuller V, Oran D and Meyer D (2007) Locator/ID Separation Protocol (LISP). IRTF draft-farinacci-lisp-05, Nov. 2007

  13. Jen D, Meisel M, Massey D, Wang L, Zhang B and Zhang L (2007) APT: A practical transit mapping service. IRTF draft-jen-apt-00.txt, July 2007

  14. Maymounkov P and Mazieres D (2002) Kademlia: A peer-to-peer information system based on the XOR Metric. Proceedings of 1st International Workshop on Peer-to-Peer Systems (IPTPS 2002), pp 53–65, Mar. 2002

  15. Vogt C (2007) Six/One: A solution for routing and addressing in Ipv6. IRTF draft-vogt-rrg-six-one-01.txt, Nov. 2007

  16. Henderson T and Gurtov A (2007) HIP experiment report. IRTF draft-irtf-hip-experiment-03, Mar. 2007

  17. OpenDHT web site, http://www.opendht.org/

  18. Brim S, Chiappa N, Farinacci D, Fuller V, Lewis D and Meyer D (2008) LISP-CONS: A content distribution overlay network service for LISP. IRTF draft-meyer-lisp-cons-04.txt, Apr. 2008

  19. Nikander P, Arkko J and Ohlman B (2004) Host identity indirection infrastructure (Hi3). IETF draft-nikander-hiprg-hi3-00, Jun. 2004

  20. Stoica I, Adkins D, Zhuang S, Shenker S, Surana S (2002) Internet indirection infrastructure. Proc ACM SIGCOMM pp 73–86, Aug. 2002

  21. Stoica I, Morris R, Karger D, Kaashoek M and Balakrishnan H (2001) Chord: A scalable peer-to-peer lookup service for internet applications. Proc ACM SIGCOMM pp 149–160, Aug. 2001

  22. Rowstron A and Drushel P (2001) Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Proceedings of 18th IFIP/ACM International Conference on Distributed System Platforms (Middleware), pp 329–350, Nov. 2001

  23. Zhu Y, Hu Y (2005) Efficient, proximity-aware load balancing for DHT-Based P2P systems. IEEE Trans Parallel Distr Syst 16(4):349–361

    Article  Google Scholar 

  24. Xie H, Krishnamurthy A, Silberschatz A and Yang YR (2007) P4P: Explicit communications for cooperative control between P2P and network providers. http://www.dcia.info/documents/

  25. Doi Y (2005) DNS meets DHT: Treating massive ID resolution using DNS over DHT. Proceedings of IEEE 2005 international symposium on applications and the internet (SAINT2005), pp 9–15, Feb. 2005

  26. Zegura EW, Calvert KL and Bhattacharjee S (1996) How to model an internetwork. Proceedings of IEEE conference on computer communication, pp 594–602, Mar. 1996

  27. Ratnasamy S, Handley M, Karp R and Shenker S (2001) Application-level multicast using content-addressable networks. Proceedings of international workshop on network group communication 2001 (NGC2001), pp 14–29, Nov. 2001

  28. Xu Z, Min R and Hu Y (2003) HIERAS: A DHT based hierarchical P2P routing algorithm. Proceedings of 2003 international conference on parallel processing, pp 187–194, Aug. 2003

  29. Shin K, Lee S, Lim G, Ma J and Yoon H (2002) Grapes: Topology-based hierarchical virtual network for peer-to-peer lookup services. Proceedings of international conference on parallel processing workshops, pp 159–164

  30. Ratnasamy S, Handley M, Karp RM, Shenker S (2002) Topologically-aware overlay construction and server selection. Proc IEEE INFOCOM 3:1190–1199

    Google Scholar 

  31. Yoshida M, Teranishi Y, Shimojo S (2009) A mechanism of ID/Locator separation in overlay network. IPSJ J 50(9):2298–2311, in Japanese

    Google Scholar 

  32. Aspnes J and Shah G (2003) Skip graphs. Proceedings of 14th annual ACM-SIAM symposium on discrete algorithms (SODA), pp 384–393

  33. Caesar M, Condie T, Kannan J, Lakshminarayanan K, Stoica I, Shenker S (2006) ROFL: Routing on flat labels. Proc ACM SIGCOMM 2006:363–374

    Article  Google Scholar 

  34. Farinacci D, Fuller V, Lewis D and Meyer D (2009) LISP mobile node. IETF draft-meyer-lisp-mn-00.txt, July 2009

  35. Kashmir web site, http://sourceforge.net/projects/khashmir/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yoji Yamato.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yamato, Y., Ogawa, T., Moriya, T. et al. Kademlia based routing on locator-ID separated networks for new generation networks. Peer-to-Peer Netw. Appl. 6, 294–304 (2013). https://doi.org/10.1007/s12083-012-0166-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-012-0166-2

Keywords

Navigation