检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华东师范大学计算机科学技术系,上海200062
出 处:《计算机应用与软件》2008年第9期220-223,共4页Computer Applications and Software
摘 要:提出了一种在现有的Internet环境下,以满足实时性应用需求为目标的应用层组播协议。该协议使所有参加组播的端系统自组织成一棵拓扑树,比较选择网络链路好、延迟小的节点作为转发分枝,尽可能降低网络延迟,提高带宽利用率。该协议面向单源的实时应用,在传输层采用TCP协议传输信令和UDP协议传输数据,并设计自适应的缓冲区管理,以提高实时性能。给出了该协议的主要算法和实现模型。An application layer muhicast protocol is presented,which satisfies the requirement of real-time work in the existing Internet environment. The end-systems attending the muhicast are made to form a topological tree. The tree chooses the nodes which have better state of network and less delay as its branches for transmission, in order to reduce the delay of the whole network and increase the utilization rate of bandwidth. This protocol is used for real-time transmission of single source. The self-adaptive buffer management is designed to improve the ability of real-time transmission. The major algorithms and the implementation module of this protocol are described.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.40