Statistical modeling and analysis of P2P replication to support VoD service

Zhou, Yipeng; Fu, Tom Z. J.; Chiu, Dah Ming

doi:10.1109/infcom.2011.5935322

“…The first considers stochastic delay performance models, and the second deterministic conditions on request arrivals to guarantee feasibility of service. The two articles [23,24] are closer to our motivation in that they revisit the proportional placement strategy, to which they propose alternatives. Their modeling approach however significantly differs from ours.…”

Section: Related Workmentioning

confidence: 99%

Bipartite graph structures for efficient balancing of heterogeneous loads

Leconte

¹

,

Lelarge

²

,

Massoulié

³

2012

Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Syste

View full text Add to dashboard Cite

This paper considers large scale distributed content service platforms, such as peer-to-peer video-on-demand systems. Such systems feature two basic resources, namely storage and bandwidth. Their efficiency critically depends on two factors: (i) content replication within servers, and (ii) how incoming service requests are matched to servers holding requested content. To inform the corresponding design choices, we make the following contributions.We first show that, for underloaded systems, so-called proportional content placement with a simple greedy strategy for matching requests to servers ensures full system efficiency provided storage size grows logarithmically with the system size. However, for constant storage size, this strategy undergoes a phase transition with severe loss of efficiency as system load approaches criticality.To better understand the role of the matching strategy in this performance degradation, we characterize the asymptotic system efficiency under an optimal matching policy. Our analysis shows that -in contrast to greedy matchingoptimal matching incurs an inefficiency that is exponentially small in the server storage size, even at critical system loads. It further allows a characterization of content replication policies that minimize the inefficiency. These optimal policies, which differ markedly from proportional placement, have a simple structure which makes them implementable in practice.On the methodological side, our analysis of matching performance uses the theory of local weak limits of random graphs, and highlights a novel characterization of matching numbers in bipartite graphs, which may both be of independent interest.

show abstract

“…These works incentivized the peers to provide their upload bandwidth to serve other peers, but did not address how to ensure the peers have cached the proper data so that they are able to upload. In [20], [21], [25], the authors discussed the replication strategies in P2P-VoD systems; nevertheless, up till now, we have not found any work on incentivizing the peers in P2P-VoD systems to participate in the distributed caching. Our work differs from the previous in that our incentive scheme stimulates the peers to contribute the local storage resources and cache the desired data so that they can effectively upload the content to one another in P2P-VoDs.…”

Section: Related Workmentioning

confidence: 88%

Distributed Caching via Rewarding: An Incentive Scheme Design in P2P-VoD Systems

Wu

¹

,

Richard

²

,

Lui³

2014

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-Peer-to-peer (P2P) systems rely on peers' cooperation to provide a more robust and scalable service as compared to the traditional client-server architecture. However, the peers might be selfish in nature-they would like to receive services from others, but would not like to contribute their own resources by default. To conquer this problem, proper incentive schemes are needed so as to stimulate the peers' contributions. In particular, in P2P video-on-demand (VoD) systems, peers need to distributively cache the proper videos so as to mutually upload and help each other to acquire the required data. Content providers of P2P-VoD services want to incentivize peers to do so and alleviate the workload of the content server. In this paper, we design a practical mechanism to incentivize distributed caching in such systems, under which the peers are rewarded based on the popularity of the video they cache. We characterize the impact of this incentive scheme on peers' caching behaviors. In particular, we formulate an optimization framework to decide the optimal reward price for each video so as to keep enough replicas and minimize the content provider's operational cost. We first derive close form solutions in an asymptotic system, and then extend our results to be adaptive to various practical issues. Via extensive simulations, we validate the effectiveness and efficiency of our incentive scheme.

show abstract

“…Our present motivation, namely efficient use of servers' bandwidth through adequate replication, has been considered in the specific context of Peer-to-Peer systems, in a number of recent papers [21,8,18,19,23,24]. In [21,8], an argument is made for the proportional replication policy based on the analysis of delay in a queueing model of performance.…”

Section: Related Workmentioning

confidence: 99%

Bipartite graph structures for efficient balancing of heterogeneous loads

LeconteMathieu

¹

,

LelargeMarc

²

,

MassouliéLaurent

³

2012

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

This paper considers large scale distributed content service platforms, such as peer-to-peer video-on-demand systems. Such systems feature two basic resources, namely storage and bandwidth. Their efficiency critically depends on two factors: (i) content replication within servers, and (ii) how incoming service requests are matched to servers holding requested content. To inform the corresponding design choices, we make the following contributions.We first show that, for underloaded systems, so-called proportional content placement with a simple greedy strategy for matching requests to servers ensures full system efficiency provided storage size grows logarithmically with the system size. However, for constant storage size, this strategy undergoes a phase transition with severe loss of efficiency as system load approaches criticality.To better understand the role of the matching strategy in this performance degradation, we characterize the asymptotic system efficiency under an optimal matching policy. Our analysis shows that -in contrast to greedy matchingoptimal matching incurs an inefficiency that is exponentially small in the server storage size, even at critical system loads. It further allows a characterization of content replication policies that minimize the inefficiency. These optimal policies, which differ markedly from proportional placement, have a simple structure which makes them implementable in practice.On the methodological side, our analysis of matching performance uses the theory of local weak limits of random graphs, and highlights a novel characterization of matching numbers in bipartite graphs, which may both be of independent interest.

show abstract

Statistical modeling and analysis of P2P replication to support VoD service

Cited by 44 publications

References 9 publications

Bipartite graph structures for efficient balancing of heterogeneous loads

Bipartite graph structures for efficient balancing of heterogeneous loads

Distributed Caching via Rewarding: An Incentive Scheme Design in P2P-VoD Systems

Bipartite graph structures for efficient balancing of heterogeneous loads

Contact Info

Product

Resources

About