Is information-centric multi-tree routing feasible?

Antonio Carzaniga, Koorosh Khazaei, Michele Papalini, Alexander L. Wolf
2013 Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking - ICN '13  
We have argued that an information-centric network should natively support publish/subscribe event notification in addition to on-demand content delivery. We have also argued that both primitives could use the same forwarding information base and, furthermore, that both primitives can easily support addresses that are more expressive than simple hierarchical names. In this paper we present a concrete routing scheme that realizes this: "push" as well as "pull" communication; anycast as well as
more » ... lticast; and descriptor-based (as opposed to name-based) addressing. The scheme is founded on multiple tree covers that can be arranged and composed hierarchically following the structure of network domains. On each tree, the scheme combines addresses so as to reduce forwarding state. We demonstrate the feasibility and scalability of the scheme through simulations on Internetscale workloads in realistic network settings.
doi:10.1145/2491224.2491230 dblp:conf/acmicn/CarzanigaKPW13 fatcat:jlwyyq5bbzfjzcfwyob3pwukfm