|
Bibliography [1] B. experience with a globally-deployed software defined wan, “Sushant jain,” in SIGCOMM, Proceedings of the ACM SIGCOMM 2013, 2013. [2] X.-N. Nguyen, D. Saucez, C. Barakat, and T. Turletti, “Optimizing rules place- ment in openflow networks: trading routing for better efficiency,” in ACM HotSDN, 2014, pp. 127–132. [3] N. Bitar, S. Gringeri, and T. J.Xia, “Technologies and protocols for data center and cloud networking,” IEEE Communications Magazine, vol. 51, no. 9, pp. 24–31, 2013. [4] R. Cohen, L. Lewin-Eytan, J. S. Naor, and D. Raz, “On the effect of forwarding table size on sdn network utilization,” in INFOCOM, 2013 Proceedings IEEE. IEEE, 2014, pp. 1734–1742. [5] N. Kang, Z. Liu, J. Rexford, and D. Walker, “Optimizing the ”one big switch” abstraction in software-defined networks,” in ACM CoNEXT, 2013 Proceedings of the ACM conference, 2013, pp. 13–24. [6] X.-N. Nguyen, D. Saucez, C. Barakat, and T. Turletti, “Officer: A general op- timization framework for openflow rule allocation and endpoint policy enforce- ment,” in INFOCOM, 2015 Proceedings IEEE. IEEE, 2015, pp. 478–486. [7] S. Agarwal, M. Kodialam, and T. V. Lakshman, “Traffic engineering in software defined networks,” in INFOCOM, 2013 Proceedings IEEE. IEEE, 2013, pp. 2211–2219. [8] T. Benson, A. Akella, and D. A. Maltz, “Network traffic characteristics of data centers in the wild,” in IMC ’10 Proceedings of the 10th ACM SIGCOMM con- ference on Internet measurement. ACM, 2010, pp. 267–280. [9] Garg, Naveen, Knemann, and Jochen, “Sdn and openflow for dynamic flex-grid optical access and aggregation networks,” IEEE, pp. 864–870, 2014. [10] S. Luo, H. Yu, , and L. M. Li, “Fast incremental flow table aggregation in sdn,” in 2014 International Conference on Computer Communication and Net- works(ICCN), 2014, pp. 1–8. [11] H. G. BADR and S. PODAR, “An optimal shortest-path routing policy for net- work computers with regular mesh- connected topologies,” IEEE Transactions on Computers, vol. 38, pp. 1362 – 1371, 1989. [12] C. W. Ahn and R. S. Ramakrishna, “A genetic algorithm for shortest path rout- ing problem and the sizing of populations,” IEEE Transactions on Evolutionary Computation, vol. 6, pp. 566–579, 2002. [13] J.-R. Jiang, H.-W. Huang, J.-H. Liao, and S.-Y. Chen, “Extending dijkstra’s shortest path algorithm for software defined networking,” in IEEE Network Op- erations and Management Symposium, 2014, pp. 1–4. [14] S. Cicerone, G. DAngelo, G. D. Stefano, and D. Frigioni, “Partially dynamic ef- ficient algorithms for distributed shortest paths,” Theoretical Computer Science, vol. 411, pp. 1013–1037, 2010. [15] N. Kang, Z. Liu, J. Rexford, and D. Walker, “Application-aware aggregation and traffic engineering in a converged packet-circuit network,” in National Fiber Optic Engineers Conference 2011, 2011. [16] Y. Kanizo, D. Hay, and I. Keslassy, “Palette: Distributing tables in software- defined networks,” in INFOCOM, 2013 Proceedings IEEE. IEEE, 2013, pp. 545–549. [17] R. E. Tarjan, “Finding optimum branchings,” Networks, vol. 7, pp. 25–35, 1977.
|