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

计算机工程 ›› 2008, Vol. 34 ›› Issue (22): 124-126. doi: 10.3969/j.issn.1000-3428.2008.22.042

• 网络与通信 • 上一篇    下一篇

一种新的提供服务时间保证的流调度算法

洪 中1,2,唐依珠1   

  1. (1. 福州大学数学与计算机科学学院,福州 350002;2. 福建师范大学数学与计算机科学学院,福州 350007)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-11-20 发布日期:2008-11-20

Stream Scheduling Algorithm of Providing Service Time Guarantees

HONG Zhong1,2 , TANG Yi-zhu1   

  1. (1. School of Mathematics and Computer Science, Fuzhou University, Fuzhou 350002;2. School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-11-20 Published:2008-11-20

摘要: 通过对现有流调度算法的研究,在NSTF算法基础上引入量化思想,提出一种新的多节目调度算法QNSTF。该算法以量化后的下次调度时间作为调度依据,使系统在效率和公平性之间取得较好的折中。仿真实验表明,QNSTF能减少用户平均等待时间,保持较低的用户请求撤销率与不公平性,同时向用户提供可靠的服务时间保证,提高了VoD系统的服务性能。

关键词: 流调度算法, 多节目调度, 服务时间保证

Abstract: Through the research on stream scheduling algorithms, the idea of quntization is introduced based on NSTF algorithm. A new algorithm called QNSTF is also proposed. This algorithm makes the quantized next schedule time as precondition, which makes a good balance between the efficiency and fairness. Simulation experimental result shows that QNSTF reduces the average waiting time while maintaining relatively low level in refusal radio and unfairness, and provides the customers with reliable service time guarantees. The algorithm improves the capability and performance of a VoD system.

Key words: stream scheduling algorithm, multi-program schedule, service time guarantees

中图分类号: