Exploring the policy selection of the P2P VoD system: A simulation-based research

Xu, Ke; Liu, Xin; Ma, Zongwen; Zhong, Yifeng; Chen, Wenlong

doi:10.1007/s12083-014-0268-0

Cited by 8 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The base case, i=2, it is simple to see the lemma is true. We assume that it is true for S l , where 2 ≤ l<n. (5) Consider LCA(s i , s l+1 ) for some 1 ≤ i ≤ l-1. Then,…”

Section: Slca(s): Set Of Lcas Of All Subsets Of S Lemma 1 Let Be a Romentioning

confidence: 99%

See 1 more Smart Citation

An Optimal Peer Selection Algorithm for Mesh-based Peer-to-Peer Networks

Han¹,

Nam²

2019

KSII TIIS

View full text Add to dashboard Cite

In order to achieve faster content distribution speed and stronger fault tolerance, a P2P peer can connect to multiple peers in parallel and receive chunks of the data simultaneously. A critical issue in this environment is selecting a set of nodes participating in swarming sessions. Previous related researches only focus on performance metrics, such as downloading time or the round-trip time, but in this paper, we consider a new performance metric which is closely related to the network and propose a peer selection algorithm that produces the set of peers generating optimal worst link stress. We prove that the optimal algorithm is practicable and has the advantages with the experiments on PlanetLab. The algorithm optimizes the congestion level of the bottleneck link. It means the algorithm can maximize the affordable throughput. Second, the network load is well balanced. A balanced network improves the utilization of resources and leads to the fast content distribution. We also notice that if every client follows our algorithm in selecting peers, the probability is high that all sessions could benefit. We expect that the algorithm in this paper can be used complementary to existing methods to derive new and valuable insights in peer-to-peer networking.

show abstract

“…The base case, i=2, it is simple to see the lemma is true. We assume that it is true for S l , where 2 ≤ l<n. (5) Consider LCA(s i , s l+1 ) for some 1 ≤ i ≤ l-1. Then,…”

Section: Slca(s): Set Of Lcas Of All Subsets Of S Lemma 1 Let Be a Romentioning

confidence: 99%

“…The purpose of peer selection is to construct the best subset of peers so that the service quality is maximized and the network congestion is minimized. Because the swarming performance depends on the participating peers, a selection algorithm is essential for the swarming technique [5].…”

Section: Introductionmentioning

confidence: 99%

An Optimal Peer Selection Algorithm for Mesh-based Peer-to-Peer Networks

Han¹,

Nam²

2019

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…Perhaps the most related works to ours are the following two. Xu et al [18] investigated the performance of different piece-and peer selection policies, as well as solutions to replica management. However, they did not take mixed swarms into consideration.…”

Section: Related Workmentioning

confidence: 99%

“…Contrasting this service with live streaming, different users in VoD systems are usually interested in different parts of the media content, which appears to be similar to the dynamics of users in traditional P2P file-sharing. Thus, recently, much attention has been paid to the VoD extensions of the BitTorrent protocol [5,11,13,18,19].…”

Section: Introductionmentioning

confidence: 99%

Robustness of BitTorrent-like VoD Protocols

Vinkó

2016

Acta Cybern

View full text Add to dashboard Cite

Besides server supported solutions for Video-on-demand, approaches based on distributed systems such as BitTorrent are being used due to their efficiency and high scalability. There are several protocol variants proposed in the literature, which are mainly concerned with providing mechanisms for piece selection and peer selection. In this paper, using the concept of Design Space Analysis, we give comparisons of the performances of several BitTorrent-like Video-on-demand protocols under the assumption that other protocol variants may also enter the system.

show abstract