论文信息 - Constructing optimal IP routing tables

Constructing optimal IP routing tables

The Border Gateway Protocol (BGP) populates Internet backbone routers with routes or prefixes. We present an algorithm to locally compute (without any modification to BGP) equivalent forwarding tables that provably contain the minimal number of prefixes. For large backbone routers, the Optimal Routing Table Constructor (ORTC) algorithm that we present produces routing tables with roughly 60% of the original number of prefixes. The publicly available MaeEast database with 41315 prefixes reduces to 23007 prefixes when ORTC is applied. We present performance measurements on four publicly available databases and a formal proof that ORTC does produce the optimal set of routes.

[1] Gunnar Karlsson,et al. Fast address look-up for internet routers , 1998, Broadband Communications.

[2] B. Leiner,et al. The DARPA internet protocol suite , 1985, IEEE Communications Magazine.

[3] Vince Fuller,et al. Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy , 1993, RFC.

[4] Marcel Waldvogel,et al. Routing Table Compression Using Binary Tree Collapse , 1998 .

[5] Vince Fuller,et al. Supernetting: an Address Assignment and Aggregation Strategy , 1992, RFC.

[6] George Varghese,et al. Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.

[7] Yakov Rekhter,et al. An Architecture for IP Address Allocation with CIDR , 1993, RFC.

[8] Svante Carlsson,et al. Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.

[9] Jon Postel,et al. Internet Standard Subnetting Procedure , 1985, RFC.

[10] Jon Postel,et al. Internet Protocol , 1981, RFC.

[11] Bernhard Plattner,et al. Scalable high speed IP routing lookups , 1997, SIGCOMM '97.

[12] Farouk Kamoun,et al. Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[13] Yakov Rekhter,et al. A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.