High-performance routing search algorithm in satellite IP switches

In order to achieve high performance IP address lookup and a specified circuit suitable for onboard IP switch, through the analysis and comparison of the existing onboard routing search algorithms, this paper put forward a novel IP address routing lookup algorithm, which called two-layer compressed trie search algorithm. This algorithm could not only implement “one-to-one” unicast satellite routing transmission, but also support “one-to-many” multicast routing transmission. The concrete implement scheme of this algorithm was provided, with its lookup performance analyzed. The simulation results show that two-layer compressed trie search algorithm could achieve high-speed route search with average search speed of 30.5 clock cycle in unicast model and 36.7 clock cycle in multicast model, and also could economize finite onboard resources.

[1]  V. Srinivasan,et al.  Fast address lookups using controlled prefix expansion , 1999, TOCS.

[2]  George Varghese,et al.  Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.

[3]  R. Olsson,et al.  TRASH A dynamic LC-trie and hash data structure , 2007, 2007 Workshop on High Performance Switching and Routing.

[4]  Walid Dabbous,et al.  Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..

[5]  Devavrat Shah,et al.  Fast Updating Algorithms for TCAMs , 2001, IEEE Micro.

[6]  Bernhard Plattner,et al.  Scalable high speed IP routing lookups , 1997, SIGCOMM '97.

[7]  Hossein Saidi,et al.  Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet , 2009, IEEE INFOCOM 2009.

[8]  J. Cherkaoui,et al.  Onboard switching for ATM via satellite , 1997, IEEE Commun. Mag..

[9]  VargheseGeorge,et al.  Scalable high speed IP routing lookups , 1997 .