Cooperative routing protocol for Content-Centric Networking

Abstract

A typical Forwarding Information Based (FIB) construction in the Content Centric Networking (CCN) architecture relies on the name prefix dissemination following the shortest path manner. However, routing based on the shortest path may not fully exploit the benefits of forwarding and data planes of the CCN architecture since different content requester routers may use disjoint paths to forward their interest packets, even though these packets aim at the same content. To exploit this opportunity, we propose a cooperative routing protocol for CCN, which focuses on a FIB reconstruction based on the content retrieval statistics to improve the in-network caching utilization. A binary linear optimization problem is formulated for calculating the optimal path for the cooperative routing. The simulation results show an improvement in the server load and round-trip time provided by the cooperative routing scheme compared with that of the conventional shortest path routing scheme.