最大紧迫度优先的流媒体批调度算法  

The Maximum Urgency First Batching Algorithm for Streaming Media

作　　者：智英建[1] 王娜[1] 汪斌强[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《电子与信息学报》2008年第12期3018-3022,共5页Journal of Electronics & Information Technology

基　　金：国家973重点基础研究发展规划(2007CB307102)资助课题

摘　　要：批处理是一种简单有效的流媒体调度机制。通过把批处理调度归结为平均访问延迟最优化问题,得到影响批处理算法性能的关键因素。基于分析结果,本文提出一种最大紧迫度优先的批处理机制及其实现方案。紧迫度的定义考虑了等待队列的多个属性。一旦有空闲信道时,该机制选择具有最大紧迫度的视频队列进行服务。详细的仿真结果证明了所提方案的有效性和可行性。Batching is a simple but efficient scheduling mechanism for streaming media. An optimization model for average access delay is formulated to obtain the key aspects affecting the performance of Batching. Based on the analytical results, the maximum urgency first batching policy and its heuristic implementations are proposed. The definition of urgency considers multiple attributes of the waiting queue. Whenever a channel becomes available, the proposed policy schedules the video with the largest urgency value. The effectiveness and feasibility of the presented schemes are evaluated and justified experimentally using simulation.

关 键 词：流媒体 调度算法 紧迫度 批处理 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]