TRASH A dynamic LC-trie and hash data structure

@article{Olsson2007TRASHAD,
  title={TRASH A dynamic LC-trie and hash data structure},
  author={Robert Olsson and Sebastian Nilsson},
  journal={2007 Workshop on High Performance Switching and Routing},
  year={2007},
  pages={1-6}
}
A dynamic LC-trie is currently used in the Linux kernel to implement address lookup in the IP routing table. The main virtue of this data structure is that it supports both fast address lookups and frequent updates of the table. Also, it has an efficient memory management scheme and supports multiprocessor architectures using the RCU locking mechanism. The structure scales nicely: the expected number of memory accesses for one lookup is O(log log n), where n is the number of entries in the… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 11 references

pktgen the linux packet generator

  • R. Olsson
  • Proceedings of the Linux Symposium, Ottawa…
  • 2005
1 Excerpt

IP routing with LC-tries

  • S. Nilsson, G. Karlsson
  • IEEE Journal on Selected Areas in Communications…
  • 1999
1 Excerpt

An experimental study of compression methods for dynamic tries , " 1998 , submitted to Algorithmica . [ 6 ] E . Fredkin , " Trie memory

  • G. H. Gonnet, R. A. Baeza-Yates
  • Handbook of Algorithms and Data Structures
  • 1960

LC - trie implementation in linux , " linux v 2 . 6 . 16 . 27 , net / ipv 4 / fib trie . c . [ 3 ]

  • Nilsson, M. Tikkanen

Similar Papers

Loading similar papers…