 An Innovative Priority Queueing Strategy for Mitigating Traffic Congestion in Complex NetworksGanhua Wu ()
Mathematics, 2025, vol. 13, issue 3, 1-21 Abstract: Optimizing transportation in both natural and engineered systems, particularly within complex network environments, has become a pivotal area of research. Traditional methods for mitigating congestion primarily focus on routing strategies that utilize first-in-first-out (FIFO) queueing disciplines to determine the processing order of packets in buffer queues. However, these approaches often fail to explore the benefits of incorporating priority mechanisms directly within the routing decision-making processes, leaving significant room for improvement in congestion management. This study introduces an innovative generalized priority queueing (GPQ) strategy, specifically designed as an enhancement to existing FIFO-based routing methods. It is important to note that GPQ is not a new queue scheduling algorithm (e.g., deficit round robin (DRR) or weighted fair queuing (WFQ)), which typically manage multiple queues in broader queue management scenarios. Instead, GPQ integrates a dynamic priority-based mechanism into the routing layer, allowing the routing function to adaptively prioritize packets within a single buffer queue based on network conditions and packet attributes. By focusing on the routing strategy itself, GPQ improves the process of selecting packets for forwarding, thereby optimizing congestion management across the network. The effectiveness of the GPQ strategy is evaluated through extensive simulations on single-layer, two-layer, and dynamic networks. The results demonstrate significant improvements in key performance metrics, such as network throughput and average packet delay, when compared to traditional FIFO-based routing methods. These findings underscore the versatility and robustness of the GPQ strategy, emphasizing its capability to enhance network efficiency across diverse topologies and configurations. By addressing the inherent limitations of FIFO-based routing strategies and proposing a generalized yet scalable enhancement, this study makes a notable contribution to network optimization. The GPQ strategy provides a practical and adaptable solution for improving transportation efficiency in complex networks, bridging the gap between conventional routing techniques and emerging demands for dynamic congestion management. Keywords: generalized priority queueing strategy; routing strategy; traffic congestion; complex networks (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:3:p:495-:d:1582169 Access Statistics for this article Mathematics is currently edited by Ms. Emma He More articles in Mathematics from MDPI |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.