首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Core Placement Algorithm for Multicast Routing with QoS Requirements
作者姓名:王明中  Xie Jianying
作者单位:[1]ResearchGroupofControlEngineeringandNetworkTechnology,ShanghaiJiaotongUniversity,Shanghai200030,P.R.China [2]ResearchGroupofControlEngineeringandNetworkTechnology,ShanghaiJiaotongUniversity,Shanghai20003
摘    要:Differing from the source-oriented algorithms,the Core-Based Tree(CBT) multicast routing architecture establishes a single shared tree for multiple connections on a multicast group.Which results in higher ration of network resources utilization.In alluding to the problem of Core Placement,we propose a simple method(QOCP) to locate an optimal core node,which can minimize the multicast delay and inter-destination delay variation simultaneously.The simulation results show that our method is very effective,and outperforms the other algorithms studied in this paper.

关 键 词:通信  核心布局算法  QoS要求

Core Placement Algorithm for Multicast Routing with QoS Requirements
Xie Jianying.Core Placement Algorithm for Multicast Routing with QoS Requirements[J].High Technology Letters,2002,8(2):43-46.
Authors:Xie Jianying
Abstract:Differing from the source-oriented algorithms, the Core-Based Tree (CBT) multicast routing architecture establishes a single shared tree for multiple connections on a multicast group, which results in higher ratio of network resources utilization. In alluding to the problem of Core Placement, we propose a simple method (QOCP) to locate an optimal core node, which can minimize the multicast delay and inter-destination delay variation simultaneously. The simulation results show that our method is very effective, and outperforms the other algorithms studied in this paper.
Keywords:CBT multicast routing  core placement  delay  inter-destination delay variation
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号