Analyzing Peer Selection Policies for BitTorrent Multimedia On-Demand Streaming Systems in Internet

Rodrigues, Carlo Kleber da Silva

doi:10.5121/ijcnc.2014.6114

Cited by 4 publications

(20 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Basis Of a Bittorrent Systemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…By default, the protocol specifies that a peer may have a minimum of 20 and a maximum of 80 connected remote peers. Only 40 connection invitations may be though sent by the user, opening space for him to accept 40 more invitations sent by other peers [8].When a peer finishes his download (i.e., he has all the pieces of the content being distributed) he changes from leecher state to seeder state. The leecher's role is to receive content while, at the same time, he contributes with his own resources to the swarm.…”

mentioning

confidence: 99%

“…Plenty of practical P2P approaches, like the BitTorrent protocol [6], have been successful in the past years. In fact, the great efficiency achieved by BitTorrent for the distribution of large amounts of data inspired its adoption for on-demand video streaming [7][8][9].Peer-Selection Policy is the term assigned to one of the core concepts of BitTorrent. By stimulating direct reciprocity and cooperation, its design specifies who makes use of the uplink capacity from all the peers inside the swarm (i.e., a group of peers downloading a same content).…”

mentioning

confidence: 99%

See 3 more Smart Citations

Improving BitTorrent's Peer Selection for Multimedia Content On-Demand Delivery

Streit¹,

Rodrigues²

2015

IJCNC

View full text Add to dashboard Cite

The great efficiency achieved by the BitTorrent protocol for the distribution of large amounts of data inspired its adoption to provide multimedia content on-demand delivery over the Internet. As it is not designed for this purpose, some adjustments have been proposed in order to meet the related QoS requirements like low startup delay and smooth playback continuity. Accordingly, this paper introduces a BitTorrent-like proposal named as Quota-Based Peer Selection (QBPS). This proposal is mainly based on the adaptation of the original peer-selection policy of the BitTorrent protocol. Its validation is achieved by means of simulations and competitive analysis. The final results show that QBPS outperforms other recent proposals of the literature. For instance, it achieves a throughput optimization of up to 48.0% in lowprovision capacity scenarios where users are very interactive. KEYWORDSBitTorrent, Multimedia, Streaming, Video on Demand, Interactivity. 1.INTRODUCTIONThe fast growth of companies dedicated to provide multimedia content on-demand motivated studies focusing on maximizing the end-user experience. One potential solution identified by researchers (e.g., [1][2][3][4][5]) is the application of a Peer-to-Peer (P2P) network architecture to supply the demand for high-quality content distribution.The leading purpose of the above solution is to take advantage of the resources available at the edge of the network, addressing significant or even total autonomy from central servers. Plenty of practical P2P approaches, like the BitTorrent protocol [6], have been successful in the past years. In fact, the great efficiency achieved by BitTorrent for the distribution of large amounts of data inspired its adoption for on-demand video streaming [7][8][9].Peer-Selection Policy is the term assigned to one of the core concepts of BitTorrent. By stimulating direct reciprocity and cooperation, its design specifies who makes use of the uplink capacity from all the peers inside the swarm (i.e., a group of peers downloading a same content). One observed outcome of this policy is that in a heterogeneous system, i.e., where users have different bandwidth capacities, peers with higher upload capacities typically have higher download speeds than slower peers [7].However, one essential understanding is that peers receiving a multimedia stream do not need a download rate higher than the playback rate of the media file. Rigorously, all they need is a policy that makes the whole system efficiently allocate its total upload/download capacity so that all of its participants may be served satisfactorily.International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.6, November 2015 112 Streaming using BitTorrent thus deserves particular concerns focused on the Peer-Selection Policy's concept in order to fulfill QoS requirements like low start up delay and smooth playback continuity. Despite the relevance of the matter, an efficient algorithm capable of equally sharing peers' upload bandwidth among fast and slo...

show abstract

Section: Basis Of a Bittorrent Systemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Improving BitTorrent's Peer Selection for Multimedia Content On-Demand Delivery

Streit¹,

Rodrigues²

2015

IJCNC

View full text Add to dashboard Cite

show abstract

“…Capa fitness (8) Thus, the best neighbors are the peers that make the formula (9) reach the maximum value.…”

Section: Fitness Function Of Ipso-npsmentioning

confidence: 99%

A new scheduling mechanism of BitTorrent streaming system based on improved PSO algorithm

Yuqi¹,

Yang²

2015

JCP

View full text Add to dashboard Cite

Abstract:In order to provide streaming media service with higher quality, a new data scheduling mechanism based on improved particle swarm optimization algorithm is proposed. This mechanism applies the idea of particle swarm optimization to peer selection of BitTorrent (BT) streaming system. First, improved particle swarm optimization (IPSO) algorithm is developed to overcome the shortcoming of falling easily into local optimum. Second, particle encoding and decoding are defined in the context of streaming media data scheduling, and fitness function based on the service ability of a peer is proposed. Third, IPSO-based neighbor peer selection (IPSO-NPS) algorithm is designed, in which the optimal solution of IPSO determines the set of peers providing data block resources. Simulation results show that IPSO algorithm enhances the convergence speed and accuracy, and the new data scheduling mechanism of IPSONPS reduces the startup delay of system, enhances the media playing continuity and reduces the network load.

show abstract