The Dependable Routing Rule in the Community Sensitive Distributed Routing Protocol for Peer-to-Peer Network
对等网络中基于团体的分布式路由协议中的可靠路由规则

Peer-to-Peer (P2P)employs distributed computing technology to achieve resource sharing directly between peers. P2P is also considered to be an alternative to distributed computing and is similar to Grid computing- The core of P2P is its naming approach and routing algorithm. So this paper will concentrate on analyzing and discussing this special aspect of P2P system. The routing architecture of the past and current P2P system can fall into two classes : un-structured and structured. The current routing protocol used in these popular P2P system is discussed. Then, this paper presents a community sensitive distributed routing protocol (CSDR)for P2P computing. Compared with other P2P routing and naming protocol. CSDR takes into account the application requirement. In CSDR, the P2P network consists of many locally dependent communities. Each peer belongs to at least one community. The peers which fall into more than one community is called multi-role peers (MP). Through these MP peers, the message can be routed among many communities. The overview of CSDR is addressed firstly. Then, its dependable routing rule (DRR) is also designed and analyzed. In DRR, the neighbor routing table (NT) is employed to achieve determination property, which allow request is delivered reliably.