Adaptive and Fast Forwarding in Named Data Networks

Please enable javascript in your browser.

Ghasemi Shaktaee, Chavoosh | 2014

645 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 46153 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Movaghar, Ali
Abstract:
Named Data Networking (NDN) is a revolutionary architecture for the future Internet. The existence of a large number of unbounded and variable-length names in NDN requires substantial re-engineering of network architecture, especially for name lookup which is key to NDN routers. In this paper, we propose a novel NDN structure – called Fast-Come-Fast-Served (FCFS) – for fast, scalable, and memoryefficientlookup. To the best of our knowledge, this is the first optimized structure that employs Deterministic FiniteAutomaton (DFA) for Longest Prefix Matching (LPM) in NDN. The strengths of arrays and hash tables as core data structures are combined to make FCFS fast and cache-friendly. The NDN forwarding engine is also modified to speed up packet forwarding. Our experimental results on real domain sets demonstrate that FCFS provides more than 2x performance improvement over most known alternatives in terms of memory usage and speed of common processing functions in NDN routers, i.e., insert, lookup, and remove
Keywords:
Named Data Network (NDN) ; Fast Forwarding ; Forwarding Plane in Named Data Networks ; Content Centric Routers ; Longest Prefix Matching

No TOC