![]() |
CiteULike | ![]() |
khpoo's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Missing Piece Issue and Upload Strategies in Flashcrowds and P2P-assisted Filesharingby: F. Mathieu, J. Reynier
Telecommunications, 2006. AICT-ICIW '06. International Conference on Internet and Web Applications and Services/Advanced International Conference on (2006), pp. 112-112.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractPeer-to-peer networks provide better scalability for the filesharing applications they underlie. Unlike traditional server-based approach such as FTP, maintaining a constant QoS with a fixed number of servers seems feasible, whatever the number of peers involved. However, a P2P filesharing network sometimes happens to saturate, notably in a semi-P2P filesharing architecture or during flashcrowds phase, and scalability may fail. Even "smart" networks can encounter the whole file but one piece downloaded case, which we call starvation. We suggest a simple and versatile filesharing model. It applies to all pieces-oriented filesharing protocols used in softwares such as MlDonkey or BitTorrent. Simulations of this model show that starvation may occur even during flashcrowds. We propose a theoretical explanation for the so-called starvation phenomenum.
BibTeX record
RIS record