Abstract — Conventional routing cache systems store destina-tion IP addresses in their cache directory. We present a routing cache technique that stores the most recently used route prefixes, instead of IP addresses, to achieve significantly smaller cache size. A nesting prefix is partially represented in this cache by its minimal expansions. Such expanded prefixes are obtained using an incremental technique without any modifications to the routing table. Consequently, our cache works with most of the common route lookup algorithms and efficiently maintains coherency with the routing table. Experiments show that for a hit ratio over 0.96 our design can achieve more than 33 times reduction in cache size, compared to a conventional routing ca...
Internet address lookup is a challenging problem because of in-creasing routing table sizes, increas...
Caching is a popular mechanism for enhancing performance of memory access speed. To achieve such enh...
Abstract—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased...
Abstract. Caching recently referenced IP addresses and their forwarding information is an effective ...
Abstract — In this paper we present a new memory-efficient scheme for address lookup that exploits t...
Abstract—High performance routers are mostly implemented with network processors because of their so...
Earlier research has shown that the route lookup performance of a network processor can be significa...
Abstract. High end routers are targeted at providing worst case through-put guarantees over latency....
The size of the global Routing Information Base (RIB) has been increasing at an alarming rate. As a ...
Abstract — In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies ...
IP address lookup is a fundamental task for Internet routers, due to the rapid growth of both traffi...
The IP address lookup problem is one of the major bottlenecks in high performance routers. Previou...
All global routing protocols use hierarchies to allow scaling to a world wide community while keepin...
The performance gap between processor and memory continues to remain a major performance bottleneck ...
All global routing protocols use hierarchies to allow scaling to a world wide community while keepin...
Internet address lookup is a challenging problem because of in-creasing routing table sizes, increas...
Caching is a popular mechanism for enhancing performance of memory access speed. To achieve such enh...
Abstract—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased...
Abstract. Caching recently referenced IP addresses and their forwarding information is an effective ...
Abstract — In this paper we present a new memory-efficient scheme for address lookup that exploits t...
Abstract—High performance routers are mostly implemented with network processors because of their so...
Earlier research has shown that the route lookup performance of a network processor can be significa...
Abstract. High end routers are targeted at providing worst case through-put guarantees over latency....
The size of the global Routing Information Base (RIB) has been increasing at an alarming rate. As a ...
Abstract — In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies ...
IP address lookup is a fundamental task for Internet routers, due to the rapid growth of both traffi...
The IP address lookup problem is one of the major bottlenecks in high performance routers. Previou...
All global routing protocols use hierarchies to allow scaling to a world wide community while keepin...
The performance gap between processor and memory continues to remain a major performance bottleneck ...
All global routing protocols use hierarchies to allow scaling to a world wide community while keepin...
Internet address lookup is a challenging problem because of in-creasing routing table sizes, increas...
Caching is a popular mechanism for enhancing performance of memory access speed. To achieve such enh...
Abstract—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased...