Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3326285.3329041acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiwqosConference Proceedingsconference-collections
research-article
Public Access

NB-cache: non-blocking in-network caching for high-speed content routers

Published: 24 June 2019 Publication History
  • Get Citation Alerts
  • Abstract

    Information-Centric Networking (ICN) provides scalable and efficient content distribution at the Internet scale due to its in-network caching and native multicast capabilities. To support these features, a content router needs high performance at its data plane, which consists of three forwarding steps: checking the Content Store (CS), then the Pending Interest Table (PIT), and finally the Forwarding Information Base (FIB). While prior works focus on performance optimization of a single step, we build an analytical model of content router's entire data plane and identify that CS is the actual bottleneck in the pipeline. Compared with PIT and FIB, CS is more challenging because it has more data to read/write, may have more entries in its table to store and lookup, and needs to organize content objects to sustain frequent cache replacement. Then, we propose a novel mechanism called "NB-Cache" to address CS's performance issue from a network-wide point of view rather than a single router's. In NB-Cache, when packets arrive at a router whose CS is fully loaded, instead of being blocked and waiting for the CS, these packets are forwarded to the next-hop router, whose CS may not be fully loaded. This approach essentially utilizes Content Stores of all the routers along the forwarding path in parallel rather than checking each CS sequentially. Our experiments show significant improvement of data plane performance: 70% reduction in round-trip time (RTT) and 130% increase in throughput.

    References

    [1]
    2019. libeio. http://software.schmorp.de/pkg/libeio.html.
    [2]
    2019. NB-Cache Repository. https://github.com/graytower/nbcache.
    [3]
    2019. Ring buffer. https://en.wikipedia.org/wiki/Circular_buffer.
    [4]
    Burton H Bloom. 1970. Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 7 (1970), 422--426.
    [5]
    Huichen Dai, Jianyuan Lu, Yi Wang, and Bin Liu. 2015. BFAST: Unified and scalable index for NDN forwarding architecture. In 2015 IEEE Conference on Computer Communications (INFOCOM). IEEE, 2290--2298.
    [6]
    Li Fan, Pei Cao, Jussara Almeida, and Andrei Z Broder. 2000. Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking (TON) 8, 3 (2000), 281--293.
    [7]
    Sally Floyd and Van Jacobson. 1993. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on networking 4 (1993), 397--413.
    [8]
    James R Jackson. 1963. Jobshop-like queueing systems. Management science 10, 1 (1963), 131--142.
    [9]
    Rodrigo B Mansilha, Lorenzo Saino, Marinho P Barcellos, Massimo Gallo, Emilio Leonardi, Diego Perino, and Dario Rossi. 2015. Hierarchical content stores in high-speed ICN routers: Emulation and prototype implementation. In Proceedings of the 2nd ACM Conference on Information-Centric Networking. ACM, 59--68.
    [10]
    Tian Pan, Tao Huang, Jiang Liu, Jiao Zhang, Fan Yang, Shufang Li, and Yunjie Liu. 2016. Fast content store lookup using locality-aware skip list in content-centric networks. In 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 187--192.
    [11]
    Diego Perino and Matteo Varvello. 2011. A reality check for content centric networking. In Proceedings of the ACM SIGCOMM workshop on Information-centric networking. ACM, 44--49.
    [12]
    K Ramakrishnan, S Floyd, and D Black. 2001. RFC 3168. The addition of explicit congestion notification (ECN) to IP (2001).
    [13]
    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. ACM, 21--30.
    [14]
    Junxiao Shi, Teng Liang, Hao Wu, Bin Liu, and Beichuan Zhang. 2016. Ndn-nic: Name-based filtering on network interface card. In Proceedings of the 3rd ACM Conference on Information-Centric Networking. ACM, 40--49.
    [15]
    Won So, Taejoong Chung, Haowei Yuan, David Oran, and Mark Stapp. 2014. Toward terabyte-scale caching with SSD in a named data networking router. In Proceedings of the tenth ACM/IEEE symposium on Architectures for networking and communications systems. ACM, 241--242.
    [16]
    Tian Song, Haowei Yuan, Patrick Crowley, and Beichuan Zhang. 2015. Scalable name-based packet forwarding: From millions to billions. In Proceedings of the 2nd ACM conference on information-centric networking. ACM, 19--28.
    [17]
    Matteo Varvello, Diego Perino, and Leonardo Linguaglossa. 2013. On the design and implementation of a wire-speed pending interest table. In 2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 369--374.
    [18]
    Yi Wang, Yuan Zu, Ting Zhang, Kunyang Peng, Qunfeng Dong, Bin Liu, Wei Meng, Huicheng Dai, Xin Tian, Zhonghu Xu, et al. 2013. Wire speed name lookup: A gpu-based approach. In Presented as part of the 10th { USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 13). 199--212.
    [19]
    Haowei Yuan and Patrick Crowley. 2014. Scalable pending interest table design: From principles to practice. In IEEE INFOCOM 2014-IEEE Conference on Computer Communications. IEEE, 2049--2057.
    [20]
    Lixia Zhang, Alexander Afanasyev, Jeffrey Burke, Van Jacobson, Patrick Crowley, Christos Papadopoulos, Lan Wang, Beichuan Zhang, et al. 2014. Named data networking. ACM SIGCOMM Computer Communication Review 44, 3 (2014), 66--73.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    IWQoS '19: Proceedings of the International Symposium on Quality of Service
    June 2019
    420 pages
    ISBN:9781450367783
    DOI:10.1145/3326285
    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 the author(s) 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].

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 24 June 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. ICN
    2. bottleneck bypassing
    3. content router
    4. non-blocking I/O

    Qualifiers

    • Research-article

    Funding Sources

    • National Natural Science Foundation of China
    • Fundamental Research Funds for the Central Universities
    • National Science Foundation
    • Research and Development Program in Key Areas of Guangdong Province
    • Huawei Innovation Research Program
    • National Science and Technology Major Project of the Ministry of Science and Technology of China

    Conference

    IWQoS '19

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 406
      Total Downloads
    • Downloads (Last 12 months)67
    • Downloads (Last 6 weeks)13
    Reflects downloads up to 10 Aug 2024

    Other Metrics

    Citations

    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