摘要
为了减少组播树共享算法(TS-MCAST)产生冗余包,有效地利用链路网络带宽,提出了一种基于光突发交换(OBS)网络的最少冗余包的组播树共享算法(LRP-MCAST-TS)。该算法实现过程中,引入了树分割规则,将满足分割条件的组播树分割成森林,然后根据重叠大小将汇聚的组播会话划分成多个组播共享类。通过理论分析,证明了LRP-MCAST-TS算法设计的正确性,达到了减少冗余包的目的。
In order to reduce redundant packets due to the TS-MCAST algorithm and effectively utilize link band width, a multicast algorithm based on OBS networks is proposed, called least redundant packets multicast tree sharing (LRP MCAST-TS) algorithm. In the implementation process of this algorithm, the tree partition rule is introduced. The multicast trees are firstly partitioned to forest and then classified into muhicast sharing class(MSC)by overlap degree. Finally, through theoretical analysis, it is verified the validity of LRP MCAST-TS algorithm and shows that it could reduce the number of redundant packets.
出处
《重庆邮电大学学报(自然科学版)》
2007年第1期100-104,共5页
Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基金
国家自然科学基金项目(90304004)
国家教育部新世纪优秀人才支持计划(教技司[2005]2号)
重庆市科委项目(2005BB2062
2005AC2089)
重庆市教委项目(KJ060508
KJ060513)
重庆邮电大学通信学院青年基金资助。