|
[1] N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, “OpenFlow: Enabling Innovation in Campus Networks,” in ACM SIGCOMM Computer Communication Review, 2008 [2] B. Shen, B. Hao, and A. Sen, “On Multipath Routing Using Widest Pair of Disjoint Paths,” in Proceedings of Workshop on High Performance Switching and Routing, 2004. [3] B. Augustin, T. Friedman, and R. Teixeira, “Measuring Multipath Routing in the Internet,” in IEEE/ACM Transactions on Networking, 2011. [4] R. Cominetti and C. Guzman, “Network Congestion Control with Markovian Multipath Routing,” in Proceedings International conference on NETwork Games, Control and Optimization, 2011. [5] T. Benson, A. Akella, and D. Maltz, “Network Traffic Characteristics of Data Centers in the Wild,” in Proceedings Internet Measurement Conference, 2010. [6] Y. Kanizo, D. Hay, and I. Keslassy, “Palette: Distributing Tables in Software-Defined Networks," in IEEE INFOCOM, 2013. [7] Y. Li and D. Pan, “OpenFlow Based Load Balancing for Fat-Tree Networks with Multipath Support,” 2012. [8] M. Koerner and O. Kao “Multiple Service Load-Balancing with OpenFlow,” in Proceedings of International Conference on High Performance Switching and Routing, 2012. [9] T. He, D. Goeckel, R. Raghavendra, and D. Towsley, “Endhost-Based Shortest Path Routing in Dynamic Networks: An Online Learning Approach,” in IEEE INFOCOM, 2013. [10] Open Networking Foundation, “Software-Defined Networking: the new norm for networks,” 2012. Available:https://www.opennetworking.org/images/stories/downloads/sdn-resources/white-papers/wp-sdn-newnorm.pdf [11] M. Reitblatt, N. Foster, J. Rexford, and D. Walker, “Software-Defined Networks: Change You Can Believe In,” in Proceedings Hot Topics in Networks, 2011. [12] “Openflow switch specification v1.3.4,” 2014. Available : https://www.opennetworking.org/sdn-resources/onf-specifications [13] Open Networking Foundation. Available: https://www.opennetworking.org/ [14] J. Dean and S. Ghemawat, “MapReduce: Simplified Data Processing on Large Clusters,” in OSDI, 2004. [15] M. Alizadeh, A. Greenberg, D. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan, “Data Center TCP (DCTCP),” in SIGCOMM, 2010. [16] N. Foster, A. Guha, M. Reitblatt, A. Story, M. J. Freedman, N. P. Katta, C. Monsanto, J. Reich, J. Rexford, C. Schlesinger, and D. Walker “Languages for software-defined networks,” in IEEE Communications Society, 2013. [17] A. Al-Shabibi and B. Martin “MultiRoute - A Congestion-Aware Multipath Routing Protocol,” in Proceedings of the International Conference on High Performance Switching and Routing, 2010. [18] Ryu. http://osrg.github.io/ryu/ [19] B. Lantz, B. Heller, and N. McKeown, “A Network in a Laptop: Rapid Prototyping for Software-Definded Networks,” in ACM SIGCOMM, 2010. [20] M. Al-Fares, A. Loukissas, and A. Vahdat, “A Scalable, Commodity Data Center Network Architecture,” in ACM SIGCOMM, 2008. [21] P. Singh, M. Lee, S. Kumar, and R. R. Kompella, “Enabling Flow-Level Latency Measurements across Routers in Data Centers,” in Proceedings Hot Topics in Management of Internet, Cloud, and Enterprise Networks and Services, 2011. [22] C.-Y. Hong, S. Kandula, R. Mahajan, M. Zhang, V. Gill, M. Nanduri, and R. Wattenhofer, “Achieving High Utilization with Software-Driven WAN,” in ACM SIGCOMM, 2013. [23] S. Jain, A. Kumar, S. Mandal, J. Ong, L. Poutievski, A. Singh, S. Venkata, J. Wanderer, J. Zhou, M. Zhu, J. Zolla, U. Hölzle, S. Stuart and A. Vahdat, “B4: Experience with a Globally-Deployed Software Defined WAN. in ACM SIGCOMM, 2013. [24] M. L. Fredman and R. E. Tarjan, “Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms,” in Journal of ACM, 1987. [25] E. W. Dijkstra, “A Note on Two Problems in Connexion with Graphs,” in Numerische Mathematic, 1959. [26] J. Y. Yen, “Finding the K Shortest Loopless Paths in A Network,” in Management Science, 1971.
|