Reliably scalable name prefix lookup

Yuan, Haowei; Crowley, Patrick

doi:10.1109/ancs.2015.7110125

Cited by 39 publications

(19 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To cope with the issue of time-consuming longest prefix matching, Yuan and Crowley propose a longest prefix matching algorithm based on binary search of hash tables, which reduces the worst case computation complexity [4]. So et al design an NDN forwarding engine with a) fast name lookup via hash tables with fast collision-resistant hash computation, b) efficient FIB lookup algorithm that provides good average and worst case FIB lookup time, and c) multi-threaded forwarding that exploits computing capabilities of multi-core CPUs [3].…”

Section: Related Workmentioning

confidence: 99%

“…Despite the fact that NDN provides numerous useful functions, timeconsuming caching and name-based forwarding raise an issue related to forwarding speed [2], and hence high-speed NDN router implementation has become a hot research topic. While many studies successfully improve name-based forwarding speed focusing on efficient longest prefix matching based on hash tables [3], [4], few studies focus on fast computation of caching, which is computationally heavy due to its per-packet processing.…”

Section: Introductionmentioning

confidence: 99%

“…[14]. To achieve high-speed NDN packet processing, many researches attack issues of heavy NDN functions, focusing on efficient longest name prefix matching [3], [4] and efficient caching [3].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Lightweight Cache Admission Algorithm for Fast NDN Software Routers

Takemasa

Hasegawa

2019

Journal of Information Processing

View full text Add to dashboard Cite

This paper addresses how to design a cache algorithm for achieving high cache hit rate and high packet forwarding rate of Named Data Networking (NDN) software routers. Although sophisticated cache eviction algorithms like LFU and Adaptive Replacement Cache (ARC) successfully achieve high cache hit rate, they incur heavy computational overheads to choose a victim Data packet from the cache. In contrast, cache admission is expected to achieve high cache hit rate with lightweight computation since it decides simply whether an incoming Data packet should be inserted into the cache or not. In this paper, we design a frequency-based cache admission algorithm, Filter, with lightweight computation by simply counting frequencies of incoming Data packets in a fixed time window. A simulation-based evaluation proves that Filter achieves high cache hit rate comparable to sophisticated cache eviction algorithms like ARC. By implementing a prototype of an NDN software router with Filter, we validate that the NDN router with Filter improves packet forwarding rate compared to that with a sophisticated cache eviction algorithm like ARC and even that with a simple one like FIFO.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Lightweight Cache Admission Algorithm for Fast NDN Software Routers

Takemasa

Hasegawa

2019

Journal of Information Processing

View full text Add to dashboard Cite

show abstract

“…Several proposals for the implementation of FIBs for NDN rely on the use of tries and massive parallelism in order to avoid bottlenecks in the encoding process needed to use the tries [42,43]. Other approaches are based on hash tables for FIB lookups [31,32,36,45], which requires larger memory footprints and is not scalable to prefix names with a large number of name components. Hash-based approaches for name-based forwarding are based on DRAM technology and rely on massive parallel processing, because they would require hundreds of MiBs for just a few million prefixes.…”

Section: Limitations Of Using Fibsmentioning

confidence: 99%

Content-Centric Networking at Internet Scale through The Integration of Name Resolution and Routing

Garcia-Luna-Aceves¹,

Mirzazad-Barijough²,

Hemmati³

2016

Proceedings of the 3rd ACM Conference on Information-Centric Networking

View full text Add to dashboard Cite

We introduce CCN-RAMP (Routing to Anchors Matching Prefixes), a new approach to content-centric networking. CCN-RAMP offers all the advantages of the Named Data Networking (NDN) and Content-Centric Networking (CCNx) but eliminates the need to either use Pending Interest Tables (PIT) or lookup large Forwarding Information Bases (FIB) listing name prefixes in order to forward Interests. CCN-RAMP uses small forwarding tables listing anonymous sources of Interests and the locations of name prefixes. Such tables are immune to Interest-flooding attacks and are smaller than the FIBs used to list IP address ranges in the Internet. We show that no forwarding loops can occur with CCN-RAMP, and that Interests flow over the same routes that NDN and CCNx would maintain using large FIBs. The results of simulation experiments comparing NDN with CCN-RAMP based on ndnSIM show that CCN-RAMP requires forwarding state that is orders of magnitude smaller than what NDN requires, and attains even better performance.

show abstract

“…The approaches proposed for the LPM problem into an ICN router can be classified in three categories: hash-table based, bloom-filter based, trie-based. A concise overview of the state of the art is available in [73], wherein the author proposed a binary search of hash tables to have a worst-case log(k) hash-table lookups to match a name with k components, improving on other hash-based techniques that achieve worst-case performance linear in k. Moreover, there exist hybrid approaches that strive to combine the strength of different techniques to overcome their weaknesses. For example, Quan et al [74] propose a dual-step approach using first, smaller bloom filters so reducing the false positive rate, and then, small-scale tries so reducing the memory requirements, to speed-up the lookup.…”

Section: Forwarding Information Base For Prefix-namesmentioning

confidence: 99%

Understanding the social impact of ICN: between myth and reality

et al. 2016

View full text Add to dashboard Cite

The Information Centric Networking (ICN) paradigm is attracting more and more interest from the research community due to its peculiarities that make it one of the best candidates for constructing the Future Internet. For this reason, there are many papers in literature that study how to transform ICN principles in reality in order to magnify its relevance for the society. In order to provide a solid summary of the state of the art, the present contribution tries to summarize the main findings related to this research field. In particular, an overview on the most important ICN architectures, their main aspects, common networking approaches, and differences, is provided. Moreover, the work carried out in standardization bodies, with particular attention to the list of baseline scenarios defined in this context, is illustrated. Also the main international projects that are trying to integrate ICN networking primitives in pioneering use cases are presented, describing proposed architectures and related challenges for enabling informationcentric primitives in current network infrastructures. Finally, the work highlights design principles and core components to build ICN-enabled network devices.

show abstract

Reliably scalable name prefix lookup

Cited by 39 publications

References 12 publications

Lightweight Cache Admission Algorithm for Fast NDN Software Routers

Lightweight Cache Admission Algorithm for Fast NDN Software Routers

Content-Centric Networking at Internet Scale through The Integration of Name Resolution and Routing

Understanding the social impact of ICN: between myth and reality

Contact Info

Product

Resources

About