This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Recursively Partitioned Static IP Router Tables
December 2010 (vol. 59 no. 12)
pp. 1683-1690
Wencheng Lu, University of Florida, Gainseville
Sartaj Sahni, University of Florida, Gainesville
We propose a method—recursive partitioning—to partition a static IP router table so that when each partition is represented using a base structure, such as a multibit trie or a hybrid shape shifting trie, there is a reduction in both the total memory required for the router table as well as in the total number of memory accesses needed to search the table. The efficacy of recursive partitioning is compared to that of the popular front-end table method to partition IP router tables. Our proposed recursive partitioning method outperformed the front-end method of all our test sets.
Index Terms:
Packet forwarding, longest prefix matching, router table partitioning.
Citation:
Wencheng Lu, Sartaj Sahni, "Recursively Partitioned Static IP Router Tables," IEEE Transactions on Computers, vol. 59, no. 12, pp. 1683-1690, Dec. 2010, doi:10.1109/TC.2010.137
Usage of this product signifies your acceptance of the Terms of Use.