B. Nunes, M. Mendonca, X. Nguyen, K. Obraczka, and T. Turletti, A Survey of Software-Defined Networking: Past, Present, and Future of Programmable Networks, pdf 2. Software-defined networking, vol.16, pp.1617-1634

, Software-defined networking: The new norm for networks, 2012.

Y. Xiao, K. Thulasiraman, G. Xue, and A. Juttner, The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization, AKCE International Journal of Graphs and Combinatorics, vol.2, pp.63-86, 2005.

F. Kuipers, P. Van-mieghem, T. Korkmaz, and M. Krunz, An overview of constraint-based path selection algorithms for QOS routing, IEEE Communications Magazine, vol.40, pp.50-55, 2002.

A. Jüttner, B. Szviatovski, I. Mécs, and Z. Rajkó, Lagrange relaxation based method for the QOS routing problem, Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, vol.2, pp.859-868, 2001.