Advertisement

Multi-constraint QoS Disjoint Multipath Routing in SDN

  • Manan Doshi
  • Aayush Kamdar
  • Krishna Kansara
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 810)

Abstract

Efficient path computation that sustains varying quality of service requirements is a key networking concern. Even though modern networks turned to multipath routing schemes as a first step in this path, existing solutions still resulted in sub-flows being directed to the same paths. Moreover, maintaining the quality of service subject to multiple criterions while selecting the paths and handling connection requests dynamically has proved to be challenging tasks. Addressing all these issues requires a centralized, real-time- and fine-grained control of the network facilitated by Software Defined Networks (SDN) that have emerged as a revolutionary networking paradigm. In this paper, we deal with the former issue by computing k-max min disjoint paths and for the latter we use an analytic hierarchy process. The proposed solution combines the two approaches for deployment in an SDN environment.

Keywords

SDN QoS routing Analytic hierarchy process Disjoint multipath routing Multi-constraints 

References

  1. 1.
    Hung, M.-H., Wang, C.-H., He, Y.: A real-time routing algorithm for end-to-end communication networks with QoS requirements. In: 3rd International Conference on Computing Measurement Control and Sensor Network (2016).  https://doi.org/10.1109/cmcsn.2016.44
  2. 2.
    Orda, A., Sprintson, A.: Author. Efficient algorithm for computing disjoint QoS paths. In: Proceedings of IEEE INFOCOM 2004, vol. 1, pp. 727–738. IEEE Press (2004)Google Scholar
  3. 3.
    Pan, Q., Zheng, X.: MULTI-path sdn route selection subject to multi-constraints. In: 3rd International Conference on Cyberspace Technology (2015).  https://doi.org/10.1049/cp.2015.0818
  4. 4.
    Sandri, M., Silva, A., Rocha, L.A., Verdi, F.L.: On the benefits of using multipath TCP and Openflow in shared bottlenecks. In: 29th International Conference on Advanced Information Networking and Applications. IEEE (2015)Google Scholar
  5. 5.
    Chiesa, M., Kindler, G., Schapira, M.: Traffic engineering with equal-cost-multipath: an algorithmic perspective. In: INFOCOM, 2014 Proceedings IEEE, pp. 1590–1598, Apr 2014Google Scholar
  6. 6.
    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 (2015)Google Scholar
  7. 7.
    Campista, M.E.M., Rubinstein, M.G., Moraes, I.M., Costa, L.H.M.K., Duarte, O.C.M.B.: Challenges and research directions for the future internetworking. Commun. Surv. Tutor. IEEE 16(2),1050– 1079, Second 2014CrossRefGoogle Scholar
  8. 8.
    Akyildiz, I.F., Lee, A., Wang, P., Luo, M., Chou, W.: A roadmap for traffic engineering in SDN-OpenFlow networks. Comput. Netw. 7(1), pp. 1–30, 4 Oct 2014. ISSN 1389-1286CrossRefGoogle Scholar
  9. 9.
    Geng, H., Shi, X., Yin, X., Wang, Z., Yin, S.: Algebra and algorithms for multipath QoS routing in link state networks. J. Commun. Netw. 19(2) (2017)Google Scholar
  10. 10.
    Sheu, J.-P., Liu, L.-W., Jagadeesha, R.B., Chang, Y.-C.: An efficient multipath routing algorithm for multipath TCP in software-defined networks. In: European Conference on Networks and Communications (EuCNC) (2016)Google Scholar
  11. 11.
    Suurballe, J.W.: Disjoint paths in a network. Networks 4(2), 125–145 (1974)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Bhandari, R.: Survivable networks: algorithms for diverse routing. In: Springer Science & Business Media (1999)Google Scholar
  13. 13.
    Guo, Longkun, Shen, Hong: On finding min-min disjoint paths. Algorithmica 66(3), 641–653 (2013)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Li, C.-L., McCormic, S.T., Simchi-Levi, D.: The complexity of finding two disjoint paths with min-max objective function. Discret. Appl. Math. 26(1), 105–115 (1990)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Sonkoly, B., Nemeth, F., Csikor, L., Gulyas, L., Gulyas, A.: SDN based testbeds for evaluating and promoting multipath TCP. In: 2014 IEEE International Conference on Communications (ICC), pp. 3044–3050, June 2014Google Scholar
  16. 16.
    Mendiola, A., Astorga, J., Jacob, E., Higuero, M.: A survey on the contributions of Software-Defined Networking to Traffic Engineering. In: IEEE Communications Surveys & Tutorials, vol. 19, Issue 2, Second quarter 2017.  https://doi.org/10.1109/comst.2016.2633579CrossRefGoogle Scholar
  17. 17.
    Open Networking Foundation, Software-Defined Networking: The new norm for networks, Technical. report, 2012, white paperGoogle Scholar
  18. 18.
    Michel, O., Keller, E.: SDN in wide-area networks: a survey. In: 4th International Conference on Software Defined Systems (SDS) (2017).  https://doi.org/10.1109/sds.2017.7939138
  19. 19.
    Akyildiz, I.F., Lee, A., Wang, P., Luo, M., Chou, W.: Research challenges for traffic engineering in software defined networks. In: IEEE Network, vol. 30, Issue 3, May-June 2016.  https://doi.org/10.1109/mnet.2016.7474344CrossRefGoogle Scholar
  20. 20.
    OpenFlow Switch Specification v1.0-v1.4. www.opennetworking.org/sdn-resources/onf-specifications
  21. 21.
    Akyildiz, F., et al.: A roadmap for traffic engineering in software defined networks. Comput. Netw. 71, 1–30 (2014)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Shri Bhagubhai Mafatlal PolytechnicMumbaiIndia

Personalised recommendations