%0 Journal Article
%T The Maximum Urgency First Batching Algorithm for Streaming Media<br>最大紧迫度优先的流媒体批调度算法
%A Zhi Ying-jian Wang Na Wang Bin-qiang
%A <br>智英建
%A 王娜
%A 汪斌强
%J 电子与信息学报
%D 2008
%I 
%X 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.
%K Streaming media
%K Scheduling algorithm
%K Urgency
%K Batching<br>流媒体
%K 调度算法
%K 紧迫度
%K 批处理
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=7B531EE3815134628FEEC18096D531ED&yid=67289AFF6305E306&vid=340AC2BF8E7AB4FD&iid=59906B3B2830C2C5&sid=D6A29273B6F10BE7&eid=809D5BCFD0938697&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=2&reference_num=12