Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Prelude: Ensuring inter-domain loop-freedom in SDN-enabled networks
KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.ORCID iD: 0000-0002-9675-9729
2018 (English)In: ACM International Conference Proceeding Series, Association for Computing Machinery , 2018, p. 50-56Conference paper, Published paper (Refereed)
Abstract [en]

Software-Defined eXchanges (SDXes) promise to improve the interdomain routing ecosystem through SDN deployment. Yet, the nave deployment of SDN on the Internet raises concerns about the correctness of the interdomain data-plane. By allowing operators to deflect traffic from default BGP routes, SDN policies can create permanent forwarding loops that are not visible to the control-plane. We propose Prelude, a system for detecting SDN-induced forwarding loops between SDXes with high accuracy without leaking private routing information of network operators. To achieve this, we leverage Secure Multi-Party Computation (SMPC) techniques to build a novel and general privacy-preserving primitive that detects whether any subset of SDN rules might affect the same portion of traffic without learning anything about those rules. We then leverage this primitive as the main building block of a distributed system tailored to detect forwarding loops among any set of SDXes. We leverage the particular nature of SDXes to further improve the efficiency of our SMPC solution. The number of valid SDN rules rejected by our solution is 100x lower than previous privacy-preserving solutions, and provides better privacy guarantees. Furthermore, our solution naturally provides network operators with some insights on the cost of the deflected paths.

Place, publisher, year, edition, pages
Association for Computing Machinery , 2018. p. 50-56
Keywords [en]
Computer applications, Computer programming, Building blockes, Distributed systems, Interdomain Routing, Network operator, Privacy preserving, Privacy preserving solutions, Routing information, Secure multi-party computation, Data privacy
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-252262DOI: 10.1145/3232565.3232570Scopus ID: 2-s2.0-85063091124ISBN: 9781450363952 (print)OAI: oai:DiVA.org:kth-252262DiVA, id: diva2:1324890
Conference
2nd Asia-Pacific Workshop on Networking, APNet 2018, 2 August 2018 through 3 August 2018
Note

QC20190614

Available from: 2019-06-14 Created: 2019-06-14 Last updated: 2019-06-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopushttps://conferences.sigcomm.org/events/apnet2018/

Authority records BETA

Chiesa, Marco

Search in DiVA

By author/editor
Chiesa, Marco
By organisation
Communication Systems, CoS
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 36 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf