Analyzing the P2P Traffic Using Probability Schemes

Peer to Peer network has become one of the most important areas while sharing the information in the global world. When we can share the information in the p2p network, traffic is the major problem. We can analyze the traffic theoretically which are associated with broadcasting. For theoretical analysis, we propose and evaluate the probability based schemes like Uniform Probability, Dropped Probability, Dropped Message, Triangle Based and Biased Forwarded to alleviate traffic load on broadcasting networks. Reducing redundant traffic is a natural approach to alleviate the high traffic problem without compromising the reachability of messages. Some of the schemes can significantly reduce the whole network traffic with little or no cost on reachability and latency of messages. And also we proposed the multi-backup routing method that makes use of redundant traffic to enable more search results to reach a searcher.