There has recently been a notable interest in the organization of routing information to enable fast lookup of IP addresses. The interest is primarily motivated by the goal of building multi-Gb/s routers for the Internet, without having to rely on multi-layer switching techniques. We address this problem by using an LC-trie, a trie structure with combined path and level compression. This data s...

This poster describes the design of a distributed system to resolve flat semantic-free identifiers. Because Distributed Hash Tables (DHTs, [10, 13]) in theory allow users of the DHT to perform fast lookups on flat identifiers, researchers have—too eagerly, we argue—proposed using them as a substrate for various resolution tasks. For example, researchers have argued for infrastructure-style DHTs...

This paper presents a way of doing IP packet classification at high speed, a critical operation for highcapacity routers. Two hardware designs are presented, both based on simple, standard logic. One goal is that the designs should be inexpensive and simple enough that it is feasible to replicate them on each input port on a router. The first design is for unicast forwarding, based on destinati...

Both IP lookup and packet classification in IP routers can be implemented by some form of tree traversal. SRAM-based Pipelining can improve the throughput dramatically. However, previous pipelining schemes result in unbalanced memory allocation over the pipeline stages. This has been identified as a major challenge for scalable pipelined solutions. This paper proposes a flexible bidirectional l...

With today’s networks complexity, routers in backbone links must be able to handle millions of packets per second on each of their ports. Determining the corresponding output interface for each incoming packet based on its destination address requires a longest matching prefix search on the IP address. Therefore, IP address lookup is one of the most challenging problems for backbone routers. In...

Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets per second per port. Using the “rule-of-thumb” that it takes roughly 1000 packets per second for every 106 bits per second of line rate, an OC-192 line requires routing lookups per second; well above current router capab...

IP Routers use sophisticated forwarding table (FIB) lookup algorithms that minimize lookup time, storage, and update time. This paper presents SMALTA, a practical, near-optimal FIB aggregation scheme that shrinks forwarding table size without modifying routing semantics or the external behavior of routers, and without requiring changes to FIB lookup algorithms and associated hardware and softwa...

IP packet forwarding is a key operation in internet routers and the limiting factor is the IP address lookup. Since almost a whole router is integrated on a chip it is important to design the functional blocks with SoC integration in mind. Here a hardware architecture for IP address lookup based on the kmultibit trie search algorithm is presented. The designed and simulated architecture is base...