Is information-centric multi-tree routing feasible?

Authors:
Antonio Carzaniga;Koorosh Khazaei;Michele Papalini;Alexander L. Wolf
Affiliations:
University of Lugano, Lugano, Switzerland;University of Lugano, Lugano, Switzerland;University of Lugano, Lugano, Switzerland;Imperial College London, London, United Kingdom
Venue:
Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
Year:
2013

Citing 8
Cited 0

Design and evaluation of a wide-area event notification service

ACM Transactions on Computer Systems (TOCS)
Content-Based Networking: A New Communication Infrastructure

IMWS '01 Revised Papers from the NSF Workshop on Developing an Infrastructure for Mobile and Wireless Systems
Forwarding in a content-based network

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal hierarchical decompositions for congestion minimization in networks

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
LIPSIN: line speed publish/subscribe inter-networking

Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Networking named content

Proceedings of the 5th international conference on Emerging networking experiments and technologies
Content-based publish/subscribe networking and information-centric networking

Proceedings of the ACM SIGCOMM workshop on Information-centric networking
Broadcast yourself: understanding YouTube uploaders

Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 multicast; 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 Internet-scale workloads in realistic network settings.