Hashing is a widely used method to perform fast lookup. Several schemes have been proposed to support Internet lookup that includes IP lookup and packet classification. Rectangular search is a well-known packet classification scheme based on multiple hash accesses for different filter length. It shows good scalability with respect to the number of fil ters; however, the lookup performance is no...

Trie-based data structures for implementing IP lookups have attracted considerable research aUention. Techniques such as path compression, level compression, generalized level compression, and controlled prefix expansion are commonly used to implement lookup tables. [0 this paper, we present a fundamentally new technique that relies on directed acyclic graphs (DAGs). which, when coupled with ge...

MPLS is highlightened as the most promising technology for the integrated IP-over ATM backbone networks. Nowadays, one of the important practical issues in MPLS is the capability to provide Differentiated Services. For integrating IP and ATM with scalability, MPLS based ATM switch network can be available, especially for the fast Internet services adding Layer 3 routing module to the existing A...

An IP router has to match each incoming packet’s IP destination address against all stored prefixes in its forwarding table. This task is increasingly more challenging as the routers have to: not only keep up with the ultra-high link speeds, but also be ready to switch to the 128-bit IPv6 address space while the number of prefixes grows quickly. Commercially, many routers employ Ternary Content...

When a packet arrives at a flow-aware router, it is subject to a number of lookup and classification operations. The packet is first checked against an access control list and/or firewall to determine whether it will be accepted or rejected. This classification function supports packet filtering and provides IPSec security associations. A second classification is used to regulate the traffic on...

Pip is an internet protocol that scales efficiently encodes policy. It facilitates many advanced features, such as mobility and multiple defaults routing, and has a well-bounded routing table lookup, and is therefore fast. Pip is proposed as an alternative to the two “medium term” proposals that emerged from the Road (Routing and Addressing) group to deal with the dual IP problems of scaling an...

An IP route lookup can be considered as a string matching problem on the destination address. Finite State Automata (FSA) are a flexible and efficient way to match strings. This paper describes how a routing table can be encoded as an FSA and how, through a process of state reduction, we can obtain an optimal representation. This gives insights into the basic properties of the longest-prefix ma...

As a result of the exploding bandwidth demand from the Internet, network router and switch designers are designing and fabricating a growing number of microchips specifically for networking devices rather than traditional computing applications. In particular, a new breed of microprocessors, called Internet processors, has emerged that is designed to efficiently execute network protocols on var...

Multiplication is one of the widely used arithmetic operations in a variety applications, such as image/video processing and machine learning. FPGA vendors provide high-performance multipliers form DSP blocks. These are not only limited number have fixed locations on FPGAs but can also create additional routing delays may prove inefficient for smaller bit-width multiplications. Therefore, addit...

The Domain Name System (DNS) is a ubiquitous part of everyday computing, translating human-friendly machine names to numeric IP addresses. Most DNS research has focused on server-side infrastructure, with the assumption that the aggressive caching and redundancy on the client side are sufficient. However, through systematic monitoring, we find that client-side DNS failures are widespread and fr...