A lightweight prefix-based routing for content-centric networking

This paper presents a lightweight prefix-based routing (LPR) for content-centric networking. In CCN, every communication with the named data is based on hierarchical naming convention and forwarding decision using the longest-prefix matching mechanism. However, there are no comprehensive researches on designing a general routing protocol over such a naming hierarchy. Our LPR scheme provides a lightweight management of routing table and Forwarding Information Base (FIB) table that manage a lower number of routes enough to perform the longest-prefix matching. Also, a method is proposed to cope with connections between CCN routers in different hierarchies. We evaluate the proposed LPR against the existing routing approaches and show that it leads to less control overhead and FIB size.