Routing Mechanisms Based On Class-cluster For Named Data Network

Recently, some serious problems have appeared in the traditional networks, such as IP address shortage, IP address ambiguity, etc. To solve these problems, some researchers take effort to design the future network architectures. NDN (Named Data Networking), the most potential candidate for next-generation Internet architecture designs, is a hot research topic in the field of network at present. With gradually researching of NDN, as a basic mechanism, the routing mechanism should be further studied. Lacking of content classification, existing routing mechanisms broadcasted an interest packet to NDN, which increased the blindness of forwarding and reduced the performance of routing. This paper mainly researches and analyzes the basic name mechanism, the routing strategy and the cache management.The existing routing strategies mainly broadcasted an interest packet to NDN,which caused a long delay of content request and inefficiency of route query.Accordingly, the paper firstly puts forward NIM (a Name-based Indexing Mechanism), which divides content name into prefix and suffix. And then, the paper designs CCM (a Content-based Classification Model) for separating the content into multiple class-clusters according to the prefix. Combining NIM with CCM, CCR (a Class-Cluster based NDN Routing strategy) is proposed. It converts the one-dimensional longitudinal routing query into the multidimensional portrait position routing query, thus can decrease the request delay, the routing hops and the forward redundancy. Eventually, the routing efficiency of NDN is improved obviously.The existing cache management methods could not divide cache space,meanwhile nodes had no right to choice, which leaded to the instability of content and a low cache hit rate. Thus, SSCM (a Space-partition and Similarity based Cache Management method) is proposed in the paper. SSCM ensures the stability of the content and provides the stable environment for CCR through dividing the cache space into a static zone and a dynamic zone. In the case of combining space-partition with similarity, SSCM balances the cache situation of high-popular content and low-popular content for nodes. Hence, SSCM achieves the goals of decreasing the delay of content request, and improving the cache hit rate.The routing strategy and the cache management method are experimented in the simulator by comparing with the existing strategies and methods. It is proved that the routing strategy decreases the request delay, the routing hops and the forward redundancy. The results show that the cache management method can improve the cache hit rate and decrease the delay of content request.