UC Santa Cruz

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 or

name prex in an information centric network (ICN), and

establish content delivery trees over which all or some instances of the same named data object or name prex can be

contacted. In contrast to all prior routing solutions for ICNs,

DCR operates without requiring routers to establish overlays, knowing the network topology, using complete paths

to content replicas, or knowing about all the sites storing

replicas of named content. It is shown that DCR is correct

and that is orders of magnitude more scalable than recent

name-based routing approaches for ICNs, in terms of the

time and signaling overhead needed to obtain correct routing to named content.