SDN-Based Privacy Preserving Cross Domain Routing
SDN-Based Privacy Preserving Cross Domain Routing
复制标题
DOI：
10.1109/tdsc.2018.2811807
复制
发表时间：
2019-11
影响因子：
7.3
通讯作者：
Qingjun Chen;Shouqian Shi;Xin Li;Chen Qian;Sheng Zhong
中科院分区：
文献类型：
--
作者：
Qingjun Chen;Shouqian Shi;Xin Li;Chen Qian;Sheng Zhong
当今的大规模企业网络、数据中心网络和广域网可以分解为多个管理或地理域。域名可能由不同的行政单位或组织拥有。因此，保护域信息是一个重要的问题。现有的通用安全多方计算（SMPC）方法，保护域的隐私是非常缓慢的跨域路由问题。在本文中，我们提出了PYCRO，一个专门设计用于软件定义网络（SDN）环境中的隐私保护跨域路由优化的加密协议。PYCRO提供了两个基本的路由功能，策略兼容的最短路径计算和带宽分配，同时确保对域的私有信息的强大保护。我们严格证明我们协议的隐私保证。为了提高时间效率，我们设计了快速路径（QIP）技术。QIP只需要一次离线预处理和非常快速的在线计算。我们已经实现了一个原型系统，在校园网的服务器上运行PYCRO和QIP。使用真实的ISP网络拓扑结构的实验结果表明，PYCRO和QIP是非常有效的计算和通信成本。
Today's large-scale enterprise networks, data center networks, and wide area networks can be decomposed into multiple administrative or geographical domains. Domains may be owned by different administrative units or organizations. Hence protecting domain information is an important concern. Existing general-purpose Secure Multi-Party Computation (SMPC) methods that preserves privacy for domains are extremely slow for cross-domain routing problems. In this paper we present PYCRO, a cryptographic protocol specifically designed for privacy-preserving cross-domain routing optimization in Software Defined Networking (SDN) environments. PYCRO provides two fundamental routing functions, policy-compliant shortest path computing and bandwidth allocation, while ensuring strong protection for the private information of domains. We rigorously prove the privacy guarantee of our protocol. To improve time efficiency we design the QuIck Pathing (QIP) technique. QIP only requires one-time offline preprocessing and very fast online computation. We have implemented a prototype system that runs PYCRO and QIP on servers in a campus network. Experimental results using real ISP network topologies show that PYCRO and QIP are very efficient in computation and communication costs.