检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学计算中心,沈阳110004 [2]东北大学信息科学与工程学院,沈阳110004 [3]东北大学软件中心,沈阳110004
出 处:《计算机学报》2001年第8期838-844,共7页Chinese Journal of Computers
基 金:国家自然科学基金 (6 0 0 0 30 0 6 );教育部现代远程教育关键技术研究重点项目资助
摘 要:路由选择机制是分布式多媒体系统中的重要研究方向 .其中 ,基于服务质量的多媒体通信目的节点加入与退出算法是关键组成部分 .该文在基于服务质量的多媒体通信初始路由建立算法的基础上 ,基于资源共享原则 ,提出支持成员动态加入与退出多媒体组通信的目的节点加入与退出算法 ,以增加使用费用最小为目标在满足服务质量约束的条件下完成目的节点加入 ,在不影响多媒体组通信服务质量的前提下 ,在完成目的节点退出的同时最大限度地释放已占用资源 .文中还探讨了这些算法的有效性 .它们和基于服务质量的多媒体通信初始路由建立算法相结合 ,可以提供对分布式多媒体组应用服务质量保证的支持 .QoS(Quality of Service) Routing mechanisms are important research directions in distributed multimedia systems. For multimedia dynamic group communication, routing mechanisms should support the solving of the following three problems: QoS based initial route setup, QoS based group member joining, and QoS based group member leaving. In this paper, with the support of the QoS based initial route setup algorithms, based on resource sharing principles, QoS based destination node joining and leaving algorithms are presented. The key ideas of the proposed QoS based destination node joining algorithm are as follows: under certain constrains and with resource sharing principles obeyed, finding a minimum incremental usage cost path from the source node to the newly joined destination node, at the same time, leading to the optimal resource (such as CPU, buffer, bandwidth) utility and guaranteeing end to end delay and end to end error rate requirements to the maximum degree. It can be called as source node initiated one pass destination node joining algorithm. In addition, it can avoid loop occurrence along the route when new destination nodes joining. The main idea of the proposed QoS based destination node leaving algorithm is as follows: with multimedia dynamic group communication QoS unaffected, trying to release the occupied resources(such as CPU, buffer, bandwidth) by the group along the route to the maximum degree as the destination node leaving from the group. Thus, it can improve the network resource utilization. The correctness of two proposed algorithms is also discussed. Simulation results show that they are effective and efficient. Combined with the QoS based initial route setup algorithms and with the help of other QoS control mechanisms (such as resource reservation, admission control, QoS accounting and QoS negotiation, etc), the QoS guarantees for distributed multimedia group applications could be supported by these proposed algorithms.
关 键 词:服务质量 路由选择 多媒体通信 组通信 目的节点退出算法
分 类 号:TN919.8[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145