满足延迟约束的加速加权分布式动态Multicast算法  

A Distributed Algorithm for Dynamic Multicast Satisfying Delay Bound Using Accelerated Weight

作　　者：黄传河[1] 陈莘萌[1] 贾小华[2] 张文涛[1] 

机构地区：[1]武汉大学计算机学院,武汉430072 [2]香港城市大学电脑科学系

出　　处：《计算机工程与应用》2002年第23期168-171,175,共5页Computer Engineering and Applications

摘　　要：在计算机网络中高效实现具有延迟约束的Multicast功能,是计算机网络应该提供的一种基本功能,是保证视频会议系统、多媒体教学系统、视频点播系统(VOD)等应用得以实现的基础。该文针对这一问题,提出了一种加速加权方法,根据已经经过的部分路径的延迟和剩余延迟,将成本加速加权,利用加权成本构造Multicast树。利用该算法,可以在计算机网络中以分布式方式建立接近最小成本、满足延迟约束条件、适于实时通信的动态Multicast连接,避免了传统方法将成本和延迟分别考虑、大量回溯的弊端。Efficient multicast functionality satisfying delay bound is fundamental to modern computer networks,especially for such applications as video conferencing systems ,multimedia education systems ,video on demand.This paper presents an accelerating weighted cost algorithm.It accelerates the increase of the weighted cost according to the accumulated delay on the passed path and the remained delay.It can find sub-optimal cost multicast tree meeting delay-constraint ,suitable for real-time and communications.It can dynamically modify the tree to adapt the changes of destinations.It also overcomes the shortcomings of the traditional algorithms which deal with the cost and delay separately and need a lot of retrospect.

关 键 词：延迟约束 加权 分布式动态Multicast算法 分布式算法 计算机网络 

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