Tracker in P2P systems with DVD functionalities
First Claim
Patent Images
1. A method of grouping peers in a P2P system where DVD jump operations can be performed, the method comprising the steps of:
- a. determining, by a computing device, for each peer and video operation a time T and a jump point Pj b. generating a hash key HKj for each peer, the hash key having a value HKj=(Pj−
T)/C, where C>
=1 is a granularity of the systemc. grouping peers with the same hash-keyd. selecting a neighborhood of a requesting peer from a group of peers with the same hash key as the requesting peer, wherein if the number of peers in the neighborhood of the requesting peer is less than n, where n is a design parameter, the remaining peers of the neighborhood of the requesting peer are selected;
from a list of peers with a hash key greater than and close to the hash key of the requesting peer orfrom a list of peers that have already played a playback segment j of the requesting peer.
1 Assignment
0 Petitions
Accused Products
Abstract
A method of optimizing the design of a Tracker in P2P applications to support DVD features, the method including determining for each peer and video operation the time T and jump point Pj, generating a hash key HKj for each peer, the hash key having a value Kj=(Pj−T)/C, where C>=1 is the granularity of the system, and grouping the peers with the same hash-key, where the system is designed to provide good viewer experience while supporting DVD features like pause, forward and backward jump operations.
11 Citations
5 Claims
-
1. A method of grouping peers in a P2P system where DVD jump operations can be performed, the method comprising the steps of:
-
a. determining, by a computing device, for each peer and video operation a time T and a jump point Pj b. generating a hash key HKj for each peer, the hash key having a value HKj=(Pj−
T)/C, where C>
=1 is a granularity of the systemc. grouping peers with the same hash-key d. selecting a neighborhood of a requesting peer from a group of peers with the same hash key as the requesting peer, wherein if the number of peers in the neighborhood of the requesting peer is less than n, where n is a design parameter, the remaining peers of the neighborhood of the requesting peer are selected; from a list of peers with a hash key greater than and close to the hash key of the requesting peer or from a list of peers that have already played a playback segment j of the requesting peer. - View Dependent Claims (2, 3, 4)
-
-
5. A P2P system for video applications, the system comprising a tracker adapted to support jump DVD operations, wherein the tracker comprises:
-
a memory storing computer executable code; and a processor configured to execute the stored code to; determine for each peer and video operation a time T and a jump point Pj generate a hash key HKj for each peer, the hash key having a value HKj=(Pj−
T)/C, where C>
=1 is a granularity of the systemgroup peers with the same hash-key select a neighborhood of a requesting peer from a group of peers with the same hash key as the requesting peer, wherein if the number of peers in the neighborhood of the requesting peer is less than n, where n is a design parameter, the remaining peers of the neighborhood of the requesting peer are selected from a list of peers with a hash key greater than and close to the hash key of the requesting peer or from a list of peers that have already played a playback segment j of the requesting peer.
-
Specification