Internet routing protocols evolved in an ad hoc manner as the Internet grew in importance and dimension. They are divided into Exterior Gateway Protocols (EGP), of which there is only BGP, and Interior Gateway Protocols, which abound. BGP is flexible, allowing for the realization of complex routing policies that reflect the commercial relationships Internet domains establish between themselves. However, these routing policies may conflict leading to BGP instability. In addition, BGP has slow convergence properties, even when the routing policies lead to convergence. IGPs, on the other hand, lack flexibility, as witnessed by BGP being pressed into operation as an IGP.
In this work, we develop a broad and unifying theory of dynamic network routing. The goals of this theory are (i) to develop a framework for the design and specification of routing policies, independently of the underlying routing protocol; (ii) to derive general results (theorems) on the convergence properties of routing policies and see them applied on specific routing protocols; (iii) to extract a meta-language for routing with automatic validation of convergence properties. The theory is based on non-classical algebraic concepts.
|Start Date: 01-01-2005|
|End Date: 31-12-2006|
|Team: Joao Luis Costa Campos Goncalves Sobrinho|
|Groups: Network Architectures and Protocols – Lx|
|Local Coordinator: Joao Luis Costa Campos Goncalves Sobrinho|
|Links: Internal Page|