Dynamical Fast IP-Routing Lookup Algorithm

2002, Volume 4, Issue 7

Abstract

Keywords

Figures

References

Related Research

Strategic Study of CAE >> 2002, Volume 4, Issue 7

Dynamical Fast IP-Routing Lookup Algorithm

China Academy of Telecommunication Technology, Ministry of Information Industry, Beijing 100083, China

Received: 2001-10-11 Revised: 2002-01-15 Available online: 2002-07-20

HTML78 PDF 6 Collect 0

Next Previous

Abstract

This paper proposes a dynamical fast IP-routing lookup algorithm (DFR). This algorithm uses special data structure to construct index table, and can support inserting, deleting and updating route dynamically. DFR algorithm accesses memory at most four times and at least two times for a route look up. DFR is suitable not only for hardware implementation but also for software implementation.

Keywords

prefix expansion ; dynamical fast IP-routing lookup algorithm (DFR) ; route ; route lookup

Figures

图1

图2

图3

图4

图5

图6

图7

图8

图9

References

[ 1 ] NilssonS , KarlssonG .IP addresslookupusingLC Tries[J].IEEEJournalonSelectedAreasinCommunications, 1999, 17 (6) :1083～1092

[ 2 ] HenryHongyi, Tzeng.Onfastaddress lookupalgorithms[J].IEEEJournalonSelectedAreasinCommunications, 1999, 17 (6) :1067～1082

[ 3 ] HuangNenfu, ZhaoShiming.AnovelIP routinglookupschemeandhardwarearchitectureformultigigabitswitchingrouters[J].IEEEJournalonSeletedAreasinCommunications, 1999, 17 (6) :1093～1104

[ 4 ] GuptaP , LinS , McKeownM .Routinglookupsinhardwareatmemoryaccessspeeds[A ].ProcIEEEINFOCOM’98[C], Session10B 1, SanFrancisco, CA , 1998.1240～1247

Related Research