Routing table compaction in ternary cam

被引：65

作者：

Liu, H ^{[1
]}

机构：

[1] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA

来源：

IEEE MICRO | 2002年 / 22卷 / 01期

关键词：

D O I：

10.1109/40.988690

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

These techniques for reducing the size of routing tables stored in ternary content-addressable memory result in decreased cost, power consumption, and thermal dissipation.

引用

页码：58 / 64

页数：7

共 11 条

[1]

BRYATON RK, 1984, LOGIC MINIMIZATION A

[2]

Degermark M., 1997, Computer Communication Review, V27, P3, DOI 10.1145/263109.263133

[3]

Gupta P, 1998, IEEE INFOCOM SER, P1240, DOI 10.1109/INFCOM.1998.662938

[4]

HAYASHI T, 1999, P GLOB, V2, P1576

[5]

KOBAYASHI M, 2000, P IEEE INT C COMM JU

[6] Internet routing instability [J].

Labovitz, C ;

Malan, GR ;

Jahanian, F .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1998, 6 (05) :515-528

[7]

MCAULEY AJ, 1993, IEEE INFOCOM SER, P1382, DOI 10.1109/INFCOM.1993.253403

[8] IP-address lookup using LC-tries [J].

Nilsson, S ;

Karlsson, G .

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1999, 17 (06) :1083-1092

[9]

PEI TB, 1991, IEEE INFOCOM SER, P515, DOI 10.1109/INFCOM.1991.147548

[10] Fast address lookups using controlled prefix expansion [J].

Srinivasan, V ;

Varghese, G .

ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1999, 17 (01) :1-40

← 1 2 →