|
Title:
|
ANALYSIS OF FLASH MOBS IN BITTORRENT |
|
Author(s):
|
Daniel J. Garrison |
|
ISBN:
|
972-8924-02-X |
|
Editors:
|
Pedro Isaías and Miguel Baptista Nunes |
|
Year:
|
2005 |
|
Edition:
|
1 |
|
Keywords:
|
Peer-to-Peer Networks, Flash Crowds, Game Theory, Scalability, Decentralization, Content Distribution. |
|
Type:
|
Full Paper |
|
First Page:
|
219 |
|
Last Page:
|
227 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Traditional client/server architectures can deliver high performance if certain configurations are used. Performance quickly deteriorates as the active client base increases unless expensive methods are introduced to scale the system. Research and deployment in the area of peer-to-peer architectures have been engaged in order to address this expense and other problems in traditional architectures (Castro, 2003). BitTorrent is one peer-to-peer architecture that was developed to overcome the mentioned performance deterioration in the file distribution area. It allows peers to participate as servers in the delivery of files while minimizing the need for centralized resources. As no centralized server is used, the initial propagation of the file is determined by how rapidly the file can be replicated in the BitTorrent network. Scalability is determined by how well its algorithms can coordinate and aggregate the resources of peers under heavy loads. A number of measurements were used to assess the performance of the algorithms used in BitTorrent while experiencing a flash mob. The analysis shows that in contrast to traditional client/server architectures, initial flash mobs are not only handled well but encouraged in the BitTorrent environment. |
|
|
|
|
|
|
