Old Web
English
Sign In
Acemap
>
Paper
>
A Specialized Static Content Addressable Memory for Longest Prefix Matching in Internet Protocol Routing
A Specialized Static Content Addressable Memory for Longest Prefix Matching in Internet Protocol Routing
2011
Satendra Kumar Maurya
Lawrence T. Clark
Keywords:
IPv6
Real-time computing
Longest prefix match
Computer network
Internet Protocol
IPv4
Content-addressable memory
Router
Scalability
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]