論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus:開放下載的時間 available 2030-07-30
校外 Off-campus:開放下載的時間 available 2030-07-30
論文名稱 Title |
在5G網路具有侵占式資源分配機制的封包排程的數學模型 A Mathematical Model for Packet Scheduling with Preemptive Resource Allocations on 5G Networks |
||
系所名稱 Department |
|||
畢業學年期 Year, semester |
語文別 Language |
||
學位類別 Degree |
頁數 Number of pages |
58 |
|
研究生 Author |
|||
指導教授 Advisor |
|||
召集委員 Convenor |
|||
口試委員 Advisory Committee |
|||
口試日期 Date of Exam |
2025-07-22 |
繳交日期 Date of Submission |
2025-07-30 |
關鍵字 Keywords |
gNB、資源區塊、侵占式的封包排程、馬可夫鏈、狀態機率 gNB, Resource Blocks, Preemptive Packet Scheduling, Markov Chains, State Probability |
||
統計 Statistics |
本論文已被瀏覽 290 次,被下載 0 次 The thesis/dissertation has been browsed 290 times, has been downloaded 0 times. |
中文摘要 |
5G行動網路的三大應用包含增強型行動寬頻(enhanced Mobile Broadband, eMBB)、極高可靠低延遲通訊(Ultra-Reliable and Low-Latency Communications, URLLC)、大規模機器類型通訊(massive Machine-Type Communications, mMTC),5G基地台(next Generation Node B, gNB)必須同時替三大應用的使用者設備(User Equipment, UE)轉傳封包,在有限資源區塊(Resource Blocks, RBs)的限制下,gNB除了要滿足URLLC應用對低延遲與高可靠率的要求外,也必須維持eMBB應用的資料傳輸率(Data Rate)並確保mMTC設備的成功連線。然而,目前的5G網路並沒有提供讓高優先權(例如URLLC)應用可以侵占(Preempt) eMBB或mMTC的應用,這會導致URLLC無法連線成功或增加排隊等待時間。為了解決上述問題,本論文提出一個具侵占式的資源分配(Preemptive Resource Allocations, PRA)演算法,在PRA機制中,gNB會讓讓三大應用封包分別進到三個不同的佇列(Queues),當新的URLLC封包要進入佇列時,如果三個佇列皆已被封包佔滿,gNB會檢查佇列內是否有eMBB封包,如果有eMBB封包,即將進入佇列的URLLC封包就可以侵占已經在佇列內的eMBB封包,也就是說在佇列內的eMBB封包會被丟棄,如果佇列內沒有eMBB封包,則要進入佇列的URLLC封包就會被拒絕進入佇列,此外針對mMTC的應用,我們保證它有足夠的資源元素來做連線。為了分析PRA機制的效能,我們建立一個馬可夫鏈的數學模型,並根據馬可夫鏈狀態的穩定機率推導出網路效能參數,從數值分析結果中,我們證明PRA機制可以降低URLLC與mMTC的封包丟棄機率,因此可以達成URLLC低延遲的需求、維持eMBB的最小的資料傳輸率、確保mMTC的成功連線機率。 |
Abstract |
Three primary applications are defined in 5G mobile networks, which include enhanced Mobile Broadband (eMBB), Ultra-Reliable and Low-Latency Communications (URLLC), and massive Machine-Type Communications (mMTC). The next generation Node B (gNB) must simultaneously forward packets for User Equipment (UE) across the three applications. Given the limited availability of Resource Blocks (RBs), the gNB must not only meet the strict latency requirements of URLLC but also maintain the data rate demands of eMBB and ensure successful connectivity for mMTC devices. Current 5G networks lack a mechanism that allows higher-priority applications such as URLLC to preempt eMBB or mMTC traffic, which may result in URLLC connection failures or excessive queueing delay. To address this issue, we propose a preemptive resource allocation (PRA) mechanism. This mechanism first classifies packets from the three applications into separate queues. When a new URLLC packet arrives and all queues are full, the gNB checks for eMBB packets. If eMBB packets exist, the arriving URLLC packet is allowed to preempt one eMBB packet. If no eMBB packets exist, the incoming URLLC packet is denied admission. Additionally, the mechanism ensures that sufficient RBs are available to establish connectivity for mMTC traffic. To analyze the performance of the PRA mechanism, a Markov-chain model of the system is built, and performance metrics are obtained from the state probabilities. Based on the results of numerical analysis, we demonstrate that the PRA mechanism can reduce the packet drop probabilities of URLLC and mMTC. Additionally, the PRA can satisfy low-latency requirements of URLLC, maintain the minimum data rate for eMBB, and ensure successful connectivity for mMTC. |
目次 Table of Contents |
論文審定書...................................... i 致謝.................................................. ii 摘要.................................................. iii Abstract............................................ iv 目錄.................................................. v 圖目錄.............................................. vii 表目錄.............................................. viii 第一章 導論..................................... 1 1.1 研究動機.................................... 1 1.2 研究方法.................................... 2 1.3 研究貢獻.................................... 3 1.4 章節介紹.................................... 3 第二章 5G網路的封包排程............ 4 2.1 5G OFDMA................................... 4 2.2 5G網路的三大應用.................... 7 2.3 排程演算法................................ 8 2.4 馬可夫鏈模型............................ 10 2.5 相關研究.................................... 11 第三章 5G侵占式的資源分配........ 15 3.1 系統架構.................................... 15 3.2 侵占式資源分配機制................ 16 3.3 馬可夫鏈數學模型.................... 17 3.3.1 模型假設................................. 17 3.3.2 狀態機率的計算..................... 21 3.3.3 效能參數的推導..................... 23 3.4 改變mMTC的Departure Rate.... 27 第四章 數值分析與結果討論......... 28 4.1 模型的參數設定........................ 28 4.2 數值結果與分析........................ 29 第五章 結論與未來工作................. 38 5.1 結論............................................ 38 5.2 本論文遭遇的困難.................... 39 5.3 未來工作.................................... 39 Reference......................................... 40 Acronyms......................................... 45 Index................................................. 47 |
參考文獻 References |
[1] 3GPP, “Technical Specification Group Radio Access Network; NR and NG-RAN Overall Description -Release 18” 3GPP, TS38.300, V18.4.0, Dec. 2024. [2] M. C. Lucas-Estañ, B. Coll-Perales, T. Shimizu, J. Gozalvez, T. Higuchi, S. Avedisov, O. Altintas, and M. Sepulcre, “An Analytical Latency Model and Evaluation of the Capacity of 5G NR to Support V2X Services Using V2N2V Communications,” IEEE Transactions on Vehicular Technology, vol. 72, pp. 2293-2306, Feb. 2023. [3] A. Esmaeily, H. V. K. Mendis, T. Mahmoodi, and K. Kralevska, “Beyond 5G Resource Slicing With Mixed-Numerologies for Mission Critical URLLC and eMBB Coexistence,” IEEE Open Journal of the Communications Society, vol. 4, pp. 727-747, Mar. 2023. [4] ITU, “IMT Vision – Framework and Overall Objectives of the Future Development of IMT for 2020 and Beyond,” ITU-R, M. 2083, Sep. 2015. [5] A. A. Olawole, F. Takawira, and C. S. Chabalala, “Task Offloading and Computation in Hybrid uRLLC and eMBB Cognitive Radio Enabled 5G Based Multiuser Edge Computing,” IEEE Access, vol. 13, pp. 79871-79893, May 2025. [6] M. E. Haque, F. Tariq, M. R. A. Khandaker, K. -K. Wong, and Y. Zhang, “A Survey of Scheduling in 5G URLLC and Outlook for Emerging 6G Systems,” IEEE Access, vol. 11, pp. 34372-34396, Apr. 2023. [7] Y. Kaura, B. Lall, R. K. Mallik, and A. Singhal, “Adaptive Scheduling of Shared Grant-Free Resources for Heterogeneous Massive Machine Type Communication in 5G and Beyond Networks,” IEEE Transactions on Network and Service Management, vol. 22, pp. 1188-1204, Apr. 2025. [8] H. Grama Srinath, S. Jha, and N. Mysore Balasubramanya, “An Efficient NB-IoT Compatible GF-NOMA PHY Mechanism for mMTC,” IEEE Internet of Things Journal, vol. 10, pp. 17949-17963, 15 Oct. 2023. [9] R. Prasad and A. Sunny, “QoS-Aware Scheduling in 5G Wireless Base Stations,” IEEE/ACM Transactions on Networking, vol. 32, pp. 1999-2011, Jun. 2024. [10] M. K. Rana, T. Pecorella, B. Sardar, R. R. Thipparaju, and D. Saha, “A QoS Improving Downlink Scheduling Scheme for Slicing in 5G Radio Access Network (RAN),” IEEE Transactions on Vehicular Technology, vol. 73, no. 3, pp. 4219-4233, Mar. 2024. [11] R. J. Jayabal, D. T. C. Wong, L. K. Goh, X. Zhang, C. M. Pang, and S. Sun, “Survey, Design and Evaluation of TGT-HC: A Time-Aware Shaper MAC for Wireless TSN,” IEEE Transactions on Mobile Computing, vol. 24, no. 6, pp. 5433-5445, Jun. 2025. [12] A. Mamane, M. Fattah, M. E. Ghazi, M. E. Bekkali, Y. Balboul, and S. Mazer, “Scheduling Algorithms for 5G Networks and Beyond: Classification and Survey,” IEEE Access, vol. 10, pp. 51643-51661, May 2022. [13] W. K. G. Seah, C. -H. Lee, Y. -D. Lin, and Y. -C. Lai, “Combined Communication and Computing Resource Scheduling in Sliced 5G Multi-Access Edge Computing Systems,” IEEE Transactions on Vehicular Technology, vol. 71, pp. 3144-3154, Mar. 2022. [14] F. Rawshan, M. Hossen, and M. R. Islam, “Multi-OLT Multi-Lane PON for 5G Fronthaul and Differential Services Through Access Class Priority-Based 2D Scheduling,” IEEE Open Journal of the Communications Society, vol. 5, pp. 6593-6610, Oct. 2024. [15] S. B. Chetty, H. Ahmadi, and A. Nag, “A DDPG-Based Zero-Touch Dynamic Prioritization to Address Starvation of Services for Deploying Microservices-Based VNFs,” IEEE Transactions on Machine Learning in Communications and Networking, vol. 2, pp. 526-545, Apr. 2024. [16] C. H. Ng and B. H. Soong, “Queueing Modelling Fundamentals With Applications in Communication Networks,” John Wiley & Sons Ltd, 2nd ed. 2008 [17] T. Wang, Y. Wang, Y. Wang, and J. Cheng, “A Resource-Efficient Coexistence Scheme for Massive Machine-Type and Human-to-Human Communications,” IEEE Transactions on Communications, vol. 72, pp. 1862-1877, Mar. 2024. [18] M. Akkoç and B. Canberk, “Flow-Aware QoS Engine for Ultra-Dense SDN Scenarios,” International Conference on Broadband Communications for Next Generation Networks and Multimedia Applications, pp. 1-6, Jul. 2020. [19] T. N. Weerasinghe, V. Casares-Giner, I. A. M. Balapuwaduge, and F. Y. Li, “Priority Enabled Grant-Free Access With Dynamic Slot Allocation for Heterogeneous mMTC Traffic in 5G NR Networks,” IEEE Transactions on Communications, vol. 69, pp. 3192-3206, May 2021. [20] H. Eddine Benmadani, M. Azni, T. Essa Alharbi, M. S. Alzaidi, and M. Tounsi, “Deep Reinforcement Learning-Based Dynamic Scheduling for Real-Time Applications in LTE and RAN Slicing for eMBB in 5G,” IEEE Access, vol. 13, pp. 33555-33570, Feb. 2025. [21] P. R. Priyadarshini, J. Bapat, and A. Mishra, “Channel and Delay Weighted Response Ratio Scheduler for 5G and Beyond Systems,” IEEE Communications Letters, vol. 28, pp. 1658-1662, Jul. 2024. [22] G. Li, S. Wang, Y. Huang, T. Huang, Y. Cui, and Z. Xiong, “Optimizing Fault-Tolerant Time-Aware Flow Scheduling in TSN-5G Networks” IEEE Transactions on Mobile Computing, vol. 24, pp.3441-3455, Dec. 2024. [23] T. S. M. Rasied, H. A. M. Ramli, F. D. A. Rahman, and A. R. Najeeb, “Adapting the Conventional Packet Scheduling Algorithms for Simultaneous Support of 5G Multimedia Traffic Mix,” International Conference on Fractional Differentiation and Its Applications, pp. 1-6, Mar. 2023. [24] M. H. Rashid Chayon, N. Hasan Shouvo, and M. A. Al Mamun, “An Efficient Scheduling Algorithm Based On Buffer Status and Queue Length to Satisfy the Real-time Users in 5G,” International Conference on Computer and Information Technology, pp. 2014-2019, Dec. 2024. [25] E. Engin, I. Hokelek, A. Gorcin, and H. A. Cirpan, “A Pre-Emptive Scheduling Mechanism for Service Assurance of Network Slicing in Next Generation Cellular Networks,” IEEE Access, vol. 13, pp. 23297-23311, Jan. 2025. [26] A. Zaki-Hindi, S. E. Elayoubi, and T. Chahed, “URLLC and eMBB Coexistence in Unlicensed Spectrum: a Preemptive Approach,” International Wireless Communications and Mobile Computing, pp. 229-234, Jun. 2020. [27] Z. Liu, K. Li, Y. Wang, and P. Zhu, “Mixed Traffic Scheduling With Latency and Jitter Analysis in URLLC Industrial Automation,” IEEE Internet of Things Journal, May 2025. [28] L. Raviv and A. Leshem, “Joint Scheduling and Resource Allocation for Packets With Deadlines and Priorities,” IEEE Communications Letters, vol. 27, pp. 248-252, Jan. 2023. [29] X. Jin, Y. Tian, C. Xu, C. Xia, D. Li, and P. Zeng, “Mixed-Criticality Industrial Data Scheduling on 5G NR,” IEEE Internet of Things Journal, vol. 9, pp. 10306-10318, Jun. 2022. [30] D. Ivanova, E. Markova, D. Moltchanov, R. Pirmagomedov, Y. Koucheryavy, and K. Samouylov, “Performance of Priority-Based Traffic Coexistence Strategies in 5G mmWave Industrial Deployments,” IEEE Access, vol. 10, pp. 9241-9256, Jan. 2022. |
電子全文 Fulltext |
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。 論文使用權限 Thesis access permission:自定論文開放時間 user define 開放時間 Available: 校內 Campus:開放下載的時間 available 2030-07-30 校外 Off-campus:開放下載的時間 available 2030-07-30 您的 IP(校外) 位址是 18.97.14.82 現在時間是 2026-06-12 論文校外開放下載的時間是 2030-07-30 Your IP address is 18.97.14.82 The current date is 2026-06-12 This thesis will be available to you on 2030-07-30. |
紙本論文 Printed copies |
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。 開放時間 available 2030-07-30 |
QR Code |