作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2025, Vol. 51 ›› Issue (11): 152-161. doi: 10.19678/j.issn.1000-3428.0069824

• 网络空间安全 • 上一篇    下一篇

面向多样化网络需求的优先级队列流量调度算法

陈杰*(), 王俊昌, 胡嘉晨, 许杨   

  1. 南京邮电大学计算机学院, 江苏 南京 210023
  • 收稿日期:2024-05-08 修回日期:2024-06-27 出版日期:2025-11-15 发布日期:2024-09-05
  • 通讯作者: 陈杰
  • 基金资助:
    国家自然科学基金(62202237); 计算机软件新技术全国重点实验室国内开放课题基金(KFKT2022B04)

Priority Queues-Based Traffic Scheduling Algorithm for Diverse Network Requirements

CHEN Jie*(), WANG Junchang, HU Jiachen, XU Yang   

  1. College of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, Jiangsu, China
  • Received:2024-05-08 Revised:2024-06-27 Online:2025-11-15 Published:2024-09-05
  • Contact: CHEN Jie

摘要:

随着互联网的不断发展, 不同应用对性能的需求也呈现多样化趋势。例如, 云存储和文件共享服务等应用依赖于高吞吐量以实现高速的数据传输, 而多人在线游戏等应用则侧重于低延迟, 以保证用户间的即时交互和优质游戏体验。然而, 现有的网络交换设备大多采用固定的硬件架构和预定义的转发规则来处理数据流, 随着互联网应用场景的多样化, 这些固定的架构和功能限制了它们对不同网络流量类型的适应能力, 很难为不同类型的应用提供差异化服务。针对这些局限, 提出了一种使用不同优先级队列的流量调度算法。该算法通过交换机的数据平面实时监控流的特征, 并动态地将不同的流量分配到具有不同转发优先级的队列, 从而更有效地处理不同类型的流量, 使得网络服务能够根据不同应用场景灵活地进行资源分配。仿真实验结果表明, 采用不同优先级队列隔离流量的方法能够实现小流低延迟、大流高吞吐量以及降低丢包量等多个目标。这些实验结果为满足不同应用程序的性能需求提供了有力的支持。

关键词: 流量分类, 队列管理, 服务质量, 拥塞控制, 流量隔离

Abstract:

As the Internet continues to evolve, the performance requirements of various applications have become increasingly diverse. For example, applications such as cloud storage and file-sharing services depend on high throughput to achieve high-speed data transmission, while multiplayer online games emphasize low latency to ensure real-time interaction and a high-quality user experience. However, most existing network switching devices rely on fixed hardware architectures and predefined forwarding rules to handle data flows. With the increasing diversity of Internet application scenarios, these rigid architectures and limited functionalities hinder their adaptability to different types of network traffic, making it difficult to provide differentiated services for various applications. To address these limitations, this paper proposes a traffic scheduling algorithm that employs multiple priority queues. By monitoring flow characteristics in real time through the data plane of switches and dynamically allocating different types of traffic to queues with distinct forwarding priorities, the algorithm enables more effective handling of diverse traffic types and facilitates flexible resource allocation tailored to different application scenarios. Simulation results demonstrate that the proposed approach of isolating traffic using differentiated priority queues achieves multiple objectives, including low latency for small flows, high throughput for large flows, and reduced packet loss rates. These findings provide strong support for meeting the performance demands of various applications.

Key words: traffic classification, queue management, Quality of Service (QoS), congestion control, traffic isolation