具有规模性的Anycast算法实现  

Realization of Anycast Algorithm with Scale

作　　者：张华健[1] 杨健[1] 

机构地区：[1]南京邮电大学物联网学院,江苏南京210003

出　　处：《计算机技术与发展》2013年第7期120-123,共4页Computer Technology and Development

基　　金：国家自然科学基金资助项目(60973139;61170065)

摘　　要：为了解决因在IPv6网络层中引入Anycast通信服务而引起的互联网中的路由器中路由表项的规模性问题,文中给出了利用Anycast单独路由和预先分配固定Anycast地址以及Anycast地址归并和拆分算法几项技术。通过理论分析这几种技术较好地解决了因为引入Anycast而引起的Unicast路由表的急剧扩大以及路由性能急剧下降的问题,较好地解决了Anycast实现中遇到的规模性问题并提供了灵活的选择标准。文中给出的相关技术能够解决当前IPv6网络中Anycast实现中遇到的规模性问题,为IPv6的应用建立了基础。In order to solve the scale question of the routing table entries in the router due to the Anycast communications services, give several technologies which use separate routing Anycast, pre introduction of IPv6 network layer allocate a fixed Anycast address and Anycast address merge and split algorithm to solve the scale question. Through theoretical analysis these technologies solve the question that Unicast＇ s router tables become big greatly and that the performance of routers declines greatly due to the introduction of Anycast. These technologies solve the scale question and gives flexible selection criteria. It gives several technologies which solve the scale question that appears in IPv6 network, and also establishes a foundation for IPv6.

关 键 词：ANYCAST IPV6 UNICAST 规模性 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]