臺灣博碩士論文加值系統

於傳統網路上，由於缺乏對於整體網路資源的掌握，所以難以針對多媒體應用程式，如視訊串流，提供服務品質(QoS)保證的服務。 軟體定義網路提供了一個創新的方法，利用將控制層與轉送層分開來實現集中控制與管理工作。在本論文中，我們提出一個在軟體定義網路上，對於視訊串流提供服務品質保證的動態路由方法。透過可適性編碼視訊 (scalable encoded videos)，將其中的基礎層與加強層的封包做分類，並賦予基礎層有重新找路由的最高優先權，使能在最短路徑不符合延遲差異的限制下，重新找路由直到有可用頻寬充足的路徑。相反地，若此路徑可用頻寬不足時，則讓加強層封包重新導路由至此路徑上。實驗結果證明，與OpenQoS相較下，我們提出的方法，對基礎層的封包遺失率(Packet Loss Rate)，可以改善最高達77.3%，並針對最短路徑與可行路由路徑，在不同網路負載情況下，提供至少51.4%的覆蓋率。

For multimedia applications, such as video streaming applications, with the need of Quality of Service (QoS) support, it is difficult to successfully implement QoS architectures in traditional networks which lack a global view of overall network resources. Software Defined Networking (SDN) provides an innovative architecture to realize central management among networks. In this paper, we propose an adaptive routing approach for video streaming with QoS support over SDN networks, called ARVS. In our approach, base layer packets and enhancement layer packets of video bit streams are treated separately as two levels of QoS flows. During video streaming, if the shortest path does not satisfy the delay variation constraint, the base layer packets have the first priority to be rerouted to a calculated feasible path based on available bandwidth of this path, and the enhancement layer packets will stay on the shortest path. However, if there is no available bandwidth in this path, the base layer packets will stay on the shortest path while the enhancement layer packets will be rerouted to this path. Therefore, the video quality would be guaranteed easily due to the congestion of the shortest path has been mitigated. Simulation results have shown that compared with OpenQoS, our approach can reduce up to 77.3% of the packet loss rate for the base layer packets of video bit streams, and also enhance at least 51.4% coverage under various network loads of the shortest path and the feasible path.

Chapter 1 Introduction 1
Chapter 2 Related Work 4
Chapter 3 Proposed Adaptive routing for Video Streaming with QoS Support 9
3.1 Related notations and LARAC algorithm 9
3.2 Dynamic and adaptive routing 10
3.3 The flowchart for the proposed ARVS 13
Chapter 4 Simulation Results and Discussion 16
4.1 Simulation environment 16
4.2 Comparison of packet loss rates between the proposed ARVS and OpenQoS 17
4.3 Packet loss rate comparison of QoS level-1 flows under different network load levels of the shortest path and the feasible path 20
Chapter 5 Conclusion 22
5.1 Concluding remarks 22
5.2 Future work 22
References 23

[1] F. de Oliveira Silva; J.H. de Souza Pereira; P.F. Rosa; S.T. Kofuji, “Enabling Future Internet Architecture Research and Experimentation by Using Software Defined Networking,” in European Workshop on Software Defined Networking (EWSDN), pp. 73-78, 2012
[2] R. Braden, D. Clark, and S. Shenker,“Integrated services in the internet architecture: an overview,” RFC 1633, Internet Engineering Task Force, June 1994.
[3] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss,“An architecture for differentiated services,” RFC 2475, Internet Engineering Task Force, Dec. 1998.
[4] A. Campbell, G. Coulson, and D. Hutchison, “A quality of service architecture,” ACM SIGCOMM Computer Communication Review, vol. 24, no. 2, pp. 6–27, Apr. 1994.
[5] H. Schwarz, D. Marpe, and T. Wiegand, “Overview of the scalable video coding extension of the H.264/AVC standard,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 17, no. 9, pp. 1103–1120, Sep. 2007.
[6] "Software-Defined Networking: The New Norm for Networks - Open Networking Foundation,” [Online]. Available: https://www.opennetworking.org/images/stories/downloads/sdn-resources/white-papers/wp-sdn-newnorm.pdf.
[7] Li Zhenjiang, J.J. Garcia-Luna-Aceves, "Solving the multi-constrained path selection problem by using depth first search," in International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, pp. 9-15, 2005.
[8] "Computers and intractability: A guide to the theory of NP-completeness - Wikipedia," [Online]. Available: http://en.wikipedia.org/wiki/Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness.
[9] Z. Wang and J. Crowcroft, “Quality-of-service routing for supporting multimedia applications,” IEEE Journal on Selected Areas in Communications, vol. 14, no. 7, pp. 1228–1234, Sep. 1996.
[10] G. Xue, W. Zhang, J. Tang, and K. Thulasiraman, “Polynomial time approximation algorithms for multi-constrained QoS routing,” IEEE/ACM Transactions on Networking, vol. 16, no. 3, pp. 656–669, Jun. 2008.
[11] A. Juttner, B. Szviatovski, I. Mecs, and Z. Rajko, “Lagrange relaxation based method for the QoS routing problem,” in Proceedings of the IEEE Computer and Communications Societies, vol. 2, pp. 859–868, 2001.
[12] S. Chen, M. Song, and S. Sahni, “Two techniques for fast computation of constrained shortest paths,” IEEE/ACM Transactions on Networking, vol. 16, no. 1, pp. 105–115, Feb. 2008.
[13] Egilmez, H., Civanlar, S., Tekalp, M., "An optimization framework for QoS-enabled adaptive video streaming over OpenFlow networks," IEEE Transactions on Multimedia, vol. 15, no. 3, pp. 710–715, 2013.
[14] “Mininet” [Online]. Available: http://mininet.github.io/.
[15] “Floodlight” [Online]. Available: http://www.projectfloodlight.org/floodlight/.