IPv6中利用多播树解决Anycast扩展局限性  

Solving Anycast Scalability with Multicast Tree in IPv6

作　　者：王晓喃[1,2] 唐振民[2] 

机构地区：[1]常熟理工学院,常熟215500 [2]南京理工大学,南京210094

出　　处：《计算机科学》2008年第12期90-93,共4页Computer Science

基　　金：国防科工委应用基础资金资助项目(JI300D004);部委预研课题(课题编号:51316080101);南京理工大学研究生创新基金(2007060005)

摘　　要：提出了一种利用多播树实现Anycast服务的一种通信模型,此模型实现了Anycast组成员的动态加入与离开,从真正意义上解决了Anycast现存的扩展性问题,同时此模型实现了Anycast树自身信息与请求的分布式维护与处理,从而实现了均衡负载功能。深入分析和讨论了该模型的可行性及其有效性。在IPv6模拟环境下,实验数据表明通过本模型获取Anycast服务(比如文件下载服务)的TRT值要比现有的Anycast通信模型下获取同样服务的TRT值缩短很多,服务质量也有明显提高。A new kind of Anycast communication model was proposed on the basis of multicast tree technology. Since this model achieves dynamic Anycast group, it allows Anycast members to freely leave and join Anycast group, it radically solves the existing scalability problerrL In addition, this model accomplishes the distributed maintenance and transaction of Anycast service request and the information on Anycast tree so it fulfills the load balance. Deeply analyzed and discussed the feasibility and validity of this communication model,and the experimental data in IPv6 simulation demonstrated that the TRT of one Anycast service（for example, file downloading） acquired through this communication model is shorter than the one through the current communication model.

关 键 词：IPV6 ANYCAST 树 节点 多播 

分 类 号：TP393.03[自动化与计算机技术—计算机应用技术] TN915.04[自动化与计算机技术—计算机科学与技术]