Bandwidth Preservation Tree Peer to Peer Algorithm

M.A. Mikki and M.R. Al-Khoudary (Palestine)

Keywords

Peer to peer networks, Rarest first algorithm, Torrent, Client-server computing, File downloading

Abstract

As the network bandwidth increases due to technology advancement, the need for downloading and uploading mechanisms at high rates increases too. Media and files around the world are being shared using many technologies including peer to peer and file servers. In this paper we develop a Bandwidth Preservation Tree (BPT) peer to peer algorithm which is an alternative algorithm to Rarest First algorithm in Bit torrent peer to peer technology. BPT algorithm uses a bandwidth Preservation Tree to force peers to download missing blocks of rare media file from their parents only. In BPT, the upload speed (bandwidth) of the parent is equal to the total download speeds (bandwidths) of the children. This enables peers to download missing blocks from their parents with their maximum speed, and guarantees that the parent peers are not overwhelmed by too many download requests. To validate the proposed BPT algorithm we built a simulator for both Rarest First algorithm and BPT algorithm. We measured the time it takes peers to download a full copy of a rare media under different circumstances including varying number of peers in the network, varying number of level 1 peers in the bandwidth preservation tree, and varying rare media file size. Results show that BPT approach produces complete copies of the rare media file in peers faster than Rarest First algorithm.

Important Links:

Go Back