Dynamic Tree Bitmap for IP Lookup and Update

Authors:
Sartaj Sahni;Haibin Lu
Affiliations:
University of Florida, Gainesville, USA;University of Florida, Gainesville, USA
Venue:
ICN '07 Proceedings of the Sixth International Conference on Networking
Year:
2007

Citing 0
Cited 5

A fast IP routing lookup architecture for multi-gigabit switching routers based on reconfigurable systems

Microprocessors & Microsystems
High throughput and large capacity pipelined dynamic search tree on FPGA

Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays
Advanced hashing schemes for packet forwarding using set associative memory architectures

Journal of Parallel and Distributed Computing
An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Computer Networks: The International Journal of Computer and Telecommunications Networking
GAMT: a fast and scalable IP lookup engine for GPU-based software routers

ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a data structure-dynamic tree bitmap- for the representation of dynamic IP router tables that must support very high lookup and update rates. In fact, the dynamic tree bitmap is able to support updates at the same rate as lookups and is very competitive with other structures-tree bitmap and BaRT-proposed earlier for dynamic tables. Although the dynamic tree bitmap requires more memory than is required by the tree bitmap and BaRT structures, the required memory remains reasonable. The real value of our structure is its ability to support a very high update rate.