Anand Sarda

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
— In this paper we present a new memory-efficient scheme for address lookup that exploits the caching support provided by general-purpose processors. We propose Compact Prefix Tries, in which prefixes occurring at multiple levels of a subtrie are compressed into a single node that fits in a single cache line. The scheme performs well in compressing dense as(More)
  • 1