一种适用于移动网络的低代价动态多播路由算法  

A Low-cost Dynamic Multicast Routing Algorithm for Mobile Networks

作　　者：张建明[1] 顾乃杰[1] 

机构地区：[1]中国科学技术大学计算机科学与技术系,合肥230027

出　　处：《计算机工程与应用》2006年第13期139-141,148,共4页Computer Engineering and Applications

基　　金：安徽省自然科学基金资助项目(编号:03042210)

摘　　要：多播由于能够有效地利用网络资源并减轻服务器的负担因而受到广泛关注,但在移动网络环境中,由于多播组成员的位置可以动态改变,已有的动态多播算法不能获得较好的性能。论文提出了一种适用于移动网络的动态多播路由算法,该算法为目的节点建立最短多播路径时采用了结合链路代价和多播目的节点数的平摊代价函数,以便构建出的多播树在整个通信过程中平均总代价较小。模拟实验结果表明论文提出的算法所构建的多播树的平均总代价要低于其它动态算法。Muhicast has gained much attention in recent years because it can efficiently utilize network resouce and reduce the load at application servers.However,all existing dynamic multicast algorithms perform poorly in mobile networks,in which group members can dynamically change their location.This paper presents a dynamic muhicast routing algorithms for mobile networks.When establishing shortest path for destinations,this algorithm adopts an amortized-cost function that combines link cost and population of group members,so that the mean total-cost of constructed muhicast tree is minimum during the whole communication.The results of simulation show that the proposed algorithm constructs multicast tree with less mean total-cost than other dynamic algorithms.

关 键 词：多播路由 移动网络 动态多播 多播树 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]