BEST LOOKUP ALGORITHM FOR 100+GBPS IPV6 PACKET FORWARDING
نویسندگان
چکیده
منابع مشابه
An IP packet forwarding technique based on partitioned lookup table
In this paper, we present an efficient IP packet forwarding methodology and architecture. This is achieved by partitioning the lookup table into the smaller ones for each output port and allowing a forwarding engine to process them in parallel. This effectively reduces the complexity of finding “the longest prefix match” problem to “the first prefix match” problem.
متن کاملProjecting IPv6 Packet Forwarding Characteristics Under Internet-wide Deployment
While routing table growth, its impact, and causes have been examined extensively for IPv4, little work in this direction exists for IPv6. This paper is the first step at examining performance aspects of IPv6 packet forwarding. We do so by using a software implementation of various packet forwarding algorithms used by routers and running them against IPv6 tables. In the lack of a wide deploymen...
متن کاملAdvanced Algorithmic Approach for IP Lookup (IPv6)
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP routing lookup requires computing the best matching prefix, for which standard solutions like hashing were believed to be inapplicable. The best existing solution we know of, BSD radix tries, scales badly as IP moves t...
متن کامل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...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Engineering and Technology
سال: 2014
ISSN: 2321-7308,2319-1163
DOI: 10.15623/ijret.2014.0327002