Modified LC-Trie based efficient routing lookup

被引：8

作者：

Ravikumar, VC ^{[1
]}

Mahapatra, R ^{[1
]}

Liu, JC ^{[1
]}

机构：

[1] Texas A&M Univ, Dept Comp Sci, College Stn, TX 77843 USA

来源：

MASCOTS 2002: 10TH IEEE INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATIONS SYSTEMS, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/MASCOT.2002.1167075

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：177 / 182

页数：6

共 11 条

[1] High-performance IP routing table lookup using CPU caching
Chiueh, TC
Pradhan, P
[J]. IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, : 1421 - 1428
[2] CHIUEH TC, 2000, INT C DISTR COMP SYS, P136
[3] CHIUEH TC, 2000, HPCA, P409
[4] TRIE MEMORY
FREDKIN, E
[J]. COMMUNICATIONS OF THE ACM, 1960, 3 (09) : 490 - 499
[5] Gupta P., 2000, THESIS STANFORD U
[6] IP switching and gigabit routers
Newman, P
Minshall, G
Lyon, T
Huston, L
[J]. IEEE COMMUNICATIONS MAGAZINE, 1997, 35 (01) : 64 - 69
[7] NILSSON S, 1998, P IEEE BROADB COMM 9, P9
[8] SRINIVASAN V, 1998, FASTER IP LOOKUPS US, P1
[9] PATRICIA TRIES AGAIN REVISITED
SZPANKOWSKI, W
[J]. JOURNAL OF THE ACM, 1990, 37 (04) : 691 - 711
[10] *U MI MER NETW, INT PERF MEAS AN PRO

← 1 2 →