Skip to main content
Top

2018 | OriginalPaper | Chapter

A Novel Path Selection Algorithm Based on Graph-Cut to Ensure Security in SDN

Authors : Shuquan Fan, Rongheng Lin, Shiqi Zhou, Hua Zou, Budan Wu, Yun Su

Published in: Communications and Networking

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

To ensure the safety of data transmission in SDN network, a practical approach is to forward data by time division in multiple reachable paths. Considering multiple data transmission processes between the sender and the receiver based on the mechanism above, the overlap of the paths is inevitable, which may make the utilization rate of some switches or critical paths too high and other switches are relatively idle, then the transmission efficiency would be too low. This paper put forward a path selection algorithm based on graph-cut to solve the problem. Also, taking switch weight under consideration. In addition, effectiveness is taken into account. Considering to the large scale of actual networks and uneven occupancy rate of switches, this algorithm reflects its advantage.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference Kanagavelu, R., Mingjie, L.N., Mi, K.M., Lee, B.-S., Francis, Heryandi: OpenFlow based control for re-routing with differentiated flows in data center networks. In: International Conference on Networks (ICON), pp. 228–233. IEEE (2012) Kanagavelu, R., Mingjie, L.N., Mi, K.M., Lee, B.-S., Francis, Heryandi: OpenFlow based control for re-routing with differentiated flows in data center networks. In: International Conference on Networks (ICON), pp. 228–233. IEEE (2012)
3.
go back to reference Kai, W.: The load balancing research of SDN based on ant colony algorithm. Jilin University (2015) Kai, W.: The load balancing research of SDN based on ant colony algorithm. Jilin University (2015)
4.
go back to reference Giorgetti, A., Cugini, F., Paolucci, F., Castoldi, P.: OpenFlow and PCE architectures in wavelength switched optical networks. In: 2012 16th International Conference on Optical Network Design and Modeling (ONDM), pp. 1–6. IEEE (2012) Giorgetti, A., Cugini, F., Paolucci, F., Castoldi, P.: OpenFlow and PCE architectures in wavelength switched optical networks. In: 2012 16th International Conference on Optical Network Design and Modeling (ONDM), pp. 1–6. IEEE (2012)
5.
go back to reference Gargi, B., Deepinder, S.: Comparative analysis of path computation techniques for MPLS traffic engineering. Comput. Netw. 40(1), 149–165 (2002)CrossRef Gargi, B., Deepinder, S.: Comparative analysis of path computation techniques for MPLS traffic engineering. Comput. Netw. 40(1), 149–165 (2002)CrossRef
6.
go back to reference Li, Y., Pan, D.: OpenFlow based load balancing for Fat-Tree networks with multipath support. In: Proceedings of 12th IEEE International Conference on Communications (ICC 2013), Budapest, Hungary, pp. 1–5 (2013) Li, Y., Pan, D.: OpenFlow based load balancing for Fat-Tree networks with multipath support. In: Proceedings of 12th IEEE International Conference on Communications (ICC 2013), Budapest, Hungary, pp. 1–5 (2013)
7.
go back to reference Kaur, S., Singh, J., Kumar, K., et al.: Round-robin based load balancing in Software Defined Networking. In: Proceedings of 2nd International Conference on Computing for Sustainable Global Development (INDIACom), pp. 2136–2139 (2015) Kaur, S., Singh, J., Kumar, K., et al.: Round-robin based load balancing in Software Defined Networking. In: Proceedings of 2nd International Conference on Computing for Sustainable Global Development (INDIACom), pp. 2136–2139 (2015)
8.
go back to reference Craig, A., Nandy, B., Lambadaris, I., et al.: Load balancing for multicast traffic in SDN using real-time link cost modification. In: Proceedings of International Conference on Communications (ICC), pp. 5789–5795. IEEE (2015) Craig, A., Nandy, B., Lambadaris, I., et al.: Load balancing for multicast traffic in SDN using real-time link cost modification. In: Proceedings of International Conference on Communications (ICC), pp. 5789–5795. IEEE (2015)
9.
go back to reference Abe, J.O., Mantar, H.A., Yayimli, A.G.: k-maximally disjoint path routing algorithms for SDN. In: International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, pp. 499–508. IEEE Computer Society (2015) Abe, J.O., Mantar, H.A., Yayimli, A.G.: k-maximally disjoint path routing algorithms for SDN. In: International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, pp. 499–508. IEEE Computer Society (2015)
10.
go back to reference Guo, Y., Wang, Z., Yin, X., et al.: Traffic engineering in SDN/OSPF hybrid network. In: 2014 IEEE 22nd International Conference on Network Protocols (ICNP), pp. 563–568. IEEE (2014) Guo, Y., Wang, Z., Yin, X., et al.: Traffic engineering in SDN/OSPF hybrid network. In: 2014 IEEE 22nd International Conference on Network Protocols (ICNP), pp. 563–568. IEEE (2014)
11.
go back to reference Luo, C.: Research of the optimal path allocation algorithm oriented load balancing in SDN. Hubei University Of Technology (2016) Luo, C.: Research of the optimal path allocation algorithm oriented load balancing in SDN. Hubei University Of Technology (2016)
12.
go back to reference Li, K., Wang, S., Xu, S., et al.: ERMAO: an enhanced intradomain traffic engineering approach in LISP-capable networks. In: 2011 IEEE Global Telecommunications Conference (GLOBECOM 2011), pp. 1–5. IEEE (2011) Li, K., Wang, S., Xu, S., et al.: ERMAO: an enhanced intradomain traffic engineering approach in LISP-capable networks. In: 2011 IEEE Global Telecommunications Conference (GLOBECOM 2011), pp. 1–5. IEEE (2011)
14.
go back to reference Nardelli, E., Proietti, G., Widmayer, P.: A faster computation of the most vital edge of a shortest path. Inf. Process. Lett. 79(2), 81–85 (2001)MathSciNetCrossRef Nardelli, E., Proietti, G., Widmayer, P.: A faster computation of the most vital edge of a shortest path. Inf. Process. Lett. 79(2), 81–85 (2001)MathSciNetCrossRef
15.
go back to reference Guo, C., Lu, G., Li, D., et al.: BCube: a high performance, server-centric network architecture for modular data centers. SIGCOMM 39(4), 63–74 (2009)CrossRef Guo, C., Lu, G., Li, D., et al.: BCube: a high performance, server-centric network architecture for modular data centers. SIGCOMM 39(4), 63–74 (2009)CrossRef
16.
go back to reference Farrington, N., Porter, G., Radhakrishnan, S., et al.: Helios: a hybrid electrical/optical switch architecture for modular data centers. ACM SIGCOMM Comput. Commun. Rev. 40(4), 339–350 (2010)CrossRef Farrington, N., Porter, G., Radhakrishnan, S., et al.: Helios: a hybrid electrical/optical switch architecture for modular data centers. ACM SIGCOMM Comput. Commun. Rev. 40(4), 339–350 (2010)CrossRef
17.
go back to reference Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. ACM SIGCOMM Comput. Commun. Rev. 38(4), 63–74 (2008)CrossRef Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. ACM SIGCOMM Comput. Commun. Rev. 38(4), 63–74 (2008)CrossRef
Metadata
Title
A Novel Path Selection Algorithm Based on Graph-Cut to Ensure Security in SDN
Authors
Shuquan Fan
Rongheng Lin
Shiqi Zhou
Hua Zou
Budan Wu
Yun Su
Copyright Year
2018
Publisher
Springer International Publishing
DOI
https://doi.org/10.1007/978-3-319-78130-3_56

Premium Partner