检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]武汉理工大学计算机学院
出 处:《计算机工程》2006年第3期28-30,46,共4页Computer Engineering
基 金:国家自然科学基金资助项目(60172035;90304018);湖北省自然科学基金资助项目(2004ABA014);湖北省教育厅重点科研基金资助项目(2003A002);武汉市重点科技攻关基金资助项目(20041001001)
摘 要:研讨了具有QoS约束的分布式多播路由问题。描述了一种适应于QoS多播路由的网络模型,提出了一种分布式QoS多播路由协议(DQMRP)。DQMRP只要求网络链路(或节点)的局部状态信息,不需要维护全局状态信息。DQMRP可有效地减少构造一棵多播树的开销,多播组成员能动态地加入/退出一个多播会晤,且不干扰现有的多播树。给出了DQMRP的正确性证明。仿真实验结果表明:DQMRP具有较低的控制信息开销和节点加入时延,较其它协议更适合于网络状态变化比较频繁的环境以及实时多媒体应用。This paper discusses the multicast routing problem with multiple QoS constraints, and describes a network model that is suitable to research such routing problem. It presents a distributed QoS multicast routing protocol (DQMRP). The DQMRP attempts to significantly reduce the overhead of constructing a multicast tree with QoS constraints. In DQMRP, a multicast group member can join or leave a multicast session dynamically, which should not disrupt the multicast tree. It also attempts to minimize overall cost of the tree, and satisfies the QoS constraints and the requirements of least cost. This paper gives the proof of correctness of the DQMRP, and evaluates the performance measures of the protocol using simulation. Analysis and simulations show that DQMRP is better than other protocols and is fitter for the network situations with the status changed frequently and the real-time multimedia applications. Control overhead and access latency can also be reduced greatly.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7