o(log n) dynamic router-tables for prefixes and ranges (2003)

Cached

Download Links

by Haibin Lu , Sartaj Sahni
Venue:IEEE Transactions on Computers
Citations:5 - 1 self

Active Bibliography

11 Efficient construction of pipelined multibit-trie Router-Tables – Kun Suk Kim, Sartaj Sahni - 2003
8 An O(log n) Dynamic Router-Table Design – Sartaj Sahni, Kun Suk Kim - 2004
3 Enhanced interval trees for dynamic IP router-tables – Haibin Lu, Sartaj Sahni - 2004
2 Dynamic Tree Bitmap For IP Lookup and Update – Sartaj Sahni, Haibin Lu
6 A B-Tree Dynamic Router-Table Design – Haibin Lu, Sartaj Sahni - 2005
3 Prefix- and interval-partitioned dynamic IP router-tables – Haibin Lu, Kun Suk, Kim Sartaj Sahni - 2005
10 Efficient Construction Of Multibit Tries For IP Lookup – Sartaj Sahni, Kun Suk Kim - 2003
Algorithms and Data Structures for IP Lookups – Ioannis Ioannidis - 2005
17 Routing with a Clue – Yehuda Afek, Anat Bremler-barr, Sariel Har-peled - 1999
8 Efficient Construction Of Variable-Stride Multibit Tries For IP Lookup – Sartaj Sahni, Kun Suk Kim - 2002
85 IP-Address Lookup Using LC-Tries – Stefan Nilsson, Gunnar Karlsson - 1998
9 Fast Prefix Matching of Bounded Strings – Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-phong Vo, Jia Wang - 2003
20 Scalable High-Speed Prefix Matching – Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner, Eth Zürich - 2001
94 Fast Address Lookups Using Controlled Prefix Expansion – V. Srinivasan, G. Varghese - 1999
10 IP Address Lookup in Hardware for High-Speed Routing – Andreas Moestedt, Peter Sjödin - 1998
1 TrieC: A High-Speed IPv6 Lookup with Fast Updates Using Network Processor – Xianghui Hu, Bei Hua, Xinan Tang - 2005
Data Structures For IP Lookup With Bursty Access Patterns – Sartaj Sahni, Kun Suk Kim
1 Efficient IP table lookup via adaptive stratified trees with selective reconstructions. 12th European Symp – Marco Pellegrini, Giordano Fusco
3 XOR-based schemes for fast parallel IP lookups – Giancarlo Bongiovanni, Paolo Penna - 2003