Pipelined SRAM-based algorithmic solutions have be-come competitive alternatives to TCAMs (ternary content addressable memories) for high throughput IP lookup. Mul-tiple pipelines can be utilized in parallel to improve the throughput further. However, several challenges must be addressed to make such solutions feasible. First, the mem-ory distribution over different pipelines as well as across different stages of each pipeline must be balanced. Second, the traffic among these pipelines should be balanced. Third, the intra-flow packet order should be preserved. In this pa-per, we propose a parallel SRAM-based multi-pipeline ar-chitecture for IP lookup. A two-level mapping scheme is developed to balance the memory requirement among the pipeli...
This paper proposes a novel high throughput internet protocol (IP) lookup engine, which is built upo...
[[abstract]]One of the pertinent design issues for new generation IP routers is the route-lookup mec...
A large body of research literature has focused on improving the performance of longest prefix match...
Abstract—Continuous growth in network link rates poses a strong demand on high speed IP lookup engin...
To meet growing terabit link rates, highly parallel and scal-able architectures are needed for IP lo...
Abstract—Lookup engines for various network protocols can be implemented as tree-like search structu...
Most high-speed Internet Protocol (IP) lookup implemen-tations use tree traversal and pipelining. Ho...
Abstract: Fast IP address lookup mechanism is a major design issue for the next generation routers. ...
Most high-speed Internet Protocol (IP) lookup imple-mentations use tree traversal and pipelining. Du...
UnrestrictedPacket forwarding has long been a performance bottleneck in Internet infrastructure, inc...
Includes bibliographical references (page 70)The internet today has grown into a vast network of net...
Rapid growth in network link rates poses a strong de-mand on high speed IP lookup engines. Trie-base...
International audienceAs network link rates are being pushed beyond 40Gbps, IP lookup in high-speed ...
Abstract—As network link rates are being pushed beyond 40 Gbps, IP lookup in high-speed routers is m...
Abstract—As network link rates are being pushed beyond 40 Gb/s, IP lookup in high-speed routers is m...
This paper proposes a novel high throughput internet protocol (IP) lookup engine, which is built upo...
[[abstract]]One of the pertinent design issues for new generation IP routers is the route-lookup mec...
A large body of research literature has focused on improving the performance of longest prefix match...
Abstract—Continuous growth in network link rates poses a strong demand on high speed IP lookup engin...
To meet growing terabit link rates, highly parallel and scal-able architectures are needed for IP lo...
Abstract—Lookup engines for various network protocols can be implemented as tree-like search structu...
Most high-speed Internet Protocol (IP) lookup implemen-tations use tree traversal and pipelining. Ho...
Abstract: Fast IP address lookup mechanism is a major design issue for the next generation routers. ...
Most high-speed Internet Protocol (IP) lookup imple-mentations use tree traversal and pipelining. Du...
UnrestrictedPacket forwarding has long been a performance bottleneck in Internet infrastructure, inc...
Includes bibliographical references (page 70)The internet today has grown into a vast network of net...
Rapid growth in network link rates poses a strong de-mand on high speed IP lookup engines. Trie-base...
International audienceAs network link rates are being pushed beyond 40Gbps, IP lookup in high-speed ...
Abstract—As network link rates are being pushed beyond 40 Gbps, IP lookup in high-speed routers is m...
Abstract—As network link rates are being pushed beyond 40 Gb/s, IP lookup in high-speed routers is m...
This paper proposes a novel high throughput internet protocol (IP) lookup engine, which is built upo...
[[abstract]]One of the pertinent design issues for new generation IP routers is the route-lookup mec...
A large body of research literature has focused on improving the performance of longest prefix match...