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

On the Prefix Granularity Problem in NDN Adaptive Forwarding

Published:22 September 2020Publication History

ABSTRACT

One unique architectural benefit of Named Data Networking (NDN) is adaptive forwarding, i.e., the forwarding plane is able to observe data retrieval performance of past Interests and use it to adjust forwarding decisions for future Interests. To be effective, adaptive forwarding assumes Interest Routing Locality, meaning that Interests sharing the same prefix are likely to follow a similar forwarding path within a short period of time. Therefore, past observations can provide insight into how forwarding will likely perform for the same prefix in the near future. Since Interests can have multiple common prefixes with different lengths, the real challenge is determining which prefix length should be used in adaptive forwarding to record path measurements - we refer to this as the Prefix Granularity Problem. The longer the common prefix is, the better Interest Routing Locality. However, finer grained-prefixes cover fewer Interests each and require a larger forwarding table. Existing adaptive forwarding designs use a static prefix length, which is known to encounter issues in the event of partial network failures. In this work, we propose to dynamically aggregate and de-aggregate name prefixes in the forwarding table in order to use the prefixes that are the most appropriate given current network situation. In addition, to reduce the overhead of adaptive forwarding, we propose mechanisms to minimize the use of longest prefix matching during the processing of Data packets. Simulations demonstrate that the proposed techniques can result in better forwarding decisions in the event of partial network failures with significantly reduced overhead.

Skip Supplemental Material Section

Supplemental Material

p41-liang-presentation.mp4

mp4

18.7 MB

References

  1. Alexander Afanasyev, Ilya Moiseenko, Lixia Zhang, et al. 2012. ndnSIM: NDN simulator for NS-3. University of California, Los Angeles, Tech. Rep 4 (2012).Google ScholarGoogle Scholar
  2. Alexander Afanasyev, Junxiao Shi, Beichuan Zhang, Lixia Zhang, Ilya Moiseenko, Yingdi Yu, Wentao Shang, Yi Huang, Jerald Paul Abraham, Steve DiBenedetto, et al. 2014. NFD developer guide. Dept. Comput. Sci., Univ. California, Los Angeles, Los Angeles, CA, USA, Tech. Rep. NDN-0021 (2014).Google ScholarGoogle Scholar
  3. Chavoosh Ghasemi, Hamed Yousefi, Kang G Shin, and Beichuan Zhang. 2019. On the Granularity of Trie-Based Data Structures for Name Lookups and Updates. IEEE/ACM Transactions on Networking 27, 2 (2019), 777--789.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Vince Lehman, Ashlesh Gawande, Beichuan Zhang, Lixia Zhang, Rodrigo Aldecoa, Dmitri Krioukov, and Lan Wang. 2016. An experimental investigation of hyperbolic routing with a smart forwarding plane in NDN. In 2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS). IEEE, 1--10.Google ScholarGoogle ScholarCross RefCross Ref
  5. Teng Liang, Ju Pan, and Beichuan Zhang. 2018. NDNizing existing applications: research issues and experiences. In Proceedings of the 5th ACM Conference on Information-Centric Networking. 172--183.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. NDN Project Team. [n. d.]. NDN Protocol Design Principles. htttp://named-data.net/project/ndn-design-principles/.Google ScholarGoogle Scholar
  7. Klaus Schneider, Cheng Yi, Beichuan Zhang, and Lixia Zhang. 2016. A practical congestion control scheme for named data networking. In Proceedings of the 3rd ACM Conference on Information-Centric Networking. 21--30.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Junxiao Shi, Eric Newberry, and Beichuan Zhang. 2017. On broadcast-based self-learning in named data networking. In IFIP Networking.Google ScholarGoogle Scholar
  9. Junxiao Shi, Davide Pesavento, and Lotfi Benmohamed. 2020. NDN-DPDK: NDN Forwarding at 100 Gbps on Commodity Hardware. In 7th ACM Conference on Information-Centric Networking (ICN 2020).Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Won So, Ashok Narayanan, and David Oran. 2013. Named data networking on a router: Fast and DoS-resistant forwarding with hash tables. In Architectures for Networking and Communications Systems. IEEE, 215--225.Google ScholarGoogle Scholar
  11. NDNTeam. 2020. NDN Packet Format Specification version 0.3. https://named-data.net/doc/NDN-packet-spec/current/interest.htmlGoogle ScholarGoogle Scholar
  12. Matteo Varvello, Diego Perino, and Jairo Esteban. 2012. Caesar: A content router for high speed forwarding. In Proceedings of the second edition of the ICN workshop on Information-centric networking. 73--78.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Cheng Yi, Alexander Afanasyev, Lan Wang, Beichuan Zhang, and Lixia Zhang. 2012. Adaptive forwarding in named data networking. ACM SIGCOMM computer communication review 42, 3 (2012), 62--67.Google ScholarGoogle Scholar
  14. Haitao Zhang, Zhehao Wang, Christopher Scherb, Claudio Marxer, Jeff Burke, Lixia Zhang, and Christian Tschudin. 2016. Sharing mhealth data via named data networking. In Proceedings of the 3rd ACM Conference on Information-Centric Networking. ACM, 142--147.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the Prefix Granularity Problem in NDN Adaptive Forwarding

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          ICN '20: Proceedings of the 7th ACM Conference on Information-Centric Networking
          September 2020
          181 pages
          ISBN:9781450380409
          DOI:10.1145/3405656

          Copyright © 2020 ACM

          © 2020 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 22 September 2020

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed limited

          Acceptance Rates

          ICN '20 Paper Acceptance Rate15of39submissions,38%Overall Acceptance Rate133of482submissions,28%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader