Sciweavers

18 search results - page 2 / 4
» Scalable IP Lookup for Programmable Routers
Sort
View
INFOCOM
2010
IEEE
13 years 3 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
ANCS
2005
ACM
13 years 10 months ago
A novel reconfigurable hardware architecture for IP address lookup
IP address lookup is one of the most challenging problems of Internet routers. In this paper, an IP lookup rate of 263 Mlps (Million lookups per second) is achieved using a novel ...
Hamid Fadishei, Morteza Saheb Zamani, Masoud Sabae...
CN
2004
148views more  CN 2004»
13 years 4 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
CONEXT
2008
ACM
13 years 6 months ago
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
Jing Fu, Jennifer Rexford
CF
2008
ACM
13 years 6 months ago
Multi-terabit ip lookup using parallel bidirectional pipelines
To meet growing terabit link rates, highly parallel and scalable architectures are needed for IP lookup engines in next generation routers. This paper proposes an SRAM-based multi...
Weirong Jiang, Viktor K. Prasanna