CaltechAUTHORS
  A Caltech Library Service

SFP: Toward Interdomain Routing for SDN Networks

Xiang, Qiao and Guok, Chin and Le, Franck and MacAuley, John and Newman, Harvey and Yang, Y. Richard (2018) SFP: Toward Interdomain Routing for SDN Networks. In: SIGCOMM '18 Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos. ACM , New York, NY, pp. 87-89. ISBN 9781450359153. http://resolver.caltech.edu/CaltechAUTHORS:20180813-091037049

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20180813-091037049

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 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 interdomain 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.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1145/3234200.3234207DOIArticle
ORCID:
AuthorORCID
Newman, Harvey0000-0003-0964-1480
Additional Information:© 2018 ACM. The authors thank Jingxuan Zhang, Xin Wang and Yang Liu (Tongji University) for their help during the preparation of the paper. This research is supported in part by NSFC grants #61672385, #61472213 and #61702373; China Postdoctoral Science Foundation #2017-M611618; NSF grant CC-IIE #1440745; NSF award #1246133, ANSE; NSF award #1341024, CHOPIN; NSF award #1120138, US CMS Tier2; NSF award #1659403, SANDIE; DOE award #DE-AC02-07CH11359, SENSE; DOE/ASCR project #000219898; Google Research Award, and the U.S. Army Research Laboratory and the U.K. Ministry of Defence under Agreement Number W911NF-16-3-0001.
Funders:
Funding AgencyGrant Number
National Natural Science Foundation of China61672385
National Natural Science Foundation of China61472213
National Natural Science Foundation of China61702373
China Postdoctoral Science Foundation2017-M611618
NSFOAC-1440745
NSFOAC-1246133
NSFOAC-1341024
NSFPHY-1120138
NSFOAC-1659403
Department of Energy (DOE)DE-AC02-07CH11359
Department of Energy (DOE)000219898
Google ResearchUNSPECIFIED
Army Research LaboratoryW911NF-16-3-0001
Ministry of Defence (UK)UNSPECIFIED
Subject Keywords:Interdomain Routing, SDN, On-Demand Information Dissemination
Record Number:CaltechAUTHORS:20180813-091037049
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20180813-091037049
Official Citation:Qiao Xiang, Chin Guok, Franck Le, John MacAuley, Harvey Newman, and Y. Richard Yang. 2018. SFP: Toward Interdomain Routing for SDN Networks. In Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos (SIGCOMM '18). ACM, New York, NY, USA, 87-89. DOI: https://doi.org/10.1145/3234200.3234207
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:88778
Collection:CaltechAUTHORS
Deposited By: George Porter
Deposited On:13 Aug 2018 21:11
Last Modified:05 Apr 2019 22:11

Repository Staff Only: item control page