Advertisement

Balancing the QOS and Security in Dijkstra Algorithm by SDN Technology

  • Zhao JinJingEmail author
  • Ling Pang
  • Xiaohui Kuang
  • Rong Jin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11276)

Abstract

Dijkstra algorithm is widely used in a lot of common network routing protocols. We consider the problem of quality of service (QoS) and the Security features of the network routing area using software defined networks (SDN). The SDN framework enables an efficient decoupled implementation of dynamic routing protocols which could aware the communication network status. In this work we consider the varying delay status of the communication network along with other network security parameters. The routing problem is formulated as a multi-constrained shortest path problem. A new improved Dijkstra algorithm is presented named as QS-Dijkstra. The implement and experiment show that QS-Dijkstra algorithm is able to minimize traffic routing through vulnerable links while satisfying the QoS constraints of the network.

References

  1. 1.
    Nunes, B., Mendonca, M., Nguyen, X.-N., Obraczka, K., Turletti, T.: A survey of software-defined networking: past, present, and future of programmable networks. IEEE Commun. Surv. Tutor. 16, 1617–1634.  https://doi.org/10.1109/surv.2014.012214.00180.pdf
  2. 2.
  3. 3.
    Open Networking Foundation: Software-defined networking: the new norm for networks. ONF White paper (2012)Google Scholar
  4. 4.
    Xiao, Y., Thulasiraman, K., Xue, G., Juttner, A.: The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization. AKCE Int. J. Graphs Comb. 2, 63–86 (2005)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Kuipers, F., Van Mieghem, P., Korkmaz, T., Krunz, M.: An overview of constraint-based path selection algorithms for QOS routing. IEEE Commun. Mag. 40, 50–55 (2002)CrossRefGoogle Scholar
  6. 6.
    Jüttner, A., Szviatovski, B., Mécs, I., Rajkó, Z.: Lagrange relaxation based method for the QOS routing problem. In: Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 859–868 (2001)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2018

Authors and Affiliations

  • Zhao JinJing
    • 1
    Email author
  • Ling Pang
    • 1
  • Xiaohui Kuang
    • 1
  • Rong Jin
    • 2
  1. 1.National Key Laboratory of Science and Technology on Information System SecurityBeijingChina
  2. 2.Beijing Space Information Relay and Transmission on Technology CentreBeijingChina

Personalised recommendations