ABSTRACT
Named-based packet forwarding represents a core characteristic of many information-centric networking architectures. IP-inspired forwarding methods are not suitable because a) name-based forwarding must support variable-length keys of unbounded length, and b) namespaces for data are substantially larger than the global address prefix rulesets used in today's Internet. In this paper, we introduce and evaluate an approach that can realistically scale variable-length name forwarding to billions of prefixes. Our methods are driven by two key insights. First, we show that, represented by binary strings, a name-based forwarding table of several millions of entries can be notably compressed by a Patricia trie to fit in contemporary fast memory of a line card. Second, we show that it is possible to design and optimize the data structure to make its size dependent only upon the number of rules in a ruleset, rather than the length of rules. We reduce our designs to practice and experimentally evaluate memory requirements and performance. We demonstrate that a ruleset with one million rules based on the Alexa dataset only needs 5.58 MiB memory, which can easily fit in fast memory like SRAM, and with one billion synthetic rules it takes 7.32 GiB memory, which is within the range of DRAM in a line card. These are about an order of magnitude improvement over the state-of-the-art solutions. The above efficient memory size produces high performance. Estimated throughput of the SRAM- and DRAM- based solutions are 284 Gbps and 62 Gbps respectively.
- Ahlgren, Bengt, Christian Dannewitz, Claudio Imbrenda, Dirk Kutscher, and Börje Ohlman. "A survey of information-centric networking." Communications Magazine, IEEE 50, no. 7 (2012): 26--36.Google ScholarCross Ref
- Ahlgren, B., M. D'ambrosio, C. Dannewitz, A. Eriksson, J. Golic, B. Grönvall, D. Horne et al. "Second netinf architecture description." 4WARD EU FP7 Project, Deliverable D-6.2 v2.0 (2010).Google Scholar
- Koponen, Teemu, Mohit Chawla, Byung-Gon Chun, Andrey Ermolinskiy, Kye Hyun Kim, Scott Shenker, and Ion Stoica. "A data-oriented (and beyond) network architecture." In ACM SIGCOMM Computer Communication Review, vol. 37, no. 4, 2007. Google ScholarDigital Library
- Zhang, Lixia, Deborah Estrin, Jeffrey Burke, Van Jacobson, James D. Thornton, Diana K. Smetters, Beichuan Zhang et al. "Named data networking (ndn) project." Technical Report NDN-0001 (2010).Google Scholar
- Yuan, Haowei, Tian Song, and Patrick Crowley. "Scalable NDN forwarding: Concepts, issues and principles." In Computer Communications and Networks (ICCCN), 2012 21st International Conference on, pp. 1--9. IEEE, 2012.Google Scholar
- Degermark, Mikael, Andrej Brodnik, Svante Carlsson, and Stephen Pink. "Small forwarding tables for fast routing lookups." Vol. 27, no. 4. ACM, 1997. Google ScholarDigital Library
- Eatherton, William N. "Hardware-based internet protocol prefix lookups." Master's thesis, Washington University, 1999.Google Scholar
- Jiang, Weirong, and Viktor K. Prasanna. "A memory-balanced linear pipeline architecture for trie-based IP lookup." In High-Performance Interconnects, 2007. HOTI 2007. 15th Annual IEEE Symposium on, pp. 83--90. IEEE, 2007. Google ScholarDigital Library
- Eatherton, Will, George Varghese, and Zubin Dittia. "Tree bitmap: hardware/software IP lookups with incremental updates." ACM SIGCOMM Computer Communication Review 34, no. 2 (2004): 97--122. Google ScholarDigital Library
- Srinivasan, Venkatachary, and George Varghese. "Faster IP lookups using controlled prefix expansion." In ACM SIGMETRICS Performance Evaluation Review, vol. 26, no. 1, pp. 1--10. ACM, 1998. Google ScholarDigital Library
- Smith, P.. "Weekly routing table report." http://thyme.rand.apnic.net.Google Scholar
- Doeringer, Willibald, Günter Karjoth, and Mehdi Nassehi. "Routing on longest-matching prefixes." IEEE/ACM Transactions on Networking (TON) 4, no. 1 (1996): 86--97. Google ScholarDigital Library
- Morrison, Donald R. "PATRICIA--practical algorithm to retrieve information coded in alphanumeric." Journal of the ACM (JACM) 15, no. 4 (1968): 514--534. Google ScholarDigital Library
- Szpankowski, Wojciech. "Patricia tries again revisited." Journal of the ACM (JACM) 37, no. 4 (1990): 691--711. Google ScholarDigital Library
- Knuth, Donald Ervin. "The art of computer programming: sorting and searching." Vol. 3. Pearson Education, 1998. Google ScholarDigital Library
- Alexa: http://www.alexa.com/.Google Scholar
- Dmoz: http://www.dmoz.org/.Google Scholar
- Wang, Yi, Keqiang He, Huichen Dai, Wei Meng, Junchen Jiang, Bin Liu, and Yan Chen. "Scalable name lookup in NDN using effective name component encoding." In Distributed Computing Systems (ICDCS), 2012 IEEE 32nd International Conference on, pp. 688--697. IEEE, 2012. Google ScholarDigital Library
- Wang, Yi, Yuan Zu, Ting Zhang, Kunyang Peng, Qunfeng Dong, Bin Liu, Wei Meng et al. "Wire Speed Name Lookup: A GPU-based Approach." In NSDI, pp. 199--212. 2013. Google ScholarDigital Library
- Yi, Cheng, Alexander Afanasyev, Lan Wang, Beichuan Zhang, and Lixia Zhang. "Adaptive forwarding in named data networking." ACM SIGCOMM computer communication review 42, no. 3 (2012): 62--67. Google ScholarDigital Library
- Yi, Cheng, Alexander Afanasyev, Ilya Moiseenko, Lan Wang, Beichuan Zhang, and Lixia Zhang. "A case for stateful forwarding plane." Computer Communications 36, no. 7 (2013): 779--791. Google ScholarDigital Library
- Sklower, Keith. "A tree-based packet routing table for Berkeley unix." In USENIX Winter, vol. 1991, pp. 93--99. 1991.Google Scholar
- So, Won, Ashok Narayanan, Dave Oran, and Yaogong Wang. "Toward fast NDN software forwarding lookup engine based on hash tables." In Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems, 2012. Google ScholarDigital Library
- So, Won, Ashok Narayanan, and David Oran. "Named data networking on a router: Fast and DoS-resistant forwarding with hash tables." In Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems, 2013. Google ScholarDigital Library
- Shue, Craig A., and Minaxi Gupta. "Packet forwarding: Name-based vs. prefix-based." In IEEE Global Internet Symposium, pp. 73--78. 2007.Google Scholar
- Renesas TCAM: http://www.am.renesas.com/Google Scholar
- Cypress QDR SRAM: http://www.cypress.com/Google Scholar
- Sahasra Processor: http://www.broadcom.comGoogle Scholar
- Kumar, Sailesh, Michela Becchi, Patrick Crowley, and Jonathan Turner. "CAMP: fast and efficient IP lookup architecture." In Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems, pp. 51--60. ACM, 2006. Google ScholarDigital Library
- Fagin, Ronald, Jurg Nievergelt, Nicholas Pippenger, and H. Raymond Strong. "Extendible hashing--a fast access method for dynamic files." ACM Transactions on Database Systems (TODS) 4, no. 3 (1979): 315--344. Google ScholarDigital Library
- Wang, Yi, Tian Pan, Zhian Mi, Huichen Dai, Xiaoyu Guo, Ting Zhang, Bin Liu, and Qunfeng Dong. "NameFilter: Achieving fast name lookup with low memory cost via applying two-stage bloom filters." In INFOCOM, 2013 Proceedings IEEE, pp. 95--99., 2013.Google Scholar
Index Terms
- Scalable Name-Based Packet Forwarding: From Millions to Billions
Recommendations
Scalable high-speed NDN name lookup
ANCS '18: Proceedings of the 2018 Symposium on Architectures for Networking and Communications SystemsName lookup is a core function of the Named Data Networking (NDN) forwarding plane. It performs a name-based longest prefix match lookup against a large amount of variable-length, hierarchical name prefixes. NDN name lookup suffers a scalability ...
Scalable, high-speed on-chip-based NDN name forwarding using FPGA
ICDCN '19: Proceedings of the 20th International Conference on Distributed Computing and NetworkingNamed Data Networking (NDN) is the most promising candidate among the proposed content-based future Internet architectures. In NDN, Forwarding Information Base (FIB) maintains name prefixes and their corresponding outgoing interface(s) and forwards ...
Reliably Scalable Name Prefix Lookup
ANCS '15: Proceedings of the Eleventh ACM/IEEE Symposium on Architectures for networking and communications systemsName prefix lookup is a core building block of information-centric networking (ICN). In ICN hierarchical naming schemes, each packet has a name that consists of multiple variable-length name components, and packets are forwarded based on longest name ...
Comments