SFP: Toward Interdomain Routing for SDN Networks

Abstract Inter-domain 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 first 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 first fine-grained inter-domain routing protocol that extends BGP with fine-grained routing, eliminating the aforementioned mismatch. We develop two novel techniques, automatic receiver filtering and on-demand information dissemination, to address the scalability issue brought by fine-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 traffic affected 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 fine-grained routing.
  • Qiao Xiang (Yale)
  • Chin Guok
  • Franck Le (IBM US)
  • John MacAuley
  • Harvey Newman
Date Aug-2018
Venue SIGCOMM18 Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos Pages 87-89