Journal on Communications ›› 2022, Vol. 43 ›› Issue (5): 24-35.doi: 10.11959/j.issn.1000-436x.2022088

• Papers • Previous Articles     Next Articles

Fast loop-free path migration strategy in software defined network

Binghao YAN1, Qinrang LIU1,2, Jianliang SHEN1, Xiantuo TANG1, Dong LIANG1   

  1. 1 Institute of Information Technology, Information Engineering University, Zhengzhou 450001, China
    2 National Digital Switching System Engineering &Technological R&D Center, Zhengzhou 450001, China
  • Revised:2022-03-17 Online:2022-05-25 Published:2022-05-01
  • Supported by:
    The National Science and Technology Major Project of China(2017ZX01030301);Industrial Internet Innovation Development Foundation Project(TC190A446-2)

Abstract:

Aiming at the problems of slow and faulty path migration caused by distributed deployment and asynchronous operation of data plane forwarding devices in software defined network, a fast loop-free path migration strategy was proposed.First, a fast loop detection algorithm based on node ranking was proposed.By comparing the position differences of adjacent nodes on the old and new paths of the flow, whether there was a forwarding loop in the path migration process and the location detection where the loop occurs could be quickly determined.Then, a greedy update mechanism based on node relaxation dependency was proposed.The fast loop detection algorithm was used to uncover the relaxation dependency between the common switches on the old and new paths, and the number of switches updated in each round of the migration process was ensured to be maximized.Simulation results show that the proposed strategy can effectively avoid migration loops and obtain the optimal update time overhead under different network states compared with existing migration schemes.

Key words: software defined network, path migration, loop avoidance, relaxation dependency, greedy mechanism

CLC Number: 

No Suggested Reading articles found!