Fast loop-free path migration strategy in software defined network
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 pr...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2022-05-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022088/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539998476664832 |
|---|---|
| author | Binghao YAN Qinrang LIU Jianliang SHEN Xiantuo TANG Dong LIANG |
| author_facet | Binghao YAN Qinrang LIU Jianliang SHEN Xiantuo TANG Dong LIANG |
| author_sort | Binghao YAN |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-dbee663e60154e74bb39ac8545b3f0df |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2022-05-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-dbee663e60154e74bb39ac8545b3f0df2025-01-14T06:29:48ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2022-05-0143243559395358Fast loop-free path migration strategy in software defined networkBinghao YANQinrang LIUJianliang SHENXiantuo TANGDong LIANGAiming 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.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022088/software defined networkpath migrationloop avoidancerelaxation dependencygreedy mechanism |
| spellingShingle | Binghao YAN Qinrang LIU Jianliang SHEN Xiantuo TANG Dong LIANG Fast loop-free path migration strategy in software defined network Tongxin xuebao software defined network path migration loop avoidance relaxation dependency greedy mechanism |
| title | Fast loop-free path migration strategy in software defined network |
| title_full | Fast loop-free path migration strategy in software defined network |
| title_fullStr | Fast loop-free path migration strategy in software defined network |
| title_full_unstemmed | Fast loop-free path migration strategy in software defined network |
| title_short | Fast loop-free path migration strategy in software defined network |
| title_sort | fast loop free path migration strategy in software defined network |
| topic | software defined network path migration loop avoidance relaxation dependency greedy mechanism |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022088/ |
| work_keys_str_mv | AT binghaoyan fastloopfreepathmigrationstrategyinsoftwaredefinednetwork AT qinrangliu fastloopfreepathmigrationstrategyinsoftwaredefinednetwork AT jianliangshen fastloopfreepathmigrationstrategyinsoftwaredefinednetwork AT xiantuotang fastloopfreepathmigrationstrategyinsoftwaredefinednetwork AT dongliang fastloopfreepathmigrationstrategyinsoftwaredefinednetwork |