近年來網際網路快速的成長和發展，越來越多的網路應用及服務也漸漸出現在日常生活中，隨著服務的發展，大家也開始注重服務的品質及體驗，於是Internet Engineering Task Force (IETF)提出了Quality of Service(QoS) 來完成品質保證，但QoS架構中提出的兩種服務品質保證方法IntServ、Diffserv受限於傳統網路的架構，都是基於傳統的hop-by-hop routing，無法對整體網路資源做有效率的利用，而且無法依據不同服務類型來滿足特定需求的頻寬、延遲和抖動。例如:根據經驗和研究，串流的要求主要有足夠的頻寬，較低的延遲，較低的抖動，幾乎不會遺失封包，才能讓整體串流順暢;而語音服務則是需要低延遲、低抖動、但不需要太大頻寬，若有dejitter buffer會讓整體服務較不受抖動影響，但是也會升高延遲，而延遲會在對話上造成困擾;線上遊戲服務需要低延遲、低抖動，但是實際需要的資料傳輸量並不大;而一般檔案傳輸只需要足夠的頻寬即可，只要延遲和抖動不是極端的狀態就不會有太大影響。
    而最近興起的SDN概念可以有效解決傳統架構的問題，OpenFlow協議下的SDN是一個擁有方便管理、高效率、可適應性、高動態性等優點的新網路架構，SDN將整體網路架構分成控制層和轉發層，switch只做轉發功用，剩下的控制全部交由controller處理，彼此之間透過OpenFlow協議溝通，經由這樣集中式的控制器管理，可以有效進行軟體控制，感知整體網路中交換器的連結狀態，進而提供良好的路由控制，選擇出網路拓樸中的最佳路徑來傳遞封包。而在許多的最短路徑演算法中，Dijkstra’s Shortest Path Algorithm被認為是一種簡單明瞭，又能求出最佳解的演算法，此演算法從某一節點出發，利用路徑不同的權重，建立起一個最短路徑樹，以此迅速計算出結果。
    因此，本篇論文綜合以上概念，建立一個機制，針對不同服務類型所注重的參數來計算路徑權重，並利用Dijkstra’s Shortest Path Algorithm計算結果，在有限資源的環境下，提供最符合各類服務品質需求的路由。

Best-effort delivery mechanism is no longer fulfilling the needs of growing internet requirements, Internet Engineering Task Force (IETF) therefore announced Quality of Service (QoS) to relieve the intense network. However, those two service insurance methods (IntServ, Diffserv) of QoS are still basing on conventional hop-by-hop routing, which requires massive facilities to fulfill rush hours, but mostly idling on off-peak time. Besides, those improvements cannot specifically match every kind of internet services by various conditions, such as bandwidth, delay and jitter. According to experiments, we know that Streaming services need sufficient bandwidth、low delay、low jitter and low loss rate; Voice services need low delay、low jitter，but Voice service does not need much bandwidth, if it has a dejitter buffer, it can reduce the jitter, but increase the delay; Gaming services need low delay and low jitter, but jitter is the most serious impact on the game experience; data transmission services just need sufficient bandwidth.
    The developing SDN is therefore presenting to solve this issue effectively. Under the OpenFlow standard, SDN is a novel networking structure, which is considering as highly efficient, adaptive, and easy to be altered and managed. SDN contains control layer and transmission layer, transmissions are handled by switch and the controller processes the rest of the control progresses, and OpenFlow standard is used for communications between controllers and network devices. Centralized controller management can therefore achieve an effective software control. Sensing the connecting status of switches further to provide efficient routing control i.e. transmitting packages by the best path in the network topology. Among various routing algorithms, Dijkstra’s Shortest Path Algorithm is considering as a simple but very efficient algorithm. This algorithm calculates routing weight from nodes to nodes to build best routing tree and to acquire the routing result quickly. 
    This work makes a combination of all those conditions and conceptions above, creates alternative routing mechanisms to process different networking services. And by Dijkstra’s Shortest Path Algorithm to calculate proper routing, this work would be therefore achieve the multi-services quality insurance control based on SDN.

第一章	緒論	1
1.1	前言	1
1.2	動機與目的	2
1.3	論文章節架構	3
第二章	相關研究與背景資料	4
2.1	Software-Defined Networking (SDN)	4
2.1.1	SDN Controller架構	6
2.1.2	SDN Controller介紹-RYU	7
2.2	OpenFlow	8
2.2.1	OpenFlow 架構	8
2.2.1 	OpenFlow Switch介紹-Mininet	10
2.3	網路服務分類	11
2.3.1 	影音串流	11
2.3.2 	語音服務	11
2.3.3 	網路遊戲	12
2.3.4 	檔案傳輸	12
2.4 	服務品質 (Quality of Service ,QoS)	13
2.5 	路徑演算法	13
第三章	傳輸路徑選擇機制	15
3.1 	服務品質保證	15
3.2 	整體流程	18
第四章	模擬結果與效能分析	19
4.1 	模擬內容	19
4.2 	實驗I- 驗證單服務路徑選擇	20
4.2.1 	模擬環境與情境	20
4.2.2 	數據與分析	22
4.3 	實驗II-驗證單服務路徑選擇(隨機)	33
4.3.1 	模擬環境與情境	35
4.3.2 	數據與分析	37
4.4 	實驗III-驗證多服務路徑選擇	44
4.4.1 	模擬環境與情境	44
4.4.2 	數據與分析	45
第五章	結論與未來展望	50
參考文獻	51

圖2.1軟體定義網路架構	4
圖2.2傳統網路與SDN的架構差異比較	5
圖2.3 SDN 控制器架構	6
圖2.4 RYU應用程式開發模型	7
圖2.5 OpenFlow架構圖	9
圖2.6 Flow table 欄位	9
圖2.7最短路徑演算法範例	14
圖3.1機制流程圖	18
圖4.1實驗一模擬拓樸	20
圖4.2 OSPF-同時提供4個串流(1)-吞吐量	23
圖4.3 OSPF-同時提供4個串流(1)-遺失率	24
圖4.4 RSS-同時提供4個串流(1)-吞吐量	24
圖4.5 RSS-同時提供4個串流(1)-遺失率	25
圖4.6 OSPF-同時提供4個串流(2)-吞吐量	27
圖4.7 OSPF-同時提供4個串流(2)-遺失率	27
圖4.8 RSS-同時提供4個串流(2)-吞吐量	28
圖4.9 RSS-同時提供4個串流(2)-遺失率	28
圖4.10 OSPF-同時提供4個遊戲-抖動	30
圖4.11 RSS同時提供4個遊戲-抖動	31
圖4.12波松過程示意圖	33
圖4.13實驗二模擬拓樸	35
圖4.14 OSPF-同時提供4個串流(隨機)-吞吐量	38
圖4.15 OSPF-同時提供4個串流(隨機)-遺失率	38
圖4.16 RSS-同時提供4個串流(隨機)-吞吐量	39
圖4.17 RSS-同時提供4個串流(隨機)-遺失率	39
圖4.18 OSPF-同時提供4個遊戲(隨機)-抖動	41
圖4.19 RSS同時提供4個遊戲(隨機)-抖動	42
圖4.20實驗三模擬拓樸	44
圖4.21 OSPF同時提供4種類型服務-串流吞吐量	46
圖4.22 OSPF同時提供4種類型服務-串流遺失率	46
圖4.23 RSS同時提供4種類型服務-串流吞吐量	47
圖4.24 RSS同時提供4種類型服務-串流遺失率	47
圖4.25 OSPF同時提供4種類型服務-遊戲抖動	48
圖4.26 RSS同時提供4種類型服務-遊戲抖動	48

表3.1 本論文之服務品質參數	16
表4.1影音串流環境設定(1)	21
表4.2影音串流環境設定(2)	21
表4.3 語音服務環境設定	21
表4.4遊戲服務環境設定	22
表4.5檔案傳輸環境設定	22
表4.6同時提供4個串流(1)-比較	25
表4.7同時提供4個串流(2)-比較	29
表4.8同時提供4個語音-比較	29
表4.9同時提供4個遊戲-比較	31
表4.10同時提供四個檔案傳輸-比較	32
表4.11波松過程條件	34
表4.12影音串流(隨機)環境設定	35
表4.13 語音服務(隨機)環境設定	36
表4.14遊戲服務(隨機)環境設定	36
表4.15檔案傳輸(隨機)環境設定	36
表4.16同時提供4個串流(隨機)-比較	40
表4.17同時提供4個語音(隨機)-比較	40
表4.18同時提供4個遊戲(隨機)-比較	42
表4.19同時提供四個檔案傳輸(隨機)-比較	43
表4.20實驗三環境設定	45
表4.21 同時提供四個種類型服務-語音及遊戲比較	49
表4.22 同時提供四個種類型服務-檔案傳輸比較	49

[1] 	S. Shenker, C. Partridge and R. Guerin, “Specification of Guaranteed Quality of Service”, IETF RFC 2212,1997
[2]	Martin Casado, Michael J. Freedman, Justin Pettit,Jianying Luo, Nick McKeown, Scott Shenker. “Ethane:Taking Control of the Enterprise,” ACM SIGCOMM’07, August 2007, Kyoto, Japan.
[3] 	范恂毅,張曉和,“新一代SDN：VMware NSX 網絡原理與實踐”, 人民郵電出版社
[4]	N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner. “Openflow: enabling innovation in campusnetworks.”, ACM SIGCOMM, Volume 38 Issue 2, April 2008
[5]	Open Networking Foundation, “Software-Defined Networking:The New Norm for Networks”, April 2012
[6]	S. Jain, A. Kumar, S. Mandal, J. Ong, L. Poutievski, A. Singh, S. Venkata, J. Wanderer, J. Zhou, M. Zhu, J. Zolla, U. Hlzle, S. Stuart and A. Vahdat, “B4: Experience with a Globally-Deployed Software Defined WAN”, Proceedings of the ACM SIGCOMM 2013 Conference., pp. 3-14, 201
[7]	軟體定義網路架構
 	(https://www.opennetworking.org/sdn-resources/sdn-definition)
[8]	張景皓”新一代網路架構SDN顛覆傳統網路的控制模式”
(http://www.ithome.com.tw/node/77353)
[9]	雲端資料中心開放式與虛擬化網路環境的實踐 — 軟體定義網路(http://www.ringline.com.tw/zh-tw/article_info.php?id=11)
[10] 廖俊傑,林盈達, “SDN 交換器與傳統交換器的架構與效能比較”,September 30, 2013
[11]	Thomas D. Nadeau , Ken Gray, "SDN: Software Defined     Networks" ,May 2015.
[12] NOX (http://www.noxrepo.org/nox/about-nox/)
[13] POX (http://www.noxrepo.org/pox/about-pox/)
[14] Floodlight OpenFlow Controller -Project Floodlight (http://www.projectfloodlight.org/floodlight/)
[15] The OpenDaylight Platform(https://www.opendaylight.org/)
[16] RYU SDN Framework (https://osrg.github.io/ryu/)
[17] RYU project team,“RYU SDN Framework-Using OpenFlow1.3”
[18] RYU應用程式的開發模型
(https://osrg.github.io/ryu-book/zh_tw/html/arch.html)
[19] 支援OpenFlow協議Swich由Open Networking Foundation提供 (https://www.opennetworking.org/sdn-openflow-products?limitstart=0)
[20] Mininet (http://mininet.org/)
[21] Data-Over-Cable Service Interface Specifications, DOCSIS 3.1,MAC and Upper Layer Protocols Interface Specification,
”CM-SP-MULPIv3.1-I03-140610”, CableLabs, JUN 10,2014
[22] M. Stiemerling (Ed.), H. Schulzrinne, Columbia U. and A. Rao, “Real Time Streaming Protocol 2.0 (RTSP)”, IETF, 2011.
[23] Randa El-Marakby, David Hutchison, “Scalability improvement of the real-time control protocol (RTCP) leading to management facilities in the Internet," Computers and Communications, P125-129,1998.
[24] Peng Liang, Yang Shun, “Research and implementation of voice transmission based on RTP protocol,”Computational Problem-Solving (ICCP), P416-419, 2010.
[25] 網際協議通話技術
(https://zh.wikipedia.org/wiki/%E7%B6%B2%E9%9A%9B%E5%8D%94%E8%AD%B0%E9%80%9A%E8%A9%B1%E6%8A%80%E8%A1%93)
[26]程裕翔,”日理萬機的線上遊戲系統”, Hope Net,民92.1,頁40-44
[27] 遊戲伺服器TCP vs UDP
(https://1024monkeys.wordpress.com/2014/04/01/game-servers-udp-vs-tcp/)
[28] Jani Lakkakorpia, Andreas Heinerb, Jussi Ruutuc,Nokia Research Center,“Measurement and characterization of Internet gaming traffic”
[29] Rahul AminFrance JacksonJuan E. GilbertJim MartinTerry Shaw,” Assessing the Impact of Latency and Jitter on the Perceived Quality of Call of Duty Modern Warfare 2”, HCI 2013: Human-Computer Interaction. Users and Contexts of Use pp 97-106
[30] 檔案傳輸協定
(https://zh.wikipedia.org/wiki/%E6%96%87%E4%BB%B6%E4%BC%A0%E8%BE%93%E5%8D%8F%E8%AE%AE)
[31] R. Braden, D. Clark, and S. Shenker, “Integrated Services in the Internet Architecture: An Overview”, IETF RFC 1633, Jun. 1994.
[32] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss , “An Architecture for Differentiated Services”, IETF RFC 2475, Dec. 1998.
[33] H. Egilmez, S. Dane, K. Bagci and A. Tekalp, “OpenQoS: An Open-Flow controller design for multimedia delivery with end-to-end quality of service over software-defined networks”, Proc. Asia-Pacific Signal Inf. Process. Assoc. Annu. Summit Conf., pp. 1-8, 2012
[34] 涂國祥, 林盈達, “多媒體串流應用：產品比較與實例分析”, 國立交通大學資訊科學系.
[35]	 H. Egilmez, S. Civanlar, M. Tekalp, “An optimization framework for QoS-enabled adaptive video streaming over OpenFlow networks”, IEEE Transactions on Multimedia, vol. 15, no. 3, pp. 710–715, 2013.
[36] Tsung-Feng Yu, Kuochen Wang, Yi-Huai Hsu, “Adaptive Routing for Video Streaming with QoS Support over SDN Networks”, 2015 International Conference on Information Networking (ICOIN),pp. 318 – 323, Jan. 2015
[37]	 K. Govindarajan, K.C. Meng, H. Ong, W.M. Tat, S. Sivanand, L.S. Leong, “Realizing the quality of service (QoS) in software defined networking (SDN) based cloud infrastructure”, Proceedings of the Second International Conference on Information and Communication Technology (ICoICT) (2014), pp. 505–510
[38]	 A. Juttner, B. Szviatovszki, I. Mecs, and Z. Rajko, “Lagrange relaxation based method for the QoS routing problem", in Proc. IEEE International Conference on Computer Communications (INFOCOM), April 22-26, 2001, vol.2, pp. 859-868
[39] H. E. Egilmez, S. Civanlar, and A. M. Tekalp, “A distributed QoS routing architecture for scalable video streaming over multi-domain OpenFlow networks”, in Proc. IEEE International Conference on Image Processing (ICIP), Sept.-Oct. 2012, pp. 2237-2240.
[40]	 Jehn-Ruey Jiang, Hsin-Wen Huang, Ji-Hau Liao, and Szu-Yuan Chen, “Achieving Optimal Routing for Software Defined Networking by Extending Dijkstra’s Algorithm”, in  Proc. of the 2014 Cross-Strait Information Technology Conference (CSIT 2014), 2014.
[41] E. Dijkstra, “A note on two problems in connexion with graphs,” Numerische mathematik, vol. 1, no.1, 1959, pp. 269-271.
[42] 波松過程
(https://zh.wikipedia.org/wiki/%E6%B3%8A%E6%9D%BE%E8%BF%87%E7%A8%8B)
[43] How to Generate Random Timings for a Poisson Process
(http://preshing.com/20111007/how-to-generate-random-timings-for-a-poisson-process/)
[44] Donald Gross, “Fundamentals of Queueing Theory”, Wiley-Interscience