With the rapid growth of the Internet, IP-lookup becomes the bottle-neck in network traffic management. Therefore, the design of high speed IP routers has been a major area of research. The focus of this paper is on achieving significant reduction in memory requirements for the longest prefix-match operation needed in IPv4/v6 lookups. The Longest Prefix Matching (LPM) is one of the problems in ...

The Internet Protocol (IP) address lookup is required to be resolved fast to keep up with data rate increases. To cope with the increasing number of entries, solutions for IP lookup based on random access memory (RAM), which store prefixes in a trie-based structure, are of interest. In this paper, we propose a flexible and fast trie-based IPlookup algorithm where parallel searching is performed...

Topological considerations are of paramount importance in the design of a P2P lookup service. We present TOPLUS, a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. TOPLUS is fully distributed and symmetric, in the sense that all nodes have the same role. Packets are routed to their destination along a path ...

Simultaneous multithreading (SMT) processors support multiple active concurrent hardware threads in order to share processor resources such as functional units and memory. This thread-level-parallelism (TLP) can be exploited in form of packet-level-parallelisms required in packet processing devices called network processors. In this paper, we propose hardware queues for scheduling process threa...

Transmission Control Protocol/ Internet Protocol (TCP/IP) network is widely used as the source of information and medium of communication. An Internet Protocol (IP) also becomes the most important core protocol used in the world’s largest network. The larger IP network size it becomes the longer IP addressing delay it endures, so many techniques are invented to increase the performance of the I...

One of the key design issues for the new generation IP routers is the route lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix matching on the address lookup in order to determine the packet’s next hop. This paper presents a fast route lookup mechanism that only needs tiny SRAM and can be implemented in a pipelined skill in hardware. Based on the ...

A high speed IP address lookup engine with a reasonable memory cost is a key factor for designing a router at wire speed. This paper proposes a hardware solution that performs each IP address lookup in a few number of memory accesses with minimum amount of memory requirement. Our solution is based on dividing destination IP address into several segments. For finding the optimum address segmenta...