References
- Cisco VNI Forecast Widget [Online]. Available: http://www.cisco.com/c/dam/m/en_us/solutions/serviceprovider/vni-forecast-widget/forecast-widget/index.html.
- L. H. Sahasrabuddhe and B. Mukherjee, "Multicast routing algorithms and protocols: a tutorial," IEEE Network, vol. 14, no. 1, pp. 90-102, 2000. https://doi.org/10.1109/65.819175
- C. A. C. Marcondes, T. P. C. Santos, A. P. Godoy, C. C. Viel, and C. A. C. Teixeira, "CastFlow: clean-slate multicast approach using in-advance path processing in programmable networks," in Proceedings of IEEE Symposium on Computers & Communications (ISCC), Cappadocia, Turkey, 2012, pp. 94-101.
- S. Xu, C. Wu, and Z. Li, "Software defined mobile multicast," in Proceedings of 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems (MASS), Dallas, TX, 2015, pp. 208-216.
- N. Xue, X. Chen, L. Gong, S. Li, D. Hu and Z. Zhu, "Demonstration of OpenFlow-controlled network orchestration for adaptive SVC video manycast," IEEE Transactions on Multimedia, vol. 17, no. 9, pp. 1617-1629, 2015. https://doi.org/10.1109/TMM.2015.2450014
- J. R. Jiang and S. Y. Chen, "Constructing multiple Steiner trees for software-defined networking multicast," in Proceedings of the 11th International Conference on Future Internet Technologies, Nanjing, China, 2016 pp. 1-6.
- M. Sun, X. Zhang, L. Wang, H. Shi, and W. Zhang, "A multiple multicast tree optimization solution based on software defined network," in Proceedings of 2016 7th International Conference on Information and Communication Systems, Irbid, Jordan, 2016, pp. 168-173.
- P. Winter, "Steiner problem in networks: a survey," Networks, vol. 17, no. 2, pp. 129-167, 1987. https://doi.org/10.1002/net.3230170203
- F. K. Hwang and D. S. Richards, "Steiner tree problems," Networks, vol. 22, no. 1, pp. 55-89, 1992. https://doi.org/10.1002/net.3230220105
- H. Takahashi and A. Matsuyama, "An approximate solution for the Steiner problem in graphs," Mathematica Japonica, vol. 24, no. 6, pp. 573-577, 1980.
- L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, vol. 15, no. 2, pp. 141-145, 1981. https://doi.org/10.1007/BF00288961
- C. P Low and N. Wang, "An efficient algorithm for group multicast routing with bandwidth reservation," Computer Communications, vol. 23, no. 18, pp. 1740-1746, 2000. https://doi.org/10.1016/S0140-3664(00)00222-X
- P. Brooks and B. Hestnes, "User measures of quality of experience: why being objective and quantitative is important," IEEE Network, vol. 24, no. 2, pp. 8-13, 2010. https://doi.org/10.1109/MNET.2010.5430138
- C. Banse and S. Rangarajan, "A secure northbound interface for SDN applications," in Proceedings of 2015 IEEE Trustcom/BigDataSE/ISPA, Helsinki, Finland, 2015, pp. 834-839.
- Open Networking Foundation, "OpenFlow Switch Specification," 2015 [Online]. Available: https://www.opennetworking.org/images/stories/downloads/sdn-resources/onf-specifications/openflow/openflow-switch-v1.5.1.pdf.
- A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: an approach to universal topology generation," in Proceedings of 9th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), Cincinnati, OH, 2001, pp. 346-353.
- R. C. Prim, "Shortest connection networks and some generalizations," Bell Labs Technical Journal, vol. 36, no. 6, pp. 1389-1401, 1957. https://doi.org/10.1002/j.1538-7305.1957.tb01515.x
- X. Jia and L. Wang, "A group multicast routing algorithm by using multiple minimum Steiner trees," Computer Communications, vol. 20, no. 9, pp. 750-758, 1997. https://doi.org/10.1016/S0140-3664(97)00081-9
- C. P. Low and X. Song, "On finding feasible solutions for the delay constrained group multicast routing problem," IEEE Transactions on Computers, vol. 51, no. 5, pp. 581-588, 2002. https://doi.org/10.1109/TC.2002.1004596
- Y. L. Wang, "Based QoS constrained group multicast routing for multimedia communication," in Proceedings of 2010 International Conference on Computer, Mechatronics, Control and Electronic Engineering, Changchun, China, 2010, pp. 296-299.
- E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, no. 1, pp. 269-271, 1959. https://doi.org/10.1007/BF01386390
- B. M. Waxman, "Routing of multipoint connections," IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, pp. 1617-1622, 2002.