Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 管理學院
  3. 資訊管理學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/20288
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor林永松(Yeong-Sung Lin)
dc.contributor.authorSheng-Yung Hsuen
dc.contributor.author徐聖詠zh_TW
dc.date.accessioned2021-06-08T02:44:13Z-
dc.date.copyright2020-09-29
dc.date.issued2020
dc.date.submitted2020-09-21
dc.identifier.citation“IMT Vision – Framework and Overall Objectives of the Future Development of
IMT for 2020 and Beyond,” International Telecommunication Union, White Paper,
Sep. 2015. [Online]. Available: https://www.itu.int/rec/R-REC-M.2083-0-201509-I/en [Accessed: Nov. 25, 2019].
“NGMN 5G White Paper,” Next Generation Mobile Networks, White Paper, Feb.
2015. [Online]. Available: https://www.ngmn.org/wp-content/uploads/NGMN_5G_White_Paper_V1_0.pdf [Accessed: Nov. 25, 2019].
X. Zhou, R. Li, T. Chen, and H. Zhang, 'Network Slicing as a Service: Enabling Enterprises' Own Software-Defined Cellular Networks,' IEEE Communications Magazine, vol. 54, no. 7, pp. 146-153, July 2016.
J. Ordonez-Lucena, P. Ameigeiras, D. Lopez, J. J. Ramos-Munoz, J. Lorca, and J. Folgueira, 'Network Slicing for 5G with SDN/NFV: Concepts, Architectures, and Challenges,' IEEE Communications Magazine, vol. 55, no. 5, pp. 80-87, May 2017.
F. Hu, Q. Hao, and K. Bao, 'A Survey on Software-Defined Network and OpenFlow: From Concept to Implementation,' IEEE Communications Surveys Tutorials, vol. 16, no. 4, pp. 2181-2206, Fourth quarter 2014.
R. Mijumbi, J. Serrat, J. Gorricho, N. Bouten, F. De Turck, and R. Boutaba, 'Network Function Virtualization: State-of-the-Art and Research Challenges,' IEEE Communications Surveys Tutorials, vol. 18, no. 1, pp. 236-262, First quarter 2016.
“Network Functions Virtualisation (NFV); Infrastructure Overview,” European Telecommunications Standards Institute, White Paper, Jan. 2015. [Online]. Available: https://www.etsi.org/deliver/etsi_gs/NFV-INF/001_099/001/01.01.01_60/gs_NFV-INF001v010101p.pdf [Accessed: Dec. 18, 2019].
“OpenFlow Switch Specification Version 1.5.1”, Open Networking Foundation, March 26, 2015. [Online]. Available: https://www.opennetworking.org/wp-content/uploads/2014/10/openflow-switch-v1.5.1.pdf [Accessed: Dec. 22, 2019].
D. Bertsekas and R. Gallager, DATA NETWORKS, 2nd ed. the United States of America: Prentice-Hall International, Inc., 1987.
X. Zhou, R. Li, T. Chen, and H. Zhang, 'Network Slicing as a Service: Enabling Enterprises' Own Software-Defined Cellular Networks,' IEEE Communications Magazine, vol. 54, no. 7, pp. 146-153, July 2016.
L. Kleinrock, Queueing Systems Volume 1: Theory. New York: Wiley-Interscience, 1975.
M. Paliwal, D. Shrimankar, and O. Tembhurne, 'Controllers in SDN: A Review Report,' IEEE Access, vol. 6, pp. 36256-36270, June 2018.
A. M. Geoffrion, “Lagrangian Relaxation and Its Use in Integer Programming,” Mathematical Programming Studies, vol. 2, pp. 82-114, January 1974.
D. P. Bertsekas, “Multiplier Methods: A survey,” Automatica, vol. 12, no. 2, pp. 133–145, March 1976.
D. P. Bertsekas, “Constrained Optimization and Lagrange Multiplier Methods,” Computer Science and Applied Mathematics. Boston, MA, USA: Academic, 1982, vol. 1.
M. R. Hestenes, “Multiplier and gradient methods,” Journal of Optimization Theory and Applications, vol. 4, no. 5, pp. 303–320, November 1969.
M. L. Fisher, “The Lagrangian Relaxation Method for Solving Integer Programming Problems,” Management Science, vol. 50, no. 12, pp. 1861-1871, December 2004.
M. Held and R. M. Karp, “The Traveling-Salesman Problem and Minimum Spanning Trees,” Operation Research, vol. 18, no. 6, pp. 1138-1162, December 1970.
M. Held and R. M. Karp, “The Traveling-Salesman Problem and Minimum Spanning Trees: Part II,” Mathematical Programming: Series A and B, vol. 1, no. 1, pp. 6-25, December 1971.
M. Held, P. Wolfe, and H. P. Crowder, “Validation of Subgradient Optimization,” Mathematical Programming, vol. 6, no. 1, pp. 62-88, December 1974.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/20288-
dc.description.abstract5G軟體定義網路被視為第五代行動通訊網路 (5G) 的關鍵技術,預期可以實現集中式的無線接取網路、網路切片和網路功能虛擬化等技術。並且透過軟體定義網路控制器與新的網路協定,能夠更有效的分配資源,使得未來網路架構更有彈性、效率及可靠性。
然而,當網路切片形成一種服務,目前仍缺乏提供垂直產業或市場對於不同服務提供不同對應的優先級概念。而網路實體層中的分離問題和端到端服務需求的延遲問題仍舊需要被解決。因此在本篇論文中,提出了優先級概念來分配多種服務要求在網路切片中的路徑選擇與優先級設定並計算其延遲,以期望每種服務需求都能獲得延遲要求的滿足。
這個複雜的問題被我們進一步設計為數學模型,目標是最小化所有端到端服務要求的平均延遲。並且利用拉格朗日鬆弛法來解決該模型,並且發展了以拉格朗日鬆弛法為基礎的演算法來求可行解。最後,透過了實驗情境來證明我們所提出演算法的效果,優先級概念的幫助與延遲的降低都證明了其能力,可有效提供系統維運之參考。
zh_TW
dc.description.abstractThe 5G software-defined network is regarded as the key technology of the fifth generation mobile communication network (5G), and it is expected to realize technologies such as centralized wireless access network, network slicing, and network function virtualization. And through software defined network controller and OpenFlow protocol, resources can be allocated more efficiently, making future network architecture more flexible, efficient, and reliable.
However, when network slicing become a service, there is still a lack of the concept of providing vertical industries or segments with different corresponding priorities for different services. The isolation problem in the physical layer of the network and the delay of end-to-end service requirements still need to be solved. Therefore, in this thesis, the concept of priority is proposed to allocate multiple service requirements, and the delay is calculated to expect that the delay tolerance of each service requirement can be met.
This complex problem is designed as a mathematical model with the goal of minimizing the average latency of all end-to-end service requirements. The Lagrangian relaxation method was used to solve the model, and an algorithm based on the Lagrangian relaxation was developed to find a feasible solution. Finally, through experimental scenarios to prove the effectiveness of our proposed algorithm.
en
dc.description.provenanceMade available in DSpace on 2021-06-08T02:44:13Z (GMT). No. of bitstreams: 1
U0001-1708202016380700.pdf: 1928057 bytes, checksum: bf861e6a19e0063ba1e9c92f452bb90a (MD5)
Previous issue date: 2020
en
dc.description.tableofcontents誌謝 i
中文摘要 ii
ABSTRACT iii
CONTENTS iv
LIST OF FIGURES vi
LIST OF TABLES vii
Chapter 1 Introduction 1
1.1 Background 1
1.2 Motivation 5
1.3 Thesis Organization 5
Chapter 2 Literature Review 7
2.1 Key Technologies of Network Slicing: NFV and SDN 7
2.2 OpenFlow 11
2.3 M / G / 1 Queueing System 13
2.4 Network Slicing as a Service Business Model 16
Chapter 3 Problem Formulation 18
3.1 Problem Description 18
3.2 Mathematical Formulation 19
3.2.1 Model 1: Non-Preemptive Priority 20
3.2.2 Model 2: Preemptive Priority 30
Chapter 4 Solution Approach 40
4.1 The Lagrangian Relaxation Method 40
4.2 Solution Approach for the Primal Problem 42
4.2.1 The Lagrangian Relaxation Problem of Non-Preemptive Model 42
4.2.2 The Lagrangian Relaxation Problem of Preemptive Model 66
4.2.3 Dual Problem and Subgradient Method 85
4.2.4 Getting Primal Feasible Solution 86
Chapter 5 Computational Experiments 91
5.1 Experiment Environment 91
5.2 Performance Metrics 94
5.2.1 Gap 94
5.3 Performance Evaluation Cases 94
5.3.1 Performance Evaluation Cases of Non-Preemptive Model 94
5.3.2 Performance Evaluation Cases of Preemptive Model 98
Chapter 6 Conclusion and Future Work 102
6.1 Conclusion 102
6.2 Future Work 102
6.2.1 Consider Delay in Cloud Processing 102
6.2.2 Admission Control 103
REFERENCE 104
dc.language.isoen
dc.title考量多服務優先權於軟體定義網路之資源協作最佳化演算法zh_TW
dc.titleA Resource Orchestration Optimization Algorithm Concerning Multiple Service Priorities in 5G Software Defined Networksen
dc.typeThesis
dc.date.schoolyear109-1
dc.description.degree碩士
dc.contributor.oralexamcommittee孔令傑(Ling-Chieh Kung),呂俊賢(CHUN-HSIEN LU),莊東穎(Tong-Ying Juang),鍾順平(Shun-Ping Chung)
dc.subject.keyword第五代移動通訊系統,軟體定義網路,網路切片,端到端延遲,拉格朗日鬆弛法,zh_TW
dc.subject.keyword5G,Software Defined Network,Network Slicing,End-to-End Delay,Lagrangian Relaxation,en
dc.relation.page107
dc.identifier.doi10.6342/NTU202003799
dc.rights.note未授權
dc.date.accepted2020-09-22
dc.contributor.author-college管理學院zh_TW
dc.contributor.author-dept資訊管理學研究所zh_TW
顯示於系所單位:資訊管理學系

文件中的檔案:
檔案 大小格式 
U0001-1708202016380700.pdf
  未授權公開取用
1.88 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved