The Research Of Routing Mechanism For Named Data Network

Networking created today’s world of content but was never designed for it.With the rapid development of Internet technology and applications and the arrival ofthe era of Big Data, users and applications more concerned about the data itself, as towhere and how to obtain it is no longer the focus of its concern. Obviously, themethod to obtain data through the address mapping method can’t meet the changingneeds of users. Network requirements change with the existence of the shackles in theTCP/IP based network architecture has been serious impediment the development ofthe information society. Demand for new Internet architecture to promote researchrevolutionary network architecture.As one of the revolutionary future Internet architecture Named Data Network(NDN) which is a content-centric network architecture. With the new packetsencapsulation structure and routing addressing mode fundamentally change thenetwork routing strategy. Routing process does not involve any of the host addressrelated information, instead of using naming names instead of IP data packets, morefocused on the needs of data users, rather than focus on ways to obtain data packetsand data sources. At the same time, introduce the caching mechanism of into therouting process. Hope that through the use of widely distributed cache backup, using"space for time" approach to improve the feedback rate request, the routing algorithmcommonly used name resolution mechanism.Routing algorithm based on the name resolution mechanisms that exist in therouting table is difficult to maintain high system redundancy, overhead and otherserious problems, seriously impact the performance of NDN routing. This paperproposed to create a style based on directed diffusion routing policy and servicediscovery potential, can effectively solve the name resolution mechanism based on theproblem. This paper proposes a content-based epidemic hyperbolic space andsimilarity analysis algorithm, the probability of a potential connection weightsbetween nodes based on node distance hyperbolic space; Secondly, taking intoaccount the content of volatile cache potential instability caused by the network,updating the enormous potential network overhead, this paper presents a controlalgorithm to reduce the potential scope of the resulting network overhead, enhancednetwork stability; Then, in order to enable the network to recover from the failure ofaddressing path, quick detection of up path, this paper presents a state-based routing network failure recovery algorithm; Finally, to completed the simulation anddevelopment work of the routing protocol this paper expanded the platform ofndnSIM.In this paper, it realized the new potential based routing protocol NDNPBR.Adding an efficient attachment poly to the existing NDN experimental forwardingplane, which has more congestion control, more network cost control, and failurerecovery. The simulation results show the efficiency of the method.