We address two issues in this dissertation. Firstly, the lack of visibility and independent implementing of policies in inter-domain routing can result in policy disputes causing routing to oscillate forever. We propose the Precedence Solution that enforces shortest path routing only when oscillations resulting from disputes arise. In scenarios where no such disputes exist, all routers are able to select their most preferred paths. This solution provides just enough visibility to obtain the location of routers having policy conflicts thus easing troubleshooting, without revealing additional provider policies. We prove that the Precedence Solution is able to stabilize the network, then show how it can be implemented in practice.
Secondly, the high level of access control possible in intra-domain networks has resulted in the proliferation of semantically rich policies, which are realized in the form of packet filters and physical topology manipulations. The multitude of knobs to tune in order to achieve the desired performance increases the configuration complexity of these networks. We show that using the notion of classes embedded within routing, reachability information can be automatically propagated and updated by the routing protocol, hence easing configuration.