对等网自适应寻径协议的设计与实现

Peer to Peer Adaptive Routing Protocol Design and Implementation

为了保证计算机网络对抗中的两个网络对抗体之间在短时间内以较小的开销建立会话连接，需要对抗体间以动态的方式去寻址来适应网络的变化。通过对网络对抗、对等网络和蚁群算法的研究分析提出了本文的基于蚁群算法的对等网络自适应寻径协议AARP，描述蚁群在对等网络中自适应的克隆、寻径过程。仿真结果表明，AARP在对抗体间通信中可以做到减小寻址开销，降低寻址延迟。

To ensure the computer network confrontation between the two networks on the antibody to a smaller cost in a short time to establish a session connection between the need for antibodies to address the dynamic ways to adapt network changes.Confrontation through the network,peer to peer and ant colony algorithm analysis presented in this paper on the ant colony algorithm based on adaptive network routing protocols such as AARP, describes the colony in the adaptive network,such as cloning,the process of routing.The results show that,AARP in communication between the antibody can be reduced address overhead,reduce addressing delay.