Title :
Constructing optimal IP routing tables
Author :
Draves, Richard P. ; King, Christopher ; Venkatachary, Srinivasan ; Zill, Brian D.
Author_Institution :
Microsoft Corp., Redmond, WA, USA
Abstract :
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
Keywords :
Internet; optimisation; performance evaluation; telecommunication network routing; transport protocols; Border Gateway Protocol; Internet backbone routers; MaeEast database; ORTC; ORTC algorithm; Optimal Routing Table Constructor; algorithm; formal proof; optimal IP routing tables; performance measurements; publicly available databases; Bones; Cache memory; Databases; Distributed algorithms; Hardware; Internet; Mathematics; Measurement; Routing protocols; Spine;
Conference_Titel :
INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Conference_Location :
New York, NY
Print_ISBN :
0-7803-5417-6
DOI :
10.1109/INFCOM.1999.749256
