作者
Richard P Draves, Christopher King, Srinivasan Venkatachary, Brian D Zill
发表日期
1999/3/21
研讨会论文
IEEE INFOCOM'99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No. 99CH36320)
卷号
1
页码范围
88-97
出版商
IEEE
简介
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.
引用总数
学术搜索中的文章
RP Draves, C King, S Venkatachary, BD Zill - IEEE INFOCOM'99. Conference on Computer …, 1999