Skip to main content

Investigating and improving BitTorrent's piece and neighbor selection algorithms

Resource type
Thesis type
(Thesis) M.Sc.
Date created
2008
Authors/Contributors
Author (aut): Dale, Cameron
Abstract
In this thesis, we examine two important factors in the design of BitTorrent: how it chooses pieces and neighbors. We present a measurement study on the distribution and evolution of the pieces in BitTorrent, from data collected by multiple administered clients distributed in different parts of the network. Our results validate that the downloading policy of BitTorrent is effective, yet enhancements are still possible to achieve the ideal piece distribution. We also consider the topologies of multiple complex networks formed by neighbor selection in BitTorrent. Our results demonstrate that the networks exhibit fundamental differences during different stages of a swarm, and we discover the presence of a robust scale-free network in the network of peer unchokings. However, unlike previous studies, we find no evidence of persistent clustering in any of the networks. We therefore present a first attempt to introduce clustering, and verify its effectiveness through simulations and experiments.
Document
Copyright statement
Copyright is held by the author.
Permissions
The author has not granted permission for the file to be printed nor for the text to be copied and pasted. If you would like a printable copy of this thesis, please contact summit-permissions@sfu.ca.
Scholarly level
Language
English
Member of collection
Download file Size
etd4073.pdf 7.49 MB

Views & downloads - as of June 2023

Views: 0
Downloads: 0