The Simulation And Research Of Identifier Mapping System Based On CoreSim

The current Internet is facing serious scalability problems and the overloading of IP address is regarded as an important reason. With the deep research of Internet initial design, domestic and foreign researchers put forward an idea of separating identifier and locator. The separation of identifier and locator provides a good foundation for solving Internet routing scalability, mobility, security problems, etc.The mapping system is key to the separation protocol of identifier and locator. The work in this paper relies on the project of Universal trustworthy Network and pervasive Services, Which is in National Basic Research Program(973Program). This paper achieves the research and simulation of identifier mapping system based on CoreSim. This paper firstly analyzes the current research status of separating identifier and locator, On this basis, describes the architecture of Universal Network and the separation mapping mechanism under Universal Network. Secondly, based on the analysis of Universal Network, this paper proposes a new mapping system, Hierarchical Mapping System(HMS) and designs its basic structure and working principle. Besides, combined with the basic framework analysis of the simulator, CoreSim, this paper achieves the design on basic flow process and module, modifies and adds associated directory into CoreSim. Then, this paper creates and programs the basic module of Hierarchical Mapping System, including the main module of HMS, HMSChordRing module, HMSChordMetrics module, HMSNode module, HMSChordList module and HMSFingerTable module.Finally, This paper builds the network topology of CoreSim by obtaining the input source files and iPlane query interface. This paper runs CoreSim and gets a variety of output files such as itrOutput file, mapCache file and so on. Through analyzing these files, this paper achieves the simulation of HMS query latency and hit probability of querying local cache, and gets the following conclusion:1) HMS proposes two query mechanisms:recursive query and iterative query. Compared with iterative query, recursive query gets much smaller query latency. The maximum latency of recursive mechanism is3seconds while the maximum latency of iterative mechanism is10seconds or more.2) The total query latency of HMS is proportional to the total hops of query delay path. When the total number of hops increases, the total query latency also increases. The total maximum numbers of hops in recursive query is10, while the total maximum numbers of hops in iterative query increases to22or more.3) During the hit probability of querying in the local cache comparison, the hit probability of recursive query is much greater than the iterative query at the same time pot.The program provides an experimental foundation for testing and analyzing mapping system in Universal Network, to achieve that the real system can not predict the impact of separation protocol of identifier and locator on routing scalability due to the limit size of real system. This paper provides theoretical support for deploying the routing system based on separation of identifier and locator in the future and owns the important practical values and theoretical significance.