Name-based content routing in information centric networks using distance information

The Distance-based Content Routing (DCR) protocol is introduced, which enables routers to maintain multiple loop-free routes to the nearest instances of a named data object orname prex in an information centric network (ICN), andestablish content delivery trees over which all or some instances of the same named data object or name prex can becontacted. In contrast to all prior routing solutions for ICNs,DCR operates without requiring routers to establish overlays, knowing the network topology, using complete pathsto content replicas, or knowing about all the sites storingreplicas of named content. It is shown that DCR is correctand that is orders of magnitude more scalable than recentname-based routing approaches for ICNs, in terms of thetime and signaling overhead needed to obtain correct routing to named content