Performance Comparison of Shortest-Path Routing and Optimal Detour Routing in Content-Centric Networking
Ryo Nakamura, Hiroyuki Ohsaki · 2016
In this paper, we quantitatively investigate the optimality of the shortest-path routing in Content-Centric Networking (CCN) in terms of application-level performance metrics. We compare the average content delivery delay under the shortest-path routing with that under the optimal two-hop detour routing in two networks (triangular network and seven-node network). Our findings include that the shortest-path routing is optimal under a balanced network with comparable content store sizes at routers, and that the optimal two-hop detour routing achieves better application-level performance when the content store size ratio is large.