Content-Based Hyperbolic Routing and Push Mechanism in Named Data Networking

Named Data Networking (NDN) is a promising instance of Information-Centric Networking (ICN). With the expansion of the network, unbounded namespace and query of the routing table in NDN can deteriorate routing performance. Since Hyperbolic Routing (HR) does not need to maintain a full routing table, it becomes a potential solution to this problem. Existing works assign coordinate based on betweenness centrality of nodes. The betweenness-based solution can fully embed the network into hyperbolic space; however, it brings a problem that packets are aggregated to high-betweenness nodes. In this paper, by jointly considering the betweenness centrality of nodes and popularity of contents while assigning hyperbolic coordinate, we first propose a content-based hyperbolic routing called Pop-Hyper. As result, packets are sent to nodes with high betweenness and high popularity. Then, a push mechanism based on Pop-Hyper called HyperPush is presented. Finally, we compare our proposals with the existing mechanisms in the 22-node and 100-node topology, respectively. The simulation results show that Pop-Hyper performs well in terms of hop count and packet loss; while HyperPush outperforms others in terms of network load, cache hit ratio and delays.