基于时间槽的可降带宽分级动态资源预约算法

1)华南理工大学广东省计算机网络重点实验室,广东广州 510641; 2)华南理工大学计算机科学与工程学院,广东广州 510641

视频业务QoS; 时间槽; 可降带宽; 分级动态资源预约算法

Tiered dynamic resource reservation based on time slot and bandwidth reduction
LI Guanlin1, 2, ZHANG Ling1, 2, and HE Kejing2

1)Guangdong Key Laboratory of Computer Network, South China University of Technology, Guangzhou 510641, Guangdong Province, P.R.China2)School of Computer Science and Engineering, South China University of Technology, Guangzhou 510641, Guangdong Province,

QoS of video service; time slot; bandwidth reduction; tiered dynamic resource reservation algorithm

DOI: 10.3724/SP.J.1249.2020.99101

备注

限制视频业务发展的主要矛盾是其高带宽、低时延的网络要求与核心网网络环境复杂多变和Best-Effort服务模型之间的矛盾. 为了解决这一问题,在基于SDN的核心网络框架下,提出了一种基于时间槽的可降带宽的视频业务分级动态资源预约算法. 该算法在可降带宽的动态资源预约算法的基础上引入分级策略,如发现不满足视频业务带宽需要的时候采用降带宽的方式进行处理,同时,将高优先级的会议请求在带宽分配队列中前置. 通过仿真对算法进行测试,结果表明,该算法能进一步增加高优先级视频业务资源预约的成功率.

The main contradiction that limits the development of video services is its high-bandwidth, low-latency network requirements and the complex and variable core network environment and Best-Effort service model. In order to solve this problem, this paper proposes a tiered dynamic resource reservation algorithm for video services based on time slot and bandwidth reduction under SDN core network framework. The algorithm introduces a grading policy on the basis of the bandwidth-reducing dynamic resource reservation algorithm, and adopts bandwidth reduction when the bandwidth requirement of the video service cannot be satisfied. At the same time, the bandwidth is reserved for high-priority conference requests. The simulation results show that the algorithm can further improve the success rate of high-priority video service resource reservation.

·