Randomness betters nearest-rarest in the P2P clustering networks

Authors:
Jia Cao;Hongxiao Zheng;Jinsheng Yuan
Affiliations:
Information Institute, Beijing Forestry University, Beijing, China;North China Electric Power University, Beijing, China;Information Institute, Beijing Forestry University, Beijing, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 3
Cited 1

IDMaps: a global internet host distance estimation service

IEEE/ACM Transactions on Networking (TON)
Rarest first and choke algorithms are enough

Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
A workload characterization study of the 1998 World Cup Web site

IEEE Network: The Magazine of Global Internetworking

An efficient geo-aware peer-to-peer resource discovery and sharing scheme in vehicular ad-hoc networks

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is crucial for P2P applications to control their traffics for saving the Internet bandwidth. During the P2P communication, if peers tend to share the data with near peers, the Internet traffic can be reduced. Thus the topology of the P2P networks will be clustering. In this article, we study downloading strategies for the living P2P applications with clustering topology. First, we combine two popular downloading strategies: rarest-first and nearest-first. But, there are too many peers always share very few rarest-pieces owned by few peers, so the conflicts happen which will arouse the Internet traffics. We find the randomness policy can better the method by the follows: any peer will request few random pieces from the far neighbors. The goodness is that the near peers will have more rarest-pieces to download. Though such a manipulation produces little additional Internet traffic for a short period, it will decrease the traffic in the long run. The results of our experiments manifest the result and also show that the improved method doesn't deteriorate the downloading speed.