A comprehensive study of overlay construction strategies in BitTorrent
Date Issued
2011
Date
2011
Author(s)
Huang, Hsiu-Lin
Abstract
BitTorrent is one of the most important applications in the Internet. Some statistics have shown that it has accounted for more than 1/3 of the Internet bandwidth. Part of BitTorrent’s immense success may be attributed to its simple design, and the effectiveness of its peer choking and piece selection mechanisms for distributing large files over the Internet. As these mechanisms are to be performed on the application overlay, how the overlay is constructed and maintained is crucial to their performance.
In this paper we divide the overlay construction process into three stages: initial peer set selection, peer set update, and connection management, representing how a peer obtains an initial list of peers in the overlay, how it updates the list, and how it maintains its overlay links. In each stage, there are several design choices. For example, random selection or bandwidth match can be used to compose a peer list; a peer can update its peer list from its overlay neighbors or from a centralized tracker; and a peer may stick to a neighbor until their link is broken, or replace it when it sees a “better” peer. Besides, the size of the peer list, and whether a peer should be more aggressively using the list to establish neighbor connections, or passively waiting for other peers to establish connections also affect the overlay structure. In total, many combinations are possible to build and maintain an overlay. The purpose of the paper is to sort out them and find the key choices that help improve the performance.
Subjects
BitTorrent
Overlay construction strategy
Topology analysis
Performance analysis
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-100-R97725022-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):60fc8be6620a4ef2bf2db3b758d53afc