SFP: Toward interdomain routing for SDN networks

Abstract

Interdomain routing using BGP is widely deployed and well understood. The deployment of SDN in BGP domain networks, however, has not been systematically studied. In this paper, we? rst show that the use-announcement inconsistency is a fundamental mismatch in such a deployment, leading to serious issues including unnecessary blackholes, unnecessary reduced reachability, and permanent forwarding loops.We then design SFP, the? rst? ne-grained interdomain routing protocol that extends BGP with? ne-grained routing, eliminating the aforementioned mismatch. We develop two novel techniques, automatic receiver? ltering and ondemand information dissemination, to address the scalability issue brought by? ne-grained routing. Evaluating SFP using real network topologies and traces for intended settings, which are not global Internet but tens of collaborative domains, we show that SFP can reduce the amount of tra?c a?ected by blackholes and loops by more than 50%, and that our proposed techniques can reduce the amount of signaling between ASes by 3 orders of magnitude compared with naive ?ne-grained routing.