Research On Improvement Of JXTA Network Routing Algorithm

In the P2P Network (Peer to Peer Network) research fields, JXTA always plays an important role. From the viewpoint of P2P Network structure and routing algorithm, this paper performs the following study on JXTA Network.First of all, this paper explains the current status of enormous P2P network number, the complex P2P network species and puts forward the issue that the steps of designing a P2P Web application is so complex. Aiming at these problems, JXTA provides a platform that includes all of the basic functions, and makes the P2P applications of different platforms communicate with each other, thus simplifies the design of P2P applications, and reduces the labor cost.Secondly, this paper makes a deep research on the JXTA routing strategy, states the weaknesses of JXTA routing strategy and the possible consequences. Aiming at these analyzed weaknesses, this paper puts forward a dynamic self-adaptive routing strategy that is applicable to JXTA environment, gives the algorithm flow chart and the accorded module implementation. According to the defect that JXTA Endpoint Routing Protocol will produce too many redundant packets, this algorithm put forward a strategy that the node will send a packet to a single neighbor node, could fully solve the problem that the original JXTA routing strategy may lead, and enhance the routing efficiency.At last, this paper exploits the Peersim and NS2network simulator to experiment on the original JXTA routing algorithm and the improved routing algorithm. Via the comparison of the original JXTA routing algorithm and the improved routing algorithm, this paper verifies the effectiveness of the improved algorithm.