Self-Balanced and Self-Adaptive Routes in Unstructured P2P Networks
Self-Balanced and Self-Adaptive Routes in Unstructured P2P Networks
复制标题
DOI：
10.1109/icons.2007.49
复制
发表时间：
2007-04
期刊：
影响因子：
--
通讯作者：
M. Rojas;H. Unger;H. Coltzauhauke
中科院分区：
文献类型：
--
作者：
M. Rojas;H. Unger;H. Coltzauhauke
提出了一种基于类蚂蚁代理的非结构化P2P网络路由和负载均衡策略。在[Unger，Wulff]中，作者提出了一种算法，该算法能够在P2P网络之上构建排序结构，以支持在此类系统中进行搜索并减少维护时间。基于这种结构，路由机制，允许用户在有限的时间内发送两个对等点之间的消息将提供目前的工作采用蚂蚁系统介绍Dorigo，Maniezzo和Colorini，并寻找替代路径附近的最优路由的情况下，拥塞条件。尽管蚂蚁网络利用协作行为并签署最近的路径，但也有可能使源节点和目标节点之间的通信信道迅速饱和。因此，也考虑负载平衡标准。
A simple strategy for routing and load balancing in unstructured P2P network based on ant-like agents is presented. In [Unger, Wulff], the authors present an algorithm, which enables to build a sorted structure on top of a P2P Network in order to support searching in such systems and to reduce maintenance times. Based on this structure, a routing mechanism that allows the user to send messages between two peers in finite time will be provided The current work adopts ant systems as introduced by Dorigo, Maniezzo and Colorini and looks for alternative paths near to the optimal route in case of congestion conditions. Although ANTs take advantage of collaborative behavior and sign the closest paths, it is also possible to rapidly saturate the communication channels between source and target nodes. Therefore, a load balancing criterion is considered, as well.