Computer Science ›› 2022, Vol. 49 ›› Issue (2): 329-335.doi: 10.11896/jsjkx.210100051

• Computer Network • Previous Articles     Next Articles

Single Node Failure Routing Protection Algorithm Based on Hybrid Software Defined Networks

GENG Hai-jun1,2, WANG Wei1, YIN Xia3   

  1. 1 School of Computer and Information Technology,Shanxi University,Taiyuan 030006,China
    2 School of Automation and Software Engineering,Shanxi University,Taiyuan 030006,China
    3 Department of Computer Science & Technology,Tsinghua University,Beijing 100084,China
  • Received:2021-01-06 Revised:2021-05-07 Online:2022-02-15 Published:2022-02-23
  • About author:GENG Hai-jun,born in 1983,Ph.D,lecturer,is a member of China Computer Federation. His main research interests include future Internet architecture and routing algorithm.
  • Supported by:
    Applied Basic Research Plan of Shanxi Province(20210302123444),National Natural Science Foundation of China(61702315),Key R & D Program of Shanxi Province China(201903D421003) and National High Technology Research and Development Program of China(863)(2018YFB1800401).

Abstract: Software defined network (SDN) is a new network architecture proposed by the clean slate research group of Stanford University.The significant feature of this architecture is to decouple the functions of control plane and forwarding plane,and to flexibly forward the network traffic.Based on this,Internet service providers have deployed SDN technology in their backbone network to maximize the utilization of network resources.However,due to the limitation of economic cost and technical conditions,the backbone network of internet service providers must be in the hybrid SDN network for a long time.The studies have shown that single network node failure is inevitable and occurs frequently.Therefore,it is a key scientific problem to study the routing protection me-thod for single network component failure in hybrid SDN networks.In this paper,the route protection method for single network component failure in hybrid SDN network is described,and then two heuristic methods are used to solve the problem.Finally,the proposed heuristic algorithms are tested in real and simulated topologies.The experimental results show that in the traditional backbone network,only a part of the traditional devices need to be upgraded to SDN devices,and the algorithms proposed in this paper can deal with all possible single network node failure cases in the network.

Key words: Heuristic algorithm, Hybrid software defined network, Real-time application, Routing protection algorithm, Single node failure

CLC Number: 

  • TP311
[1]GENG H J,ZHANG H,SHI X G,et al.Efficient computation of loop-free alternates[J].Journal of Network and Computer Applications,2020,151(5):1-12.
[2]KUN Q,JIN Z,XIN W,et al.Efficient Recovery Path Computa-tion for Fast Reroute in Large-scale Software Defined Networks[J].IEEE Journal on Selected Areas in Communications,2019,37(8):1755-1768.
[3]GENG H J,SHI X G,WANG Z L.Intra-domain Routing Protection Scheme Based on Minimum Intersection Paths[J].Journal of Software,2020,31(5):1536-1548.
[4]DONG S.Survey on Software Defined Networks Security[J].Computer Science,2021,48(3):295-306.
[5]ZHANG J,WANG H,LUO S T,et al.Hybrid Software Defined Network Energy Efficient Routing Algorithm Based on Genetic Algorithm[J].Computer Science,2020,47(6):236-241.
[6]YANG Y,XU M,LI Q.Fast Rerouting Against Multi-LinkFailures Without Topology Constraint[J].IEEE/ACM Tran-sactions on Networking,2018,26(1):384-397.
[7]GENG H,SHI X,WANG Z,et al.A hop-by-hop dynamic distributed multipath routing mechanism for link state network[J].Computer Communications,2018,116:225-239.
[8]KWONG K W,GAO L,ZHANG Z L.On the feasibility and efficacy of protection routing in IP networks[J].IEEE/ACM Transactions on Networking,2011,19(5):1543-1556.
[9]ATLAS A,ZININ A.RFC 5286,Basic specification for ip fast reroute:Loop-free alternates[S].IETF,2008.
[10]ENYEDI G,RÉTVÑRI G,SZILÑGYI P,et al.IP Fast Re-Route:Lightweight Not-Via without Additional Addresses[C]//International Conference on Computer Communications (INFOCOM).IEEE Computer Society,2009:2771-2775.
[11]ZHENG J,XU H,ZHU X,et al.We've Got You Covered:Fai-lure Recovery with Backup Tunnels in Traffic Engineering[C]//International Conference on Network Protocols (ICNP).IEEE Computer Society,2016:1-10.
[12]RÉTVÑRI G,CSIKOR L,TAPOLCAI J,et al.Optimizing IGP link costs for improving IP-level resilience[C]//International Conference on the Design of Reliable Communication Networks (DRCN).IEEE Computer Society,2011:62-69.
[13]RÉTVÑRI G,TAPOLCAI J,ENYEDI G,et al.Ip fast reroute:Loop free alternates revisited[C]//International Conference on Computer Communications (INFOCOM).IEEE Computer So-ciety,2011:2948-2956.
[14]BRAUN W,MENTH M.Loop-Free Alternates with Loop Detection for Fast Reroute in Software-Defined Carrier and Data Center Networks[J].Journal of Network and Systems Management,2016,24(3):470-490.
[15]HE L,LIN R,YU S,et al.Congestion-Aware Local Reroute for Fast Failure Recovery in Software-Defined Networks[J].IEEE/OSA Journal of Optical Communications & Networking,2017,9(11):934-944.
[16]ZHANG X,CHENG Z,LIN R P,et al.Local Fast Reroute With Flow Aggregation in Software Defined Networks[J].IEEE Communications Letters,2017,21(4):785-788.
[17]ZHU Z,LI Q,XIA S,et al.CAFFE:Congestion-Aware FastFailure Recovery in Software Defined Networks[C]//International Conference on Computer Communication and Networks (ICCCN).IEEE Computer Society,2018:1-9.
[18]ZHENG J,XU H,ZHU X,et al.Sentinel:Failure Recovery in Centralized Traffic Engineering[J].IEEE/ACM Transactions on Networking,2019,27(5):1859-1872.
[19]GENG H J,ZHANG W,YIN X.Routing Protection Algorithm Based on Hybrid Software Defined Network[J].Computer Engineering,2020,46(6):209-215.
[20]GENG H J,SHI X G,WANG Z L,et al.Intra-domain Routing Protection Scheme Based on Minimum Intersection Paths[J].Journal of Software,2020,31(5):1536-1548.
[21]YANG Z,YEUNG K L.SDN Candidate Selection in HybridIP/SDN Networks for Single Link Failure Protection[J].IEEE/ACM Transactions on Networking,2020,28(1):312-321.
[22]NETWORK A B.Advanced networking for research and education[OL].http://abilene.internet2.edu,2003.
[23]ANTONAKOPOULOS S,BEJERANO Y,KOPPOL P.FullProtection Made Easy:The DisPath IP Fast Reroute Scheme[J].IEEE/ACM Transactions on Networking,2015,23(4):1229-1242.
[24]SPRING N,MAHAJAN R,WETHERALL D,et al.Measuring isp topologies with rocketfuel[J].IEEE/ACM Transactions on Networking,2004,12(1):2-16.
[1] LIU Zhong-hui, ZHAO Qi, ZOU Lu, MIN Fan. Heuristic Construction of Triadic Concept and Its Application in Social Recommendation [J]. Computer Science, 2021, 48(6): 234-240.
[2] GUO Qi-cheng, DU Xiao-yu, ZHANG Yan-yu, ZHOU Yi. Three-dimensional Path Planning of UAV Based on Improved Whale Optimization Algorithm [J]. Computer Science, 2021, 48(12): 304-311.
[3] GUO Fei-yan, TANG Bing. Mobile Edge Server Placement Method Based on User Latency-aware [J]. Computer Science, 2021, 48(1): 103-110.
[4] ZHANG Ju, WANG Hao, LUO Shu-ting, GENG Hai-jun, YIN Xia. Hybrid Software Defined Network Energy Efficient Routing Algorithm Based on Genetic Algorithm [J]. Computer Science, 2020, 47(6): 236-241.
[5] ZHANG Xu, WANG Li-li, YANG Bo-tao. Heuristic Algorithms for Two-dimensional Irregular Bin Packing Problem with GuillotineConstraints [J]. Computer Science, 2020, 47(5): 212-216.
[6] YANG Ting, LUO Fei, DING Wei-chao, LU Hai-feng. Bin Packing Algorithm Based on Adaptive Optimization of Slack [J]. Computer Science, 2020, 47(4): 211-216.
[7] LUO Fei, REN Qiang, DING Wei-chao, LU Hai-feng. Heuristic One-dimensional Bin Packing Algorithm Based on Minimum Slack [J]. Computer Science, 2019, 46(9): 315-320.
[8] GENG Hai-jun, YIN Xia. Efficient Intra-domain Routing Protection Algorithm Based on i-SPF [J]. Computer Science, 2019, 46(8): 116-120.
[9] ZHANG Shu-yu, DONG Da, XIE Bing, LIU Kai-gui. Bus Short-term Dynamic Dispatch Algorithm Based on Real-time GPS [J]. Computer Science, 2019, 46(6A): 497-501.
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading [J]. Computer Science, 2018, 45(4): 94-99.
[11] SHAN Tian-yu, GUAN Yu-yang. Differential Evolution Algorithm with Adaptive Population Size Reduction Based on Population Diversity [J]. Computer Science, 2018, 45(11A): 160-166.
[12] LI Mei-zheng, LI Lei-jun, MI Ju-sheng and XIE Bin. Rough Entropy Based Algorithm for Attribute Reduction in Concept Lattice [J]. Computer Science, 2018, 45(1): 84-89.
[13] YIN Xiao-bo and LUO En. Relaxed Optimal Balanced Streaming Graph Partitioning Algorithm [J]. Computer Science, 2016, 43(4): 231-234.
[14] CHEN Xiao-pan, KONG Yun-feng, ZHENG Tai-hao and ZHENG Shan-shan. Metaheuristic Algorithm for Split Demand School Bus Routing Problem [J]. Computer Science, 2016, 43(10): 234-241.
[15] YANG Guang and ZENG Bin. Research on Reliability-aware Relay Strategy in Data Link [J]. Computer Science, 2015, 42(Z11): 253-257.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!