Research Of P2P Routing Based On XMPP

The P2P(Peer-to-Peer) has been a popular technology of network applications,It has achieved great successes in file sharing, distributed calculation, distributed storage and so on. Generally, P2P network nodes communicate with each other through private message format,makes P2P software poor interoperability and compatibility.the existing IM systems adopt a opening standard for Instant Messaging,but most are based on the client/server model ,would not be able to upgrade on time,or even have sever blocked or collapsed. So the integration between P2P network model and instant communication protocol is very meaningful.As P2P network nodes are equity and dynamic, as well as the diversity and complexity of its system, there are quite different between P2P service model and traditional client/server model.so P2P network routing technology has been a hot P2P application.At present, P2P softwares are mutual isolating, poor communication collaboration between network nodes.To address this issue, adopts XMPP(Extensible Messaging and Presence Protocol) based on an XML-based data flow to communicate with softwares. and provides a uniform standard for P2P network routing .Summarizes the core content of XMPP and P2P network structure, Research for the framework of instant messaging and online state.The DHT has four typical algorithms: Pastry, Tapestry, CAN, Chord.With the example of Chord, P2P network routing algorithms based on XMPP are researched.The simulation system is designed and implemented with .NET development environment. As an exmple of Database sharing in Network, discuss node discoverying, inserting, finding, and leaving.