由於近期使用者雲端服務應用的需求急遽上升，雲端服務企業紛紛建造大型的資料中心，在資料中心裡降低封包延遲時間和平衡資料中心線路的流量是兩個重要的議題。隨著軟體定義網路的蓬勃發展，軟體定義網路已成為研究者們解決網路問題重要的一部分。因此，本論文採用軟體定義網路集中式的架構，並設計有效率的繞徑演算法來解決上述兩個問題。在本論文我們提出四個演算法，第一個為最短路徑優先演算法，在此演算法中，我們會在網路中找一條剩餘頻寬最大的最短路徑來傳送資料。第二個演算法為頻寬感知繞徑演算法，此演算法目的在於找出一條剩餘頻寬最大的路徑，如果有多條剩餘頻寬最大的路徑存在，則選擇當中最短的路徑。第三與第四個演算法分別為第一與第二個演算法的延伸，在第三個演算法中，我們會找出前k條最短路徑，然後在選擇其中剩餘頻寬最大的路徑。第四個演算法則是找出前k條實驗表明剩餘頻寬最大的路徑，然後在選擇其中的最短路徑。實驗結果，相對於傳統的有線網路傳輸協定，本論文的方法可大幅提昇網路的利用率和降低使用者需求無法滿足的比率。

[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.