Modified LC-Trie Based Efficient Routing Lookup

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Ravikumar V. C Articles by R. Mahapatra Articles by J. C. Liu

10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02)

Fort Worth, Texas

October 11-October 16

ISBN: 0-7695-1840-0

	ASCII Text	x
	Ravikumar V. C, R. Mahapatra, J. C. Liu, "Modified LC-Trie Based Efficient Routing Lookup," Modeling, Analysis, and Simulation of Computer Systems, International Symposium on, pp. 0177, 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02), 2002.

	BibTex	x
	@article{ 10.1109/MASCOT.2002.1167075, author = {Ravikumar V. C and R. Mahapatra and J. C. Liu}, title = {Modified LC-Trie Based Efficient Routing Lookup}, journal ={Modeling, Analysis, and Simulation of Computer Systems, International Symposium on}, volume = {0}, year = {2002}, isbn = {0-7695-1840-0}, pages = {0177}, doi = {http://doi.ieeecomputersociety.org/10.1109/MASCOT.2002.1167075}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on TI - Modified LC-Trie Based Efficient Routing Lookup SN - 0-7695-1840-0 SP EP A1 - Ravikumar V. C, A1 - R. Mahapatra, A1 - J. C. Liu, PY - 2002 VL - 0 JA - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on ER -

Ravikumar V. C

R. Mahapatra

J. C. Liu

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MASCOT.2002.1167075

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. In this work we have proposed 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 LC Trie approach in the average case.

Citation:

Ravikumar V. C, R. Mahapatra, J. C. Liu, "Modified LC-Trie Based Efficient Routing Lookup," mascots, pp.0177, 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02), 2002

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.