Skip to main content
SpringerLink
Log in

Efficient loop detection and congestion-free network update for SDN

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Software-defined networks provide a centralized control plane, which makes the network more flexible. When the network changes and needs to update, the controller can make the update plan and then send the flow rules to switches. Among them, efficiency and consistency are two important metrics for flow update. In the process of flow update, the unreasonable rule delivery sequence may cause black hole, loop, and congestion in the data plane. In this paper, we propose a fast update scheme to avoid these problems. Our plan is divided into three parts. First, we propose a loop detection method based on the order of nodes, and construct a loop avoidance dependency graph. This method can quickly detect potential loops in the update process without constructing directed graphs. In the second part, the path is segmented, and the node update sequence is determined according to the position of the nodes. Subsequently, the black hole avoidance dependency graph is constructed and merged with the loop avoidance dependency graph into a node dependency graph. In the third part, we improve the existing relational dependency graph by creating a state table for each flow. The combination of the two can better reflect the real path of the flow during the update process, thus better avoiding congestion. In order to reduce the update time of flow rules, we propose a binary tree based on the priority of flow rules. Our method reduces the calculation cost and update time, and further reduces the possibility of congestion. Simulation results show that our method shortens the loop detection time compared to existing solutions, and it is effective in avoiding black holes and congestions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29

Similar content being viewed by others

References

  1. Yan B, Liu Q, Shen JL et al (2021) A survey of low-latency transmission strategies in software defined networking. Computer Science Review 40:100386

    Article  Google Scholar 

  2. Marcon DS, Mazzola FM, Barcellos MP (2017) Achieving minimum bandwidth guarantees and work-conservation in large-scale, SDN-based datacenter networks. Comput Netw 127:109–125

    Article  Google Scholar 

  3. Michel O, Keller E (2017) SDN in wide-area networks: a survey. In 2017 Fourth International Conference on Software Defined Systems (SDS). IEEE, pp 37–42

  4. Caria M, Jukan A, Hoffmann M (2013) A performance study of network migration to SDN-enabled traffic engineering. In 2013 IEEE Global Communications Conference (GLOBECOM). IEEE, pp 1391–1396

  5. Li D, Dai N, Li F et al (2017) Estimating SDN traffic matrix based on online informative flow measurement method. In 2017 Fifth International Conference on Advanced Cloud and Big Data (CBD). IEEE, pp 75–80

  6. Kurimoto T, Urushidani S, Yamada H et al (2017) SINET5: a low-latency and high-bandwidth backbone network for SDN/NFV Era. In 2017 IEEE International Conference on Communications (ICC). IEEE, pp 1–7

  7. Lai CF, Hwang RH, Chao HC et al (2015) A buffer-aware HTTP live streaming approach for SDN-enabled 5G wireless networks. IEEE Netw 29(1):49–55

    Article  Google Scholar 

  8. Sharma PK, Singh S, Jeong YS et al (2017) Distblocknet: a distributed blockchains-based secure sdn architecture for iot networks. IEEE Commun Mag 55(9):78–85

    Article  Google Scholar 

  9. Adil M, Song H, Ali J et al (2021) EnhancedAODV: a robust three phase priority-based traffic load balancing scheme for Internet of Things. IEEE Internet Things J

  10. Chanak P, Banerjee I (2020) Congestion free routing mechanism for IoT-enabled wireless sensor networks for smart healthcare applications. IEEE Trans Consum Electron 66(3):223–232

    Article  Google Scholar 

  11. Naeem F, Srivastava G, Tariq M (2020) A software defined network based fuzzy normalized neural adaptive multipath congestion control for the internet of things. IEEE Trans Netw Sci Eng 7(4):2155–2164

    Article  Google Scholar 

  12. Alioua A, Senouci SM, Sedjelmaci H et al (2019) Incentive edge caching in software-defined internet of vehicles: a Stackelberg game approach. Int J Commun Syst 32(17):e3787

    Article  Google Scholar 

  13. He X, Zheng J, Dai H et al (2020) Coeus: Consistent and continuous network update in software-defined networks. In IEEE INFOCOM 2020-IEEE Conference on Computer Communications. IEEE, pp 1509–1518

  14. Benson T, Anand A, Akella A et al (2011) MicroTE: Fine grained traffic engineering for data centers. In Proceedings of the seventh conference on emerging networking experiments and technologies. pp 1–12

  15. Xu Z, Tang J, Meng J et al (2018) Experience-driven networking: a deep reinforcement learning based approach. In IEEE INFOCOM 2018-IEEE conference on computer communications. IEEE, pp 1871–1879

  16. Foerster KT, Schmid S, Vissicchio S (2018) Survey of consistent software-defined network updates. IEEE Commun Surv Tutor 21(2):1435–1461

    Article  Google Scholar 

  17. Barefoot Networks (2016) The world’s fastest and most programmable networks (white paper). https://barefootnetworks.com/white-paper/the-worlds-fastest-most-programmable-networks/

  18. Jain S, Kumar A, Mandal S et al (2013) B4: Experience with a globally-deployed software defined WAN. ACM SIGCOMM Comput Commun Rev 43(4):3–14

    Article  Google Scholar 

  19. Hong CY, Kandula S, Mahajan R et al (2013) Achieving high utilization with software-driven WAN. In Proceedings of the ACM SIGCOMM Conference on SIGCOMM. pp 15 26

  20. Jin X, Liu HH, Gandhi R et al (2014) Dynamic scheduling of network updates. ACM SIGCOMM Comput Commun Rev 44(4):539–550

    Article  Google Scholar 

  21. Maity I, Mondal A, Misra S et al (2018) CURE: Consistent update with redundancy reduction in SDN[J]. IEEE Trans Commun 66(9):3974–3981

    Article  Google Scholar 

  22. Wang W, He W, Su J et al (2016) Cupid: Congestion-free consistent data plane update in software defined networks. In IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications. IEEE, pp 1–9

  23. Wu KR, Liang JM, Lee SC et al (2018) Efficient and consistent flow update for software defined networks. IEEE J Sel Areas Commun 36(3):411–421

    Article  Google Scholar 

  24. Li P, Guo S, Pan C et al (2019) Fast congestion-free consistent flow forwarding rules update in software defined networking. Futur Gener Comput Syst 97:743–754

    Article  Google Scholar 

  25. Basta A, Blenk A, Dudycz S et al (2018) Efficient loop-free rerouting of multiple SDN flows. IEEE/ACM Trans Netw 26(2):948–961

    Article  Google Scholar 

  26. Zheng J, Li B, Tian C et al (2019) Congestion-free rerouting of multiple flows in timed sdns. IEEE J Sel Areas Commun 37(5):968–981

    Article  Google Scholar 

  27. Jiugen SHI, Xu Y, Yali LIU et al (2021) Fast and consistent flow update in software defined network. J Electron Inf Technol 43(9):2617–2623

    Google Scholar 

  28. He X, Zheng J, Dai H et al (2021) Buffer-assisted network updates in timed SDN. IEEE Trans Commun 69(10):6822–6837

    Article  Google Scholar 

  29. Wang L, Li Q, Liu Y et al (2018) Simplifying network updates in SDN and NFV networks using GUM. In 2018 27th International Conference on Computer Communication and Networks (ICCCN). IEEE, pp 1–9

  30. Liu T, Liu CH, Wang W et al (2018) USA: Faster update for SDN-based internet of things sensory environments. Comput Commun 120:80–92

    Article  Google Scholar 

  31. Sukapuram R, Barua G (2019) Ppcu: Proportional per-packet consistent updates for sdns using data plane time stamps. Comput Netw 155:72–86

    Article  Google Scholar 

  32. Wu G, Gao X, Chen T et al (2018) Shifter: a consistent multicast routing update scheme in software-defined networks. In 2018 IEEE 26th International Conference on Network Protocols (ICNP). IEEE, pp 346–355

  33. Johnson DB (1975) Finding all the elementary circuits of a directed graph. SIAM J Comput 4(1):77–84

    Article  MathSciNet  Google Scholar 

  34. Open Networking Fundation: The specification of SDN. https://opennetworking.org/wp-content/uploads/2013/04/openflow-spec-v1.3.1.pdf

  35. Global SDN Certified Testing Center. https://www.sdnctc.com/

  36. Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146–160

    Article  MathSciNet  Google Scholar 

  37. Christensen N et al (2021) Latte: Improving the latency of transiently consistent network update schedules. ACM SIGMETRICS Perform Eval Rev 48(3):14–26

Download references

Funding

This work is supported by the High Security Level Network Infrastructure Key Equipment Core Chip and Software Development under Grant 2017ZX01030301.

Author information

Authors and Affiliations

  1. Information Engineering University, Zhengzhou, 450001, China

    Dong Liang, Qinrang Liu, Binghao Yan & Ting Chen

  2. National Digital Switching System Engineering and Technological Research Center, Zhengzhou, 450002, China

    Binghao Yan & Ting Chen

  3. Zhengzhou University, Zhengzhou, 450001, China

    Xingyu Liu

Authors
  1. Dong Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qinrang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Binghao Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ting Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xingyu Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qinrang Liu.

Ethics declarations

Conflicts of interests

We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work reported in this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liang, D., Liu, Q., Yan, B. et al. Efficient loop detection and congestion-free network update for SDN. Peer-to-Peer Netw. Appl. 15, 2057–2078 (2022). https://doi.org/10.1007/s12083-022-01334-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-022-01334-3

Keywords

Search

Navigation