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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Software-defined-networking. https://en.wikipedia.org/wiki/Software-defined_networking
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)
Kai, W.: The load balancing research of SDN based on ant colony algorithm. Jilin University (2015)
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)
Gargi, B., Deepinder, S.: Comparative analysis of path computation techniques for MPLS traffic engineering. Comput. Netw. 40(1), 149–165 (2002)
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)
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)
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)
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)
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)
Luo, C.: Research of the optimal path allocation algorithm oriented load balancing in SDN. Hubei University Of Technology (2016)
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)
Bazgan, C., Toubaline, S., Vanderpooten, D.: Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 126–140. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22616-8_11
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)
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)
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)
Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. ACM SIGCOMM Comput. Commun. Rev. 38(4), 63–74 (2008)
The Open Network Operating System. http://onosproject.org
Acknowledgments
This work is supported by Beijing Natural Science Foundation (4174099) and National High Technology Research and Development Program (863 Program) of China (2015AA050203).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Fan, S., Lin, R., Zhou, S., Zou, H., Wu, B., Su, Y. (2018). A Novel Path Selection Algorithm Based on Graph-Cut to Ensure Security in SDN. In: Li, B., Shu, L., Zeng, D. (eds) Communications and Networking. ChinaCom 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 236. Springer, Cham. https://doi.org/10.1007/978-3-319-78130-3_56
Download citation
DOI: https://doi.org/10.1007/978-3-319-78130-3_56
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-78129-7
Online ISBN: 978-3-319-78130-3
eBook Packages: Computer ScienceComputer Science (R0)