• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2010, Vol. 32 ›› Issue (2): 7-10.doi: 10.3969/j.issn.1007130X.2010.

• 论文 • Previous Articles     Next Articles

A HashBased Locator/ID Mapping Mechanism

  

  1. (School of Computer Science,National University of Defense Technology,Changsha 410073,China)
  • Received:2008-09-10 Revised:2008-12-13 Online:2010-01-25 Published:2010-01-26

Abstract:

With the development of the Internet, the original TCP/IP architecture is facing some critical challenges from its scalability, mobility, security and so on,and the flaws of which have hampered the development of some new network technologies such as multihoming and traffic engineering. One of the most important causes for this problem is the IP address semantic overloading. To address the issue, researchers commonly suggest that we should redesign the naming and addressing architecture of the next generation Internet. “Locator/ID Split” is one of the most important techniques in tackling the problem. At the core of “Locator/ID Split” is the scalable flatlabels based mapping service. This paper proposes HLIM, which uses hashbased routing to provide a deterministic mapping resolution for the edge network through distributed mapping servers. HLIM satisfies the scalability of the flatlabels “Identifier” mapping service, and can adapt to the dynamic joining and leaving of the mapping nodes to some extent.

Key words: locator/ID split;flatlabel;mapping service;hash;scalability

CLC Number: