在超立方互联网络中实现anycast通信模式的算法分析

Anycast是网络中一种新的通信方式，是IPv6的一个新特性．它要求数据包被路由到具有相同Anycast地址的一组网络节点中距离用户“最近”的一个节点．通过对anycast这一新型通信模式研究发现，Anycast通信的应用空间非常广阔，不仅可以满足大量地理位置分散的用户的需要，而且在互联网络中也有重要的应用．因此，anycast被引入到互联网络中，提出在超立方互联网络结构中实现anycast通信的有效算法，并对该算法的效率进行分析，结果表明该算法需O（3n-2k＋2）个时间步即可实现anycast通信．通过模拟实验，得到在某一超立方互联网络中实现anycast通信时链路缓冲区个数与丢包率间的关系，为网络设计提供理论指导；同时，通过对比实验结果得到，在超立方互联网络中引入anycast通信能够有效地提高网络性能．

Routing Algorithm for Anycast Communication in the Hypercube

Anycast is a new communication mode in the networks.It is a new characteristic of IPv6.An anycast message is the one that should be delivered to the 'nearest'member in a group of designated recipients.Through the study of anycast, it can be find that anycast has numerous potential applications and it not only has the ability to meet the demands of a large number of geographically wide-spread users but also has important applications in the interconnection networks. So, anycast is introduced into the interconnection.An effective algorithm was proposed to implement the anycast communication in a familiar interconnection network-Hypercube.The efficiency of the algorithm is analyzed.It need O(3n-2k+2) steps to implement anycast communication.By simulative experiment,the relationship between the number of link buffer and the ratio of losing data packets to implement anycast in hypercube is obtained.It will provide the theoretical guidance for designing networks. At the same time, through comparing the result of simulations, it is obtained that introducing anycast into hypercube will improve the performance of the network.