Many address lookup methods on the IP routers have been recently proposed to improve the packet forwarding capability; nevertheless, their performance prediction is very limited because of lack of considering actual traffic characteristics in their evaluations. It is necessary to consider actual traffic to predict more realistic performances on routers, specially in case of layers 3 and 4 switc...

As routing tables in core Internet routers grow to exceed 100 000 entries, it is becoming essential to develop methods to reduce the lookup time required to forward packets toward their destinations. In this paper, we employ a bank of novel thermally tuned fiber-Bragg-grating-based optical correlators to construct an “optical bypass” to accelerate conventional electronic Internet routers. The c...

Multicasting has become increasingly important with the emergence of Internet-based applications such as IP telephony, audio/video conferencing, distributed databases and software upgrading. IP multicasting is an efficient way to distribute information from a single source to multiple destinations at different locations. In practice IP is considered as a layer 3 protocol. Multiprotocol Label Sw...

Various schemes for high-performance IP address lookups have been proposed recently. Pre-computations are usually used by the special designed IP address lookup algorithms for better performance in terms of lookup speed and memory requirement. However, the disadvantage of the pre-computation based schemes is that when a single prefix is added or deleted, the entire data structure may need to be...

Many IP forwarding engines have used TCAM(Ternary Content Addressable Memory) for IP address lookup. While TCAM has the advantage of parallel lookup in a single step, it has a difficulty in updating a prefix table. TCAM requires the prefix table to be ordered for the longest prefix matching, so each update may incur several memory movements to maintain the ordering. For the fast updating of the...

Multiplication by a constant is a common operation for many signal, image, and video processing applications that are implemented in field-programmable gate arrays (FPGAs). Constant-coefficient multipliers (KCMs) are often implemented in the logic fabric using lookup tables (LUTs), reserving embedded hard multipliers for general-purpose multiplication. This paper describes a two-operand additio...

IP lookup schemes in Internet routers can be broadly classified into two categories: static and dynamic. While static schemes improve lookup speed and reduce memory requirement by using pre-computations, their drawback is that when prefixes are added or deleted, the entire data structure may need to be rebuilt and thus very slow. Dynamic schemes can perform fast prefix insertions and deletions ...

Due to the emergence of new network applications, current IP lookup engines must support high-bandwidth, low lookup latency and the ongoing growth of IPv6 networks. However, existing solutions are not designed to address jointly those three requirements. This paper introduces SHIP, an IPv6 lookup algorithm that exploits prefix characteristics to build a two-level data structure designed to meet...

In this paper, we propose new shared memory multiprocessor architectures and evaluate their performance for future Internet Protocol (IP) routers based on Symmetric Multi-Processor (SMP) and Cache Coherent Non-Uniform Memory Access (CC-NUMA) paradigms. We also propose a benchmark application suite, RouterBench, which consists of four categories of applications representing key functions on the ...