检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京航空航天大学计算机学院,北京100083
出 处:《计算机工程与应用》2003年第33期5-7,共3页Computer Engineering and Applications
基 金:国家航天科技创新基金资助项目
摘 要:提出在目前IP网络设备及技术基础上,一种在通信子网外优化多媒体表现质量的源端最小延迟表现算法。给出并证明了分布式多媒体应用同步表现最优化定理,进而提出最小聚类延迟表现算法作为源端最小延迟表现控制算法的改进。与古典列表调度算法比较得出,上述两种算法能实现优化的分布式多媒体同步表现,同时在目的端缓冲区需求、溢出可能性等方面具有更优的性能。上述算法与底层通信机制无关,未来具有广阔的发展及应用前景。The MDPA( mi nimal delay presentation algorithm)performed out of the communication subnet i s brought forward to guarantee that every synchronization interval unit(SIU)a rrives at the destination buffer as near to the present time as possible.Then a theorem about the optimization of multimedia synchronization presentation is put forward and demonstrated.On the basis of the optimization theorem,an imp roved algorithm named MCDPA(minimal cluster delay presentation algorithm)is pr esented.Theoretical analysis shows that the essential buffer capacity for dest ination of these two algorithms is fewer than that of the classical list sched uling algorithm and the overflow probability of the SIU's caused by the two alg orithms is fewer than that of the classical list scheduling algorithm.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222