Loop-Free Rerouting of Multiple Policies With Overlaps

被引：0

作者：

Yu, Jinping ^{[1
,2
]}

Bi, Jingping ^{[1
,2
]}

Zhang, Guoqiang ^{[3
]}

Fan, Xinxin ^{[1
]}

Li, Zhongcheng ^{[1
,2
]}

机构：

[1] Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China

[2] Univ Chinese Acad Sci, Beijing 100049, Peoples R China

[3] Nanjing Normal Univ, Sch Comp Sci & Technol, Nanjing 210097, Jiangsu, Peoples R China

来源：

IEEE COMMUNICATIONS LETTERS | 2018年 / 22卷 / 07期

关键词：

SDN; loop freedom; match field overlaps;

D O I：

10.1109/LCOMM.2018.2829484

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Loop freedom is a fundamental consistency property to ensure that no packets will fall into forwarding loops during network updates. Prior work focuses on tackling the problem of single policy update. However, though some work states that rerouting of policies with overlaps is NP-hard, none of them gave a feasible solution for it. In this paper, we investigate the inherent characteristics of multiple policy cycles (MPCs), and propose general principles to eliminate MPCs. An algorithm named CBreaker is proposed to find the optimal number of rounds to schedule the loop-free update problem. Both theoretical analysis and experimental evaluation demonstrate the feasibility and efficiency of our proposed solution.

引用

页码：1370 / 1373

页数：4