Survey and proposal on binary search algorithms for longest prefix match

H Lim, N Lee - IEEE Communications Surveys & Tutorials, 2011 - ieeexplore.ieee.org
The IP address lookup has been a major challenge for Internet routers. This is accompanied
with a background of advances in link bandwidth and rapid growth in Internet traffic and the …

Ipv6 lookups using distributed and load balanced bloom filters for 100gbps core router line cards

H Song, F Hao, M Kodialam… - IEEE INFOCOM …, 2009 - ieeexplore.ieee.org
Internet line speeds are expected to reach 100 Gbps in a few years. To match these line
rates, a single router line card needs to forward more than 150 million packets per second …

Compressing IP forwarding tables: Towards entropy bounds and beyond

G Rétvári, J Tapolcai, A Kőrösi, A Majdán… - Proceedings of the …, 2013 - dl.acm.org
Lately, there has been an upsurge of interest in compressed data structures, aiming to pack
ever larger quantities of information into constrained memory without sacrificing the …

On the interplay of voltage/frequency scaling and device power management for frame-based real-time embedded applications

V Devadas, H Aydin - IEEE Transactions on Computers, 2010 - ieeexplore.ieee.org
Voltage/Frequency Scaling (VFS) and Device Power Management (DPM) are two popular
techniques commonly employed to save energy in real-time embedded systems. VFS …

Priority tries for IP address lookup

H Lim, C Yim, EE Swartzlander - IEEE transactions on …, 2010 - ieeexplore.ieee.org
High-speed IP address lookup is essential to achieve wire speed packet forwarding in
Internet routers. The longest prefix matching for IP address lookup is more complex than …

Flashtrie: Hash-based prefix-compressed trie for IP route lookup beyond 100Gbps

M Bando, HJ Chao - 2010 Proceedings IEEE INFOCOM, 2010 - ieeexplore.ieee.org
It is becoming apparent that the next generation IP route lookup architecture needs to
achieve speeds of 100-Gbps and beyond while supporting both IPv4 and IPv6 with fast real …

CAMP: fast and efficient IP lookup architecture

S Kumar, M Becchi, P Crowley, J Turner - Proceedings of the 2006 ACM …, 2006 - dl.acm.org
A large body of research literature has focused on improving the performance of longest
prefix match IP-lookup. More recently, embedded memory based architectures have been …

FlashTrie: beyond 100-Gb/s IP route lookup using hash-based prefix-compressed trie

M Bando, YL Lin, HJ Chao - IEEE/ACM Transactions On …, 2012 - ieeexplore.ieee.org
It is becoming apparent that the next-generation IP route lookup architecture needs to
achieve speeds of 100 Gb/s and beyond while supporting IPv4 and IPv6 with fast real-time …

ABC: Adaptive binary cuttings for multidimensional packet classification

H Song, JS Turner - IEEE/ACM Transactions On Networking, 2012 - ieeexplore.ieee.org
Decision tree-based packet classification algorithms are easy to implement and allow the
tradeoff between storage and throughput. However, the memory consumption of these …

Radient: Scalable, memory efficient name lookup algorithm for named data networking

D Saxena, V Raychoudhury - Journal of Network and Computer …, 2016 - Elsevier
Abstract Named Data Networking (NDN) aims to discard the existing host-centric networking
paradigm just to replace it with a more practical Content-Centric Networking (CCN) …