Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2018584.2018595acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free access

Routing policies in named data networking

Published: 19 August 2011 Publication History

Abstract

Modern inter-domain routing with BGP is based on policies rather than finding shortest paths. Network operators devise and implement policies affecting route selection and export independently of others. These policies are realized by tuning a variety of parameters, or knobs, present in BGP. Similarly, NDN, a information-centric future Internet architecture, will utilize a policy-based routing protocol such as BGP. However, NDN allows a finer granularity of policies (content names rather than hosts) and more traffic engineering opportunities.
This work explores what routing policies could look like in an NDN Internet. We describe the knobs available to network operators and their possible settings. Furthermore, we explore the economic incentives present in an NDN Internet and reason how they might drive operators to set their policies.

References

[1]
Named data networking. http://named-data.org.
[2]
L. Gao. On Inferring Autonomous System Relationships in the Internet. IEEE/ACM TRANSACTIONS ON NETWORKING, 9(6), dec 2001.
[3]
T. Griffin, F. Shepherd, and G. Wilfong. The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking (TON), 10(2):232--243, 2002.
[4]
J. Hawkinson and T. Bates. Guidelines for creation, selection, and registration of an autonomous system (as), March 1996.
[5]
G. Huston. Interconnection, peering, and settlements. Proc. INET, 1999.
[6]
V. Jacobson, D. Smetters, J. Thornton, M. Plass, N. Briggs, and R. Braynard. Networking named content. Proceedings of the 5th international conference on Emerging networking experiments and technologies, pages 1--12, 2009.
[7]
W. Mühlbauer, A. Feldmann, O. Maennel, M. Roughan, and S. Uhlig. Building an AS-topology model that captures route diversity. ACM SIGCOMM Computer Communication Review, 36(4):206, 2006.
[8]
W. Mühlbauer, S. Uhlig, B. Fu, M. Meulle, and O. Maennel. In search for an appropriate granularity to model routing policies. ACM SIGCOMM Computer Communication Review, 37(4):145--156, 2007.
[9]
J. Rajahalme, M. Särelä, P. Nikander, and S. Tarkoma. Incentive-compatible caching and peering in data-oriented networks. ReArch '08 - Re-Architecting the Internet, 2008.
[10]
Y. Rekhter, T. Li, and S. Hares. A border gateway protocol 4 (bgp-4), January 2006.

Cited By

View all
  • (2021)Modeling and verifying NLSR protocol of NDN for CPS using UPPAALJournal of Software: Evolution and Process10.1002/smr.2384Online publication date: 29-Sep-2021
  • (2020)CUCKOO FILTER-BASED NAME LOOKUP IN NAME DATA NETWORKINGJOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES10.26782/jmcms.2020.07.0002215:7Online publication date: 26-Jul-2020
  • (2020)Concurrent Multipath Routing Optimization in Named Data NetworksIEEE Internet of Things Journal10.1109/JIOT.2019.29551397:2(1451-1463)Online publication date: Feb-2020
  • Show More Cited By

Index Terms

  1. Routing policies in named data networking

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ICN '11: Proceedings of the ACM SIGCOMM workshop on Information-centric networking
    August 2011
    80 pages
    ISBN:9781450308014
    DOI:10.1145/2018584
    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: 19 August 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. information-centric networking
    2. inter-domain policy

    Qualifiers

    • Research-article

    Conference

    SIGCOMM '11
    Sponsor:
    SIGCOMM '11: ACM SIGCOMM 2011 Conference
    August 19, 2011
    Ontario, Toronto, Canada

    Acceptance Rates

    ICN '11 Paper Acceptance Rate 12 of 50 submissions, 24%;
    Overall Acceptance Rate 133 of 482 submissions, 28%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)55
    • Downloads (Last 6 weeks)8
    Reflects downloads up to 04 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Modeling and verifying NLSR protocol of NDN for CPS using UPPAALJournal of Software: Evolution and Process10.1002/smr.2384Online publication date: 29-Sep-2021
    • (2020)CUCKOO FILTER-BASED NAME LOOKUP IN NAME DATA NETWORKINGJOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES10.26782/jmcms.2020.07.0002215:7Online publication date: 26-Jul-2020
    • (2020)Concurrent Multipath Routing Optimization in Named Data NetworksIEEE Internet of Things Journal10.1109/JIOT.2019.29551397:2(1451-1463)Online publication date: Feb-2020
    • (2019)On Sharing an FIB Table in Named Data NetworkingApplied Sciences10.3390/app91531789:15(3178)Online publication date: 5-Aug-2019
    • (2019)Cooperative Inter-Domain Cache Sharing for Information-Centric Networking via a Bargaining Game ApproachIEEE Transactions on Network Science and Engineering10.1109/TNSE.2018.28710216:4(698-710)Online publication date: 1-Oct-2019
    • (2019)Secure Identifier Management Based on Blockchain Technology in NDN EnvironmentIEEE Access10.1109/ACCESS.2018.28850377(6262-6268)Online publication date: 2019
    • (2019)A novel cache aware routing scheme for Information-Centric NetworksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.bjp.2013.12.00259(44-61)Online publication date: 6-Jan-2019
    • (2019)Mechanism Protecting Vehicle-to-Vehicle CommunicationSmart Technologies10.1007/978-981-13-7139-4_26(335-343)Online publication date: 28-Aug-2019
    • (2018)MUCA: New Routing for Named Data Networking2018 IFIP Networking Conference (IFIP Networking) and Workshops10.23919/IFIPNetworking.2018.8697026(289-297)Online publication date: May-2018
    • (2018)Modeling and Verification of NLSR Protocol using UPPAAL2018 International Symposium on Theoretical Aspects of Software Engineering (TASE)10.1109/TASE.2018.00022(108-115)Online publication date: Aug-2018
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media