On the impact of seed scheduling in peer-to-peer networks

Esposito, Flavio; Matta, Ibrahim; Bera, Debajyoti; Michiardi, Pietro

doi:10.1016/j.comnet.2011.06.020

Cited by 8 publications

(17 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, providing all the nodes in the system with this kind of information is not feasible in practice. Furthermore, the bandwidth allocation problem in BitTorrent-like systems has been shown to be NP-hard [4].…”

Section: A Flashcrowd Detectionmentioning

confidence: 99%

“…Esposito et al [4] recognize the seeders to be the major bottlenecks in BitTorrent systems under flashcrowds and propose a new class of scheduling algorithms at the seeders in order reduce peer download times. However, none of these previous works analyzes the case of P2P VoD applications.…”

Section: Related Workmentioning

confidence: 99%

“…Firstly, their piece allocation strategy is a crucial aspect during flashcrowd, as seeders are the only interesting peers in that phase (all other peers have few or no pieces yet). Secondly, the complete bandwidth allocation problem in a BitTorrentlike system is NP-hard [4].…”

Section: Seeders' Piece Allocation Analysismentioning

confidence: 99%

“…(ii) how can bandwidth allocation be made more effective in enhancing peer QoS during flashcrowd? With respect to the second research question, we have especially investigated the role of the seeders, as they represent the major bottleneck when bandwidth is scarce [2], [4].…”

Section: Introductionmentioning

confidence: 99%

“…Despite the relevance of the problem, to date only a few research efforts have investigated P2P systems under flashcrowds and they mainly address file-sharing and live streaming applications (see [4], [5]). However, the analysis presented in [16] shows that flashcrowds affect P2P VoD systems as well.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Bandwidth allocation in BitTorrent-like VoD systems under flashcrowds

D'Acunto

Vinkó

Sips

2011

2011 IEEE International Conference on Peer-to-Peer Computing

View full text Add to dashboard Cite

Abstract-The efficiency of BitTorrent in content distribution has inspired a number of peer-to-peer (P2P) protocols for ondemand video (VoD) streaming systems (henceforth BitTorrentlike VoD systems). However, the fundamental quality-of-service (QoS) requirements of VoD (i.e. providing peers with a smooth playback continuity and a short startup delay) make the design of these systems more challenging than normal file-sharing systems. In particular, the bandwidth allocation strategy is an important aspect in the design of BitTorrent-like VoD systems, which becomes even more crucial in a scenario where a large number of peers joins in a short period of time, a phenomenon known as flashcrowd. In fact, the new joining peers all demand for content while having few or no pieces of content to offer in return yet. An unwise allocation of the limited bandwidth actually available during this phase may cause peers to experience poor QoS.In this work, we analyze the effects of a flashcrowd on the scalability of a BitTorrent-like VoD system and propose a number of mechanisms to make the bandwidth allocation in this phase more effective. In particular, we derive an upper bound for the number of peers that can be admitted in the system over time and we find that there is a trade-off between having the seeders minimize the upload of pieces already injected recently and high peer QoS. Based on the insights gained from our analysis, we devise some flashcrowd-handling algorithms for the allocation of peer bandwidth to improve peer QoS during flashcrowd. We validate the effectiveness of our proposals by means of extensive simulations.

show abstract

Section: A Flashcrowd Detectionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Seeders' Piece Allocation Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Bandwidth allocation in BitTorrent-like VoD systems under flashcrowds

D'Acunto

Vinkó

Sips

2011

2011 IEEE International Conference on Peer-to-Peer Computing

View full text Add to dashboard Cite

show abstract

BSU: A Biased Seed Unchoking Algorithm for P2P Systems

Wei

Zhang

Jiang³

et al. 2012

Internet and Distributed Computing Systems

View full text Add to dashboard Cite

An autonomic approach for P2P/cloud collaborative environments

Amoretti

Grazioli

Zanichelli

2015

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

The rise of Cloud Computing has progressively dimmed the interest in volunteer and peer-to-peer computing, in general. However, efficient and cost-effective large scale distributed collaborative environments cannot be achieved leveraging upon the Cloud alone. In this paper, we propose a novel hybrid P2P/cloud approach where components and protocols are autonomically configured according to specific target goals, such as cost-effectiveness, reliability and availability. The proposed approach is based on the Networked Autonomic Machine (NAM) framework, which allows distributed system designers to include different kinds of cost and performance constraints. As an example, we show how the NAM-based approach can be used to design collaborative storage systems, enabling the definition of an autonomic policy to decide, according to cost minimization and data availability goals, how to part data chunks among peer nodes and Cloud, based on the local perception of the P2P network.

show abstract

On the impact of seed scheduling in peer-to-peer networks

Cited by 8 publications

References 27 publications

Bandwidth allocation in BitTorrent-like VoD systems under flashcrowds

Bandwidth allocation in BitTorrent-like VoD systems under flashcrowds

BSU: A Biased Seed Unchoking Algorithm for P2P Systems

An autonomic approach for P2P/cloud collaborative environments

Contact Info

Product

Resources

About