DocumentCode
2972152
Title
Modified LC-trie based efficient routing lookup
Author
Ravikumar, V.C. ; Mahapatra, Rabi ; Liu, J.C.
Author_Institution
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
fYear
2002
fDate
2002
Firstpage
177
Lastpage
182
Abstract
IP address lookup at the router is a complex problem. This has been primarily due to the increasing table sizes, growth in traffic rate and high link capacities. We propose an algorithm for fast routing lookup with reduced memory utilization and access time. This approach shows significant performance improvement in the average case and optimizes the overall time taken for packet routing. Since storage requirement, processing time and number of lookups performed are reduced, power consumption by the router is also reduced. Our simulation result indicates that the proposed technique works approximately 4.11 times better than the standard level compressed trie (LC-trie) approach (see Nilsson, S. and Karlsson, G., Proc. IEEE Broadband Commun. 98, p.9-18, 1998) in the average case.
Keywords
Internet; power consumption; table lookup; telecommunication network routing; tree data structures; trees (mathematics); IP address lookup; Internet; level compressed trie; packet routing; power consumption; processing time; routing lookup; storage requirement; Computer science; Costs; Energy consumption; Hardware; Internet; Moore´s Law; Packet switching; Routing protocols; Spine; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 2002. MASCOTS 2002. Proceedings. 10th IEEE International Symposium on
ISSN
1526-7539
Print_ISBN
0-7695-1840-0
Type
conf
DOI
10.1109/MASCOT.2002.1167075
Filename
1167075
Link To Document