Adaptive Search Radius - Using hop count to reduce P2P traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Peer-to-Peer (P2P) software as major Internet applications bring convenience and pleasure to users, while become a nightmare of Internet Service Providers (ISPs) because they produce huge traffic on network. The enormous traffic come from the fact that when P2P systems construct overlay networks, they ignore the underlying network topology, so most of the connections are between remote peers and most of the traffic are cross-network traffic. To overcome this, we present a simple mechanism named LHF (Least Hops First) to construct overlay network mostly with nearby peers. With analysis we show that P2P network constructed by LHF is “small world” network, in which most of the connections are local ones, while a few remote connections accelerate the system dramatically. Simulation experiments demonstrate that LHF can decrease cross-network traffic remarkably, and can improve the performance of P2P application at the same time.