Computer Science – Networking and Internet Architecture
Scientific paper
2010-04-27
Computer Science
Networking and Internet Architecture
18 pages (double column), 6 figures
Scientific paper
In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We consider system performance under a many-user asymptotic. We distinguish two scenarios, namely "Distributed Server Networks" (DSN) for which requests are exogenous to the system, and "Pure P2P Networks" (PP2PN) for which requests emanate from the peers themselves. For both scenarios, we consider a loss network model of performance, and determine asymptotically optimal content placement strategies in the case of a limited content catalogue. We then turn to an alternative "large catalogue" scaling where the catalogue size scales with the peer population. Under this scaling, we establish that storage space per peer must necessarily grow unboundedly if bandwidth utilization is to be maximized. Relating the system performance to properties of a specific random graph model, we then identify a content placement strategy and a request acceptance policy which jointly maximize bandwidth utilization, provided storage space per peer grows unboundedly, although arbitrarily slowly, with system size.
Bo
Massoulie Laurent
Tan
No associations
LandOfFree
Optimal Content Placement for Peer-to-Peer Video-on-Demand Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimal Content Placement for Peer-to-Peer Video-on-Demand Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Content Placement for Peer-to-Peer Video-on-Demand Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-236837