Improving QoS in BitTorrent-like VoD Systems

Yang, Yan; Chow, Alix L. H.; Golubchik, Leana; Bragg, Danielle

doi:10.1109/infcom.2010.5462029

Cited by 69 publications

(73 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Only more recent works [3,[17][18][19] target the adaptation of the Peer-Selection Policy for streaming. They basically alter the following major characteristics of the algorithm: (1) quantity of upload slots a peer opens; (2) leecher's and seeder's rule to decide the preferred peers for upload; and (3) time-cycle for re-evaluation of the slots.…”

Section: Related Work On Adapting Bittorrentmentioning

confidence: 99%

See 1 more Smart Citation

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: Related Work On Adapting Bittorrentmentioning

confidence: 99%

“…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.…”

Section: Introductionmentioning

confidence: 99%

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

Streit¹,

Rodrigues²

2015

IJCNC

View full text Add to dashboard Cite

show abstract

“…The key idea of the scheme is that: 1) for each neighbor q, p maintains the number of pieces which are held by q but are not held by p, and 2) when this number becomes less than a threshold, p asks the tracker to recommend a new neighbor q to have PP similar to p. An apparent drawback of this approach is that the tracker should keep track of the PP for all peers participating in the system, which will be relaxed in the proposed scheme by delegating the role of management to super peers. In [19], BitTorrent is extended so that each request carries the deadline and upon receiving such requests from downloaders, each peer determines the target of upload in the descending order of the criticalness of the deadline. A similar idea has been proposed in [1] so that the set of neighbors is dynamically divided into high priority group and low priority group, and in selecting the target of upload, it first selects a group with a certain probability and then selects requests in the descending order of the criticalness of the deadline.…”

Section: Related Workmentioning

confidence: 99%

“…A similar idea has been proposed in [1] so that the set of neighbors is dynamically divided into high priority group and low priority group, and in selecting the target of upload, it first selects a group with a certain probability and then selects requests in the descending order of the criticalness of the deadline. Appropriate selection of uploaders is also considered in the literature [12], [19]. In the method proposed in [19], each peer keeps the number of un-responded requests for each neighbor, and issues a request to a neighbor with the least un-responded requests.…”

Section: Related Workmentioning

confidence: 99%

“…In addition, it would also be crucial for each downloader to become adjacent with peers to have enough pieces to be acquired. In the literature, there are several proposals to realize such a deadline-driven selection of uploaders [1], [18], [19], but if each uploader independently conducts such a selection, we could not avoid the duplicated uploads of the same pieces to a specific peer, which causes the waste of the upload bandwidth of the overall network and the degradation of the upload performance. Of course, we could remove such redundant uploads by allowing each downloader to reject the upload of duplicated pieces, but such a reactive approach causes an overhead which increases the delay of the streaming, i.e., it is meaningful to seek a proactive approach so that uploaders conduct the upload of pieces in a collaborative manner.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Hierarchical Architecture for Peer-to-Peer Video on Demand Systems with the Notion of Dynamic Swarms

Yuji

Fujita

2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYThis paper proposes a method to reduce the playback suspension in a Video-on-Demand system based on the Peer-to-Peer technology (P2P VoD). Our main contribution is twofold. The first is the proposal of a hierarchical P2P architecture with the notion of dynamic swarms. Swarm is a group of peers to have similar playback position and those swarms are connected with an overlay so that requested pieces are forwarded from a swarm to another swarm in a bucket brigade manner, where the forward of pieces is regulated by the super-peer (SP) of each swarm. The second contribution is the proposal of a match making scheme between requests and uploaders. The simulation result indicates that the proposed scheme reduces the total waiting time of a randomized scheme by 24% and the load of the media server by 76%.

show abstract

SeekStream: adapting to dynamic user behavior in P2P video‐on‐demand

Deltouzos

Gkortsilas

Efthymiopoulos

et al. 2016

Int J Communication

View full text Add to dashboard Cite

In recent years, the users' perceived quality of experience (QoE) in streaming services has gained a lot of attention. Particularly, a number of research efforts have focused on providing live streaming and video-ondemand (VoD) services using peer-to-peer (P2P) architectures. However, in these proposed architectures, the heterogeneity of users and their dynamic behavior has not been sufficiently studied. In a real life scenario, where users have highly heterogeneous bandwidth resources (cable, DSL, 3G networks, etc) and can arbitrarily decide to perform a VCR function (stop, fast forward and seeking), ignoring this behavior can significantly deteriorate the system's efficiency and the perceived QoE. In this paper, we present SeekStream, a scalable P2P VoD architecture that ensures the stable delivery of the video stream to every participating user even in cases of high heterogeneity and frequent seeking operations. Specifically, SeekStream is a set of algorithms that optimize the P2P overlay dynamically and in a distributed fashion, making it adaptive to users dynamic behavior and bandwidth changes. The available bandwidth resources of the participating users are optimally exploited, keeping the contribution from the media server(s) to a minimal level. To illustrate the performance of the proposed algorithms, we are using a centralized overlay network manager that discovers the optimal network graph as a reference. We have developed an extensive P2P VoD simulator that shows the efficiency, scalability, and stability of our system under variant and dynamic conditions. The algorithms of our proposed system introduce less than 4% bandwidth overhead while we achieve high offloading of the media server(s). SeekStream guarantees a high block reception rate for the users, even under extreme seeking patterns.In P2P streaming services, each media object (video) is assumed to have a certain average playback rate and is usually divided into blocks of equal size. Peers that are interested to watch the video may enter the system at arbitrary time instants and consume the video fraction(s) of their interest.Adequate space is allocated in each peer's hard disk for the purpose of saving these blocks, which are provided either directly from the media server or from the participating peers. Generally, peers join the system and watch the video sequentially. However, it is not uncommon for someone to skip one or more parts of the video that are of no interest to it.For example, in Figure 1, we depict the hard disk of peer i watching a video of 64 blocks. Peer i joined the system and opted to watch the video not from its beginning, but starting from block 5. Then after having watched until block 12, it jumped to block 17, then from 28 to 37. Its current playback point is block 50 at time t 0 . Because of the jumps, we can see that the white blocks have not been requested, thus creating blank areas, whereas the blocks that are pending (requested but not yet delivered) and received are orange and green respectively. Different video par...

show abstract

Improving QoS in BitTorrent-like VoD Systems

Cited by 69 publications

References 8 publications

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

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

Hierarchical Architecture for Peer-to-Peer Video on Demand Systems with the Notion of Dynamic Swarms

SeekStream: adapting to dynamic user behavior in P2P video‐on‐demand

Contact Info

Product

Resources

About