有/无线ATM网的组播选路算法  

A multicast routing algorithm for wired/wireless ATM networks

作　　者：王捷[1] 李乐民[1] 

机构地区：[1]电子科技大学,四川成都610054

出　　处：《通信学报》2000年第2期49-54,共6页Journal on Communications

摘　　要：本文提出一种组播选路算法 ,在组播连接路由树的代价函数中计入了移动成员的越区切换发生概率 ,使为移动成员服务的接入节点 (AP)尽可能成为组播路由树的树叶节点。当移动成员发生越区切换以后 ,可减去原来为之服务的AP和相应的树枝通道链路 ,从而保证了网络资源得以有效地利用。数值模拟分析的结果表明 ,我们提出的算法达到了这一目的。In this paper,we give an algorithm of multicast routing.We take account the handoff probability of the multicast members into the cost function of the multicast routing tree.By doing so,the access points(APs) which serve the mobile members are intended to be designed as the leaves of the multicast tree.After the handoff of an mobile member,we can cut down the AP which served the mobile member before the handoff,we also can cut down the tree branch associating with the AP.So the network resource can be used efficiently.The numeric simulation shows that the algorithm achieves this object.

关 键 词：ATM网 组播 选路算法 

分 类 号：TN913.24[电子电信—通信与信息系统]