Sciweavers

44 search results - page 1 / 9
» Scalable IP Routing Lookup in Next Generation Network
Sort
View
ICOIN
2003
Springer
13 years 9 months ago
Scalable IP Routing Lookup in Next Generation Network
Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix problem in O(1) time without considering...
Chia-Tai Chan, Pi-Chung Wang, Shuo-Cheng Hu, Chung...
NETWORK
2008
115views more  NETWORK 2008»
13 years 4 months ago
A distributed and scalable routing table manager for the next generation of IP routers
Kim Khoa Nguyen, Brigitte Jaumard, Anjali Agarwal
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...
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
ICC
2000
IEEE
124views Communications» more  ICC 2000»
13 years 8 months ago
A Fast IP Routing Lookup Scheme
Abstract—A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. performs the IP address look...
Pi-Chung Wang, Yaw-Chung Chen, Chia-Tai Chan