IP lookup in software for large routing tables using DMP-tree data structure

被引：0
作者：
Yazdani, N [1 ]
Mohammadi, H [1 ]
机构：
[1] Univ Tehran, ECE Dept, Router Lab, Tehran 14174, Iran
来源：
APCC 2003: 9TH ASIA-PACIFIC CONFERENCE ON COMMUNICATION, VOLS 1-3, PROCEEDINGS | 2003年
关键词：
IP lookup; DMP-tree; longest prefix matching;
D O I：
10.1109/APCC.2003.1274285
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Making IP Lookup fast and scalable is crucial in the Internet routers due. to the fast increase in line speeds and routing table sizes. In this paper, we use DMP-Tree (Dynamic M-Way Prefix Tree) data structure to perform IP lookup in software. Experimental results show that our method is fast enough to support multi gigabit per second lines and it scales very well to routing tables with millions of entries. The proposed solution scales well to IPv6 with a reasonable overhead.
引用
收藏
页码：1172 / 1175
页数：4
相关论文
共 15 条
  • [1] CHEN WE, P IEEE ICON99
  • [2] Cormen T. H., 2001, Introduction to Algorithms, V2nd
  • [3] DEGERMARK M, P ACM SIGCOM 97 C CA, P3
  • [4] Routing on longest-matching prefixes
    Doeringer, W
    Karjoth, G
    Nassehi, M
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1996, 4 (01) : 86 - 97
  • [5] HUANG NF, 1999, P INFOCOM 99 MARCH
  • [6] LAMPSON B, P IEEE INF 98
  • [7] MCAULEY A, P IEEE INF 93 C, V3, P1382
  • [8] MCKEOWN N, P IEEE INF 98 C, P1240
  • [9] MOHAMMADI H, IN PRESS ICON2003 SY
  • [10] IP-address lookup using LC-tries
    Nilsson, S
    Karlsson, G
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1999, 17 (06) : 1083 - 1092
12