面向应用的复制服务器动态组播选路算法  

Dynamic Application-Oriented Allocating Algorithm for Replicated Multicast Servers

作　　者：铁玲[1] 陈则盛[1] 诸鸿文[1] 

机构地区：[1]上海交通大学电子工程系,上海200030

出　　处：《上海交通大学学报》2001年第6期863-865,共3页Journal of Shanghai Jiaotong University

基　　金：上海邮电管理局 -上海交通大学联合通信技术实验室资助项目! (1999-1-1)

摘　　要：在组播选路树的代价函数中计入组播成员加入 /离开组播连接的概率 ,使得移动成员尽可能成为组播选路树的叶节点 ,并根据代价函数动态选择最小代价树 .仿真结果表明 ,该算法将能保证网络资源得以有效利用 .This paper proposed a new dynamic application-oriented multicast routing algorithm for replicated servers. It takes account of the probability that multicast members join or leave the multicast connection and adds into the cost function of the multicast routing tree. By doing so, the members are intended to be designed as the leaves of the multicast tree. According to the cost function, it can select the minimum cost function tree. The numeric simulation shows that the algorithm can use network resource efficiently.

关 键 词：复制服务器 动态选路 组播选路树 WWW 信息共享 代价函数 移动通信 

分 类 号：TN929.5[电子电信—通信与信息系统] TN915.01[电子电信—信息与通信工程]