臺灣博碩士論文加值系統

SDN支持頻外以及頻內控制平面的兩種體系結構。頻外控制平面用於將控制和數據流量的資源分開，而頻內控制平面允許數據流量和控制流量共享相同的資源，因此它不需要額外的物理端口來控制流量，這在經濟上會更加的實惠。然而，這種架構的實施具有挑戰性，因為它可能會導致數據競爭和控制流量競爭，由於流量密度而導致網絡擁塞。建立控制流量路徑至關重要，因為OpenFlow交換機需要與控制器建立通信。因此，排隊是一種解決方案，可用於解決SDN頻內控制平面中出現的問題，以將控制和數據流量分離到另一個隊列。在這種方法中，使用OVS-TC的排隊功能的結果表明，HTB隊列可以充當SDN頻內控制和數據流量的隊列。 SFQ和FQ調度程序可以使用TC命令在HTB類下並行應用。與SDN頻內控制平面中HTB類下的FQ調度程序相比，SFQ調度程序提供了更好的公平性。本研究中使用的公平性參數是最低和最高吞吐量與減速值之間的比率。

SDN support two architectures of the control plane, which are the out-of-band control plane and the In-band control plane. The out-of-band control plane separates resources for control and data traffic. In contrast, the In-band control plane allows data traffic and control traffic to share the same resources so that it does not need an extra physical port for control traffic, which is more economical. Yet, implementation of this architecture is challenging, because it can lead to a competition of data and control traffic, which can cause packet loss of control traffic. Establishing a control traffic path is vital because an OpenFlow switch needs to build communication links with the controller. Therefore, queueing is one solution that can be used to solve the problem in the SDN In-band control plane architecture to separate control and data traffic by using different queues. In this method, the results of queueing using OVS-TC show that the HTB can serve queue for control and data traffic in SDN In-band. Moreover, SFQ and FQ scheduler can be applied under the HTB class parallel using TC command. SFQ scheduler serves better fairness compared to the FQ scheduler under the HTB class in the SDN In-band control plane. The fairness parameter used in this research is the ratio between the lowest and highest throughput and slowdown value.

TABLE OF CONTENTS

摘 要 i
Abstract ii
Acknowledgements iii
List of Tables vii
Table of Figures viii
1 Chapter 1 – Introduction 1
1.1 Background 1
1.2 Research Objective 2
1.3 Research Limitation 2
1.4 Thesis Structure 3
1.5 Research Process 3
2 Chapter 2 – State of The Art 4
2.1 Software-Defined Network (SDN) 4
2.1.1 SDN Controller 5
2.1.2 SDN Control Plane 6
2.1.3 OpenFlow Protocol 8
2.2 QoS in OpenFlow 10
2.3 Linux Traffic Control 11
2.3.1 Hierarchical Token Bucket (HTB) 11
2.3.2 Stochastic Fairness Queueing (SFQ) 13
2.3.3 Deficit Round Robin (DRR) 14
2.3.4 Fair Queueing (FQ) 14
2.4 Fairness in Network 15
3 Chapter 3 – Methodology 17
3.1 OpenDaylight (ODL) 17
3.2 Mininet Network Emulator 18
3.3 VMware Workstation 19
3.4 Measurement Tool 19
3.4.1 iPerf 19
3.4.2 Wireshark 20
3.5 Experiment Environment 20
3.6 Implementation 20
3.6.1 Experiment Schemes 21
3.6.2 The parallel between the OVS queue and TC command 23
3.6.3 Experiment Configuration Validation 25
4 Chapter 4 – Data Analysis and Results 28
4.1 HTB’s Queue in Shaping Bandwidth 28
4.2 SFQ as Scheduler in HTB’s Queue 34
4.3 FQ as Scheduler in HTB’s Queue 38
4.4 Packet Handling Mechanism of OVS-TC Model 41
4.5 Comparative Study from the Previous Paper 42
5 Chapter 5 – Conclusions and Future Work 43
5.1 Conclusion 43
5.2 Future Work 44
6 REFERENCES 45
7 APPENDIX 48

[1]N. Workshop, “Open vSwitch QoS Open vSwitch,” vol. 31, no. October, pp. 1–58, 2010.
[2]A. Jalili, H. Nazari, S. Namvarasl, and M. Keshtgari, “A comprehensive analysis on control plane deployment in SDN: In-band versus out-of-band solutions,” 2017 IEEE 4th Int. Conf. Knowledge-Based Eng. Innov. KBEI 2017, vol. 2018-Janua, pp. 1025–1031, 2018.
[3]“Quality of Service (QoS) — Open vSwitch 2.12.90 documentation.” [Online]. Available: http://docs.openvswitch.org/en/latest/faq/qos/. [Accessed: 12-Nov-2019].
[4]F. Akhtar, M. H. Rehmani, and A. Davy, “A Network Coding Approach to In-Band Control Traffic Sharing in Software Defined Networks,” 2018 4th IEEE Conf. Netw. Softwarization Work. NetSoft 2018, no. NetSoft, pp. 318–322, 2018.
[5]S. Sharma, D. Staessens, D. Colle, M. Pickavet, and P. Demeester, “In-band control, queuing, and failure recovery functionalities for openflow,” IEEE Netw., vol. 30, no. 1, pp. 106–112, 2016.
[6]“Software-Defined Networking (SDN) Definition - Open Networking Foundation.” [Online]. Available: https://www.opennetworking.org/sdn-definition/?nab=1&utm_referrer=https%3A%2F%2Fwww.google.com%2F. [Accessed: 12-Nov-2019].
[7]B. Y. M. Casado, N. Foster, and A. Guha, “Abstractions for Software- Defined Networks.”
[8]W. Braun and M. Menth, “Software-Defined Networking Using OpenFlow: Protocols, Applications and Architectural Design Choices,” Futur. Internet, vol. 6, no. 2, pp. 302–336, 2014.
[9]G. Booch, “SDN architecture,” IEEE Softw., vol. 23, no. 2, pp. 16–18, 2006.
[10]R. Toghraee, Learning OpenDaylight The art of deploying successful network. Birmingham - Mumbai: Packt, 2017.
[11]S. D. Networking and P. Jha, “End-to-end Quality-of-Service in Software Defined Networking by University of Dublin , Trinity College,” no. September, 2017.
[12]ONF, “OpenFlow Switch Specification 1.4.0,” Current, vol. 0, pp. 1–3205, 2013.
[13]P. Ferguson and G. Huston, “Quality of Service: Deliv-ering QoS in the Internet and the Corporate Network.,” pp. 1–237, 1998.
[14]“Classful Queuing Disciplines (qdiscs).” [Online]. Available: https://tldp.org/HOWTO/Traffic-Control-HOWTO/classful-qdiscs.html. [Accessed: 19-May-2020].
[15]“HTB manual - user guide.” [Online]. Available: http://luxik.cdi.cz/~devik/qos/htb/manual/userg.htm#sharing. [Accessed: 14-Dec-2019].
[16]“Differentiated Service using Linux - SFQ queuing discipline.” [Online]. Available: http://web.opalsoft.net/qos/default.php?p=ds-25. [Accessed: 15-Dec-2019].
[17]“Ubuntu Manpage: sfq - Stochastic Fairness Queueing.” [Online]. Available: http://manpages.ubuntu.com/manpages/trusty/man8/tc-sfq.8.html. [Accessed: 14-Dec-2019].
[18]P. E. McKenney, “Stochastic Fairness Queueing,” IEEE, 1990.
[19]M. Shreedhar and G. Varghese, “Efficient fair queuing using deficit round-robin,” IEEE/ACM Trans. Netw., vol. 4, no. 3, pp. 375–385, 1996.
[20]“tc-fq(8) - Linux manual page.” [Online]. Available: https://man7.org/linux/man-pages/man8/tc-fq.8.html. [Accessed: 18-Jun-2020].
[21]E. A. Pazner, “Pitfalls in the theory of fairness,” J. Econ. Theory, vol. 14, no. 2, pp. 458–466, 1977.
[22]R. Denda, R. Denda, A. Banchs, and W. Effelsberg, “The fairness challenge in computer networks,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 1922, pp. 208–220, 2000.
[23]J. M. Jaffe, “Bottleneck Flow Control,” IEEE Trans. Commun., vol. 29, no. 7, pp. 954–962, 1981.
[24]C. Douligeris and L. N. Kumar, “Fairness issues in the networking environment,” Comput. Commun., vol. 18, no. 4, pp. 288–299, 1995.
[25]J. B. Nagle, “On packet switches with infinite storage,” IEEE Trans. Commun., vol. 35, no. 4, pp. 435–438, 1987.
[26]“Beryllium - OpenDaylight.” [Online]. Available: https://www.OpenDaylight.org/what-we-do/current-release/beryllium. [Accessed: 14-Dec-2019].
[27]H. Shi, R. V. Prasad, E. Onur, and I. G. M. M. Niemegeers, “Fairness in wireless networks: Issues, measures and challenges,” IEEE Commun. Surv. Tutorials, vol. 16, no. 1, pp. 5–24, 2014.
[28]M. Harchol-Balter and M. Harchol-Balter, Performance Modeling and Design of Computer Systems. 2013.