Research On Compact Routing Technique In Named Data Networking

While the number of the Internet users is exponential growth, as well as theexhaustion of the IPV4space, the severity of the address space problem causeslarger repercussions. With the development of the hierarchical routing modelbecoming limited today, even though the use of IPV6makes space problemtemporary relief, but still it can’t fundamentally solve problems of space depletion.At this time, the research of compact routing protocols causes concern.After research and analysis on many typical compact routing protocols, first，some improved compact routing protocols in name-dependent network and someanalysis indicators, as long as the computation theory of average stretchdistribution are put forward and discussed in this paper. Second，the theory of thename space technique and the existing problems on this technique are first studiedin this paper, and a named data analysis scheme is put forward. Base on thesestudies, this paper puts forward a improved compact routing protocol on nameddata network. This protocol bases on four basic components: Landmark, vicinity,learning paths to landmarks and vicinities, and address coding, and connects thename of nodes with the address of nodes by using DHT technique. after all thesework, the routing system aiming at named data network is formed.At last, we simulate the improved routing protocol in many different networktopologies. Through the experiments, it is known that the improved routing protocoldoes best in kerate topology, with the worst stretch-2.5on subsequent packets, andthe average stretch is16.9%below the average stretch of Disco, and does worst incelegans topology, with the worst stretch-4on subsequent packets and the averagestretch is17%below the average stretch of Disco. The experiments show that theimproved scheme is good at many parts, and also meet many properties.