基于自组织P2P实时应用的可扩展路由算法

Scalable routing algorithm of real time application based on self-organizing peer-to-peer network

为了提升自组织P2P实时应用中节点的路由效率,提出了基于MCC聚类模型的路由算法.通过通信节点的特征来组织虚拟的网络拓扑,并利用通信行为的特点来构造路由算法,有效地提升了特征值相似和经常通信节点间的路由效率.在MCC聚类模型中采用了多维的虚拟坐标系,支持多特征值的非精确路由方式,更适合自组织的通信应用.为兼容现有VoIP/IM系统,采用了改进的CAN算法来支持异构网络节点的融合.

To improve routing efficiency of real-time peer-to-peer application in self-organizing network, a routing algorithm based on MCC Model is presented. It can advance the routing efficiency between nodes with similar characters and frequency communication by organizing the associated nodes to construct virtual topology and the routing algorithm. Virtual multi-dimension reference frame is adapted in MCC Model, which supports non-exactly routing with multi-characters searching and is more suitable for the self-organized communication system. To work with existing VoIP/IM communication system, an improved CAN algorithm is put forward to permit those nodes of heterogeneous network to enter.