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

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.