3,742 research outputs found
Analyzing Peer Selection Policies for BitTorrent Multimedia On-Demand Streaming Systems in Internet
The adaptation of the BitTorrent protocol to multimedia on-demand streaming
systems essentially lies on the modification of its two core algorithms, namely
the piece and the peer selection policies, respectively. Much more attention
has though been given to the piece selection policy. Within this context, this
article proposes three novel peer selection policies for the design of
BitTorrent-like protocols targeted at that type of systems: Select Balanced
Neighbour Policy (SBNP), Select Regular Neighbour Policy (SRNP), and Select
Optimistic Neighbour Policy (SONP). These proposals are validated through a
competitive analysis based on simulations which encompass a variety of
multimedia scenarios, defined in function of important characterization
parameters such as content type, content size, and client interactivity
profile. Service time, number of clients served and efficiency retrieving
coefficient are the performance metrics assessed in the analysis. The final
results mainly show that the novel proposals constitute scalable solutions that
may be considered for real project designs. Lastly, future work is included in
the conclusion of this paper.Comment: 19 PAGE
Improving BitTorrent's Peer Selection For Multimedia Content On-Demand Delivery
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 low-provision capacity scenarios where users are very interactive.Comment: International Journal of Computer Networks & Communications(IJCNC)
Vol.7, No.6, November 201
ISP-friendly Peer-assisted On-demand Streaming of Long Duration Content in BBC iPlayer
In search of scalable solutions, CDNs are exploring P2P support. However, the
benefits of peer assistance can be limited by various obstacle factors such as
ISP friendliness - requiring peers to be within the same ISP, bitrate
stratification - the need to match peers with others needing similar bitrate,
and partial participation - some peers choosing not to redistribute content.
This work relates potential gains from peer assistance to the average number
of users in a swarm, its capacity, and empirically studies the effects of these
obstacle factors at scale, using a month-long trace of over 2 million users in
London accessing BBC shows online. Results indicate that even when P2P swarms
are localised within ISPs, up to 88% of traffic can be saved. Surprisingly,
bitrate stratification results in 2 large sub-swarms and does not significantly
affect savings. However, partial participation, and the need for a minimum
swarm size do affect gains. We investigate improvements to gain from increasing
content availability through two well-studied techniques: content bundling -
combining multiple items to increase availability, and historical caching of
previously watched items. Bundling proves ineffective as increased server
traffic from larger bundles outweighs benefits of availability, but simple
caching can considerably boost traffic gains from peer assistance.Comment: In Proceedings of IEEE INFOCOM 201
AngelCast: cloud-based peer-assisted live streaming using optimized multi-tree construction
Increasingly, commercial content providers (CPs) offer streaming solutions using peer-to-peer (P2P) architectures, which promises significant scalabil- ity by leveraging clients’ upstream capacity. A major limitation of P2P live streaming is that playout rates are constrained by clients’ upstream capac- ities – typically much lower than downstream capacities – which limit the quality of the delivered stream. To leverage P2P architectures without sacri- ficing quality, CPs must commit additional resources to complement clients’ resources. In this work, we propose a cloud-based service AngelCast that enables CPs to complement P2P streaming. By subscribing to AngelCast, a CP is able to deploy extra resources (angel), on-demand from the cloud, to maintain a desirable stream quality. Angels do not download the whole stream, nor are they in possession of it. Rather, angels only relay the minimal fraction of the stream necessary to achieve the desired quality. We provide a lower bound on the minimum angel capacity needed to maintain a desired client bit-rate, and develop a fluid model construction to achieve it. Realizing the limitations of the fluid model construction, we design a practical multi- tree construction that captures the spirit of the optimal construction, and avoids its limitations. We present a prototype implementation of AngelCast, along with experimental results confirming the feasibility of our service.Supported in part by NSF awards #0720604, #0735974, #0820138, #0952145, #1012798 #1012798 #1430145 #1414119. (0720604 - NSF; 0735974 - NSF; 0820138 - NSF; 0952145 - NSF; 1012798 - NSF; 1430145 - NSF; 1414119 - NSF
The state of peer-to-peer network simulators
Networking research often relies on simulation in order to test and evaluate new ideas. An important requirement of this process is that results must be reproducible so that other researchers can replicate, validate and extend existing work. We look at the landscape of simulators for research in peer-to-peer (P2P) networks by conducting a survey of a combined total of over 280 papers from before and after 2007 (the year of the last survey in this area), and comment on the large quantity of research using bespoke, closed-source simulators. We propose a set of criteria that P2P simulators should meet, and poll the P2P research community for their agreement. We aim to drive the community towards performing their experiments on simulators that allow for others to validate their results
- …