Methods for replicating media contents and P2P VoD systems
AssigneeThe Chinese University of Hong Kong
InventorsYipeng Zhou, Zhengjia Fu, Dah Ming Chiu
Life of this patent
Estimating the term…
Abstract
There is disclosed a method for replicating media contents in a P2P VoD system comprising a plurality of peers. The method may comprise: determining that a candidate media unit shall be replicated into a local storage of one of the peers; checking whether said local storage has enough space to store the candidate media unit; if not, selecting one media unit previously stored in said local storage to be replaced; and replacing the selected media unit by the candidate media unit.
Claims36
A method for replicating media contents in a P2P VoD system comprising a plurality of peers, comprising:
- determining that a candidate media unit shall be replicated into a local storage of one of the peers;
- checking whether said local storage has enough space to store the candidate media unit;
- if not, selecting one media unit previously stored in said local storage to be replaced;
- and
- replacing the selected media unit by the candidate media unit;
- wherein the selecting further comprises:
- selecting a media unit with a highest priority to be replaced from said one of the peers;
- and
- wherein the media unit r with the highest priority is determined by r=arg maxkεQi ηk(ASRk−PBRk),
- where arg means the one in Qi that has the maximum value of ηk(ASRk−PBRk);
- and ASRk=ΣiεSk Ui/λi,
- where Sk is a set of peers from the plurality of peers, each of which has a replication for media unit k in its local storage,
- Ui is an upload capacity for a peer i in Sk, and
- λi is a Poison approximation for a number of peers who requests the media unit k from the peer i, and
- PBRk means a required playback rate for the media unit k, and
- ηk represents a request rate/popularity for the media unit k.
A P2P VoD system, comprising:
- a plurality of peers;
- and
- an information collector communicating with each of the peers and configured to determine that a candidate media unit shall be replicated into a local storage of one of the peers;
- wherein said one of the peers operates to check whether said local storage has enough space to store the determined candidate media unit;
- if not, further to select one media unit previously stored in said local storage, and replace the selected media unit by the determined candidate media unit;
- wherein, if said one of the peers determines said local storage has not enough space to store the determined candidate media unit, it selects one media unit with a highest priority previously stored in its local storage and replaces the selected media unit by the determined candidate media unit;
- and
- wherein the media unit r with the highest priority is determined by r=arg maxkεQi ηk(ASRk−PBRk),
- where arg means the one in Qi that has the maximum value of ηk(ASRk−PBRk);
- and ASRk=ΣiεSk Ui/λi,
- where Sk is a set of peers from the plurality of peers, each of which has a replication for media unit k in its local storage,
- Ui is an upload capacity for a peer i in the set of peer Sk, and
- λi is a Poison approximation for a number of peers who requests the media unit k from the peer i, and
- PBRk means a required playback rate for the media unit k, and
- ηk resents a request rate/popularity for said media unit k.
Dependencies are inferred from the claim text.