Hardware-Assist for IPv6 Routing Table Lookup
نویسندگان
چکیده
Routers are key building blocks in networks. They need to cope with high data rates in the range of multiple gigabit per second that are owing through them. Therefore, speciically performance critical functions should be implemented in dedicated hardware units in order to speed up the forwarding task. These units can be embedded within regular workstations or into dedicated router architectures. This paper we addresses one of the most performance critical components of a router, the routing table and its access and search mechanisms. Earlier work has shown that this is more critical with respect to the resulting performance than IP processing itself. A simple but eecient organization of the routing table using binary trees and oo-the-shelf SRAMs is presented together with a suited search algorithm.
منابع مشابه
A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملTrieC: A High-Speed IPv6 Lookup with Fast Updates Using Network Processor
Address lookup is one of the main bottlenecks in Internet backbone routers, as it requires the router to perform a longest-prefix-match when searching the routing table for a next hop. Ever-increasing Internet bandwidth, continuously growing prefix table size and inevitable migration to IPv6 address architecture further exacerbate this situation. In recent years, a variety of highspeed address ...
متن کاملIC Design of IPv6 Routing Lookup for High Speed Networks
In recent years, there are many researches for routing lookup. Most of them can achieve high average search throughput for IPv4, but they are slow in the updating speed and cannot suit to 128 bits IPv6 address even in hardware architecture. This paper proposed a routing lookup system which contains an ASIC of routing lookup table and offchip memory sets. In the performance analysis, 91.89% rout...
متن کاملIP Lookup in IPv6 Networks
The IP Lookup Process is a key bottleneck in routing because of increasing routing table sizes, increasing traffic, higher speed links, and migration to 128-bit IPv6 addresses. The IP routing lookup involves computation of the best matching prefix (BMP) for which existing solutions, such as BSD Radix Tries, scale poorly when traffic in the router increases or when employed for IPv6 address look...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998