P2p Network Security Credibility Based On Service Quality Optimization Algorithm Research

In recent years, with the development of P2P network technology, various newnetwork techniques are emerging. At the same time, network security becomes veryimportant.One research area is to employ the diversity of P2P network nodes to search forforwarding path, hence insuring the service quality that might be impaired by networkconfigurations. Another important issue in P2P credit mechanism is that, when lookingfor forwarding path, the effective way a node processes the feedback from other nodesand picks the one to exchange information. In literature, several algorithms on how topick nodes have been proposed. However, most of them have considered the credit ofthe final service node, rather than intermediate nodes. Given such a large distributionscale, the convergence becomes fairly slow and the algorithm computing-expensive.There hasn’t been much efforts in forwarding mechanisms in existing P2P systems.The existing forwarding path searching methods deal with simple factors; the qualitiesare in question; and the algorithms are not effective enough. Consider this situation, weare proposing to introduce Ant Colony Algorithm to the current credit model. Doubletrust model is used here, as the behaviors of both of the final service node and theintermediate nodes are taken into consideration. In addition, for each node, we evaluateit service quality from different angles. Looping the Ant Colony Algorithm severaltimes, we obtain a set of independent path candidates and further pick the optimal oneto the target node. The new method is more effective compared to existing ones, andcould prevent malicious nodes from fraud at some extent. The work is based onNetwork Simlator2.