Comparison of piece-based file sharing schemes over a peer-to-peer network in a heterogeneous network environment

Authors:
Jenq-Shiou Leu;Ming-Hung Huang
Affiliations:
Department of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan;Department of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 7
Cited 0

Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Making gnutella-like P2P systems scalable

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling and performance analysis of BitTorrent-like peer-to-peer networks

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
P2P file sharing analysis for a better performance

Proceedings of the 28th international conference on Software engineering
Efficient file search in non-DHT P2P networks

Computer Communications
Minimizing file download time in stochastic peer-to-peer networks

IEEE/ACM Transactions on Networking (TON)
Performance comparison of scheduling algorithms for peer-to-peer collaborative file distribution

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Without considering the controversial issue such as copyright, file sharing is the most popular application in a Peer-to-Peer (P2P) network. Piece-based file sharing is an intuitive way to speed up the sharing process in a P2P network, such as the BT P2P network, and Rarest Piece First (RPF) is the most common way to distribute file pieces. As heterogeneous networks have been fast developing, the transmission conditions among nodes therefore become diversified. In the past, few studies had ever been made about how to more efficiently distribute the file pieces based on the transmission conditions among nodes. In the study, we propose two improved algorithms - (a) RPF with a Shortest Transmission Time (STT) requesting node first and (b) a STT requesting node first with RPF to solve this problem. The simulation results show that our proposed schemes can perform better than RPF in a heterogeneous network environment.