Chen, Yu-FangYu-FangChenLin, Frank Yeong-SungFrank Yeong-SungLinHsu, Sheng-YungSheng-YungHsuSun, Tzu-LungTzu-LungSunHuang, YennunYennunHuangHsiao, Chiu-HanChiu-HanHsiao2025-08-122025-08-122025-06https://www.scopus.com/pages/publications/85217659599https://scholars.lib.ntu.edu.tw/handle/123456789/731256This paper tackles key challenges in Software-Defined Networking (SDN) by proposing a novel approach for optimizing resource allocation and dynamic priority assignment using OpenFlow’s priority field. The proposed Lagrangian relaxation (LR)-based algorithms significantly reduces network delay, achieving performance management with dynamic priority levels while demonstrating adaptability and efficiency in a sliced network. The algorithms’ effectiveness were validated through computational experiments, highlighting the strong potential for QoS management across diverse industries. Compared to the Same Priority baseline, the proposed methods: RPA, AP–1, and AP–2, exhibited notable performance improvements, particularly under strict delay constraints. For future applications, the study recommends expanding the algorithm to handle larger networks, integrating it with artificial intelligence technologies for proactive resource optimization. Additionally, the proposed methods lay a solid foundation for addressing the unique demands of 6G networks, particularly in areas such as base station mobility (Low-Earth Orbit, LEO), ultra-low latency, and multi-path transmission strategies.entrueLagrangian relaxation (LR)network managementopenflow priority schedulingquality of service (QoS)resource allocationsoftware-defined networking (SDN)journal article10.1109/tnsm.2025.35400122-s2.0-85217659599