Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2491224.2491230acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free access

Is information-centric multi-tree routing feasible?

Published: 12 August 2013 Publication History

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.

References

[1]
A. Carzaniga, M. Papalini, and A. L. Wolf. Content-based publish/subscribe networking and information-centric networking. In Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking, Aug. 2011.
[2]
A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems, 19(3):332--383, Aug. 2001.
[3]
A. Carzaniga, M. J. Rutherford, and A. L. Wolf. A routing scheme for content-based networking. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), Mar. 2004.
[4]
A. Carzaniga and A. L. Wolf. Content-based networking: A new communication infrastructure. In NSF Workshop on an Infrastructure for Mobile and Wireless Systems, number 2538 in Lecture Notes in Computer Science. Springer-Verlag, Oct. 2001.
[5]
A. Carzaniga and A. L. Wolf. Forwarding in a content-based network. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), Aug. 2003.
[6]
Y. Ding, Y. Du, Y. Hu, Z. Liu, L. Wang, K. Ross, and A. Ghose. Broadcast yourself: Understanding YouTube uploaders. In Proceedings of the Internet Measurement Conference, 2011.
[7]
V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard. Networking named content. In Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies (CoNEXT), 2009.
[8]
P. Jokela, A. Zahemszky, C. Esteve Rothenberg, S. Arianfar, and P. Nikander. LIPSIN: Line speed publish/subscribe inter-networking. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), Aug. 2009.
[9]
H. Räcke. Optimal hierarchical decompositions for congestion minimization in networks. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), 2008.
[10]
D. G. Thaler and M. Handley. On the aggregatability of multicast forwarding state. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), Tel Aviv, Israel, Mar. 2000.
[11]
R. Wetzker, C. Zimmermann, and C. Bauckhage. Analyzing social bookmarking systems: A del.icio.us cookbook. In Proceedings of the ECAI Workshop on Mining Social Data, July 2008.

Cited By

View all
  • (2023)Modeling and verifying NLSR protocol of NDN for CPS using UPPAALJournal of Software: Evolution and Process10.1002/smr.238435:7Online publication date: 2-Jul-2023
  • (2015)Characterizing the delay performance of web-based cloud services in a browser-scripting approach2015 IEEE/CIC International Conference on Communications in China (ICCC)10.1109/ICCChina.2015.7448755(1-6)Online publication date: Nov-2015
  • (2015)STAC: Simultaneous transmitting and air computing in wireless data center networks2015 IEEE/CIC International Conference on Communications in China (ICCC)10.1109/ICCChina.2015.7448704(1-7)Online publication date: Nov-2015
  • Show More Cited By

Index Terms

  1. Is information-centric multi-tree routing feasible?

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ICN '13: Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
    August 2013
    88 pages
    ISBN:9781450321792
    DOI:10.1145/2491224
    • cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 43, Issue 4
      October 2013
      595 pages
      ISSN:0146-4833
      DOI:10.1145/2534169
      Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 August 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. content-based
    2. content-centric
    3. information-centric networking
    4. named-data
    5. publish/subscribe
    6. routing

    Qualifiers

    • Research-article

    Conference

    SIGCOMM'13
    Sponsor:
    SIGCOMM'13: ACM SIGCOMM 2013 Conference
    August 12, 2013
    Hong Kong, China

    Acceptance Rates

    ICN '13 Paper Acceptance Rate 20 of 57 submissions, 35%;
    Overall Acceptance Rate 133 of 482 submissions, 28%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)30
    • Downloads (Last 6 weeks)7
    Reflects downloads up to 20 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Modeling and verifying NLSR protocol of NDN for CPS using UPPAALJournal of Software: Evolution and Process10.1002/smr.238435:7Online publication date: 2-Jul-2023
    • (2015)Characterizing the delay performance of web-based cloud services in a browser-scripting approach2015 IEEE/CIC International Conference on Communications in China (ICCC)10.1109/ICCChina.2015.7448755(1-6)Online publication date: Nov-2015
    • (2015)STAC: Simultaneous transmitting and air computing in wireless data center networks2015 IEEE/CIC International Conference on Communications in China (ICCC)10.1109/ICCChina.2015.7448704(1-7)Online publication date: Nov-2015
    • (2015)A multi-path forwarding strategy for content-centric networking2015 IEEE/CIC International Conference on Communications in China (ICCC)10.1109/ICCChina.2015.7448593(1-6)Online publication date: Nov-2015
    • (2015)Cache-Aware Named-Data Forwarding in Internet of Things2015 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2015.7417355(1-6)Online publication date: Dec-2015
    • (2015)Push applications and dynamic content generation over content‐centric networkingInternational Journal of Communication Systems10.1002/dac.296430:3Online publication date: 25-Mar-2015
    • (2014)Scalable routing for tag-based information-centric networkingProceedings of the 1st ACM Conference on Information-Centric Networking10.1145/2660129.2660155(17-26)Online publication date: 24-Sep-2014
    • (2014)On the role of routing in named data networkingProceedings of the 1st ACM Conference on Information-Centric Networking10.1145/2660129.2660140(27-36)Online publication date: 24-Sep-2014
    • (2014)Cache-Aware Named-Data Forwarding in Internet of Things2015 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2014.7417355(1-6)Online publication date: Dec-2014
    • (2014)A Sybil-Proof and Time-Sensitive Incentive Tree Mechanism for Crowdsourcing2015 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2014.7417272(1-6)Online publication date: Dec-2014
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media