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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.