Granted Patent B2

US 8,028,098 · App. 12/387,415 · Granted Sep 27, 2011

Abstract

Claims (31)

1. A method of synchronizing content comprising the steps of:

receiving content via a broadcast data receiver, said broadcast data receiver connected to a network of one or more peers of further broadcast data receivers;

storing the content on storage media;

the content being divided into portions, the boundaries of the portions being spaced apart by a predetermined fixed portion or chunk size;

allowing one or more received portions of the content to be shared with the peers;

at least one or more received portions is synchronized between the peers by referring to program clock reference values;

wherein the program clock reference values at the start and at the end of each portion of each peer are monitored and predetermined periods from the earliest or latest program clock reference valves are calculated from the earliest or latest values available to determine common start or end points;

wherein the peer with the least dropped packets is assigned as a reference peer against which other peers are compared, such that if a difference in a program clock reference value is detected at a boundary of one or more of the portions, the broadcast data receiver receiving content sends the difference to the corresponding serving peer such that subsequent portions can be offset by said difference.

2. A method according to claim 1 wherein program clock reference values increase sequentially every 0.1 seconds.

3. A method according to claim 1 wherein the broadcast data receiver receiving the content determines an earliest and/or latest program clock reference value for content available from the peers.

4. A method according to claim 3 wherein the broadcast data receiver receiving content the calculates a predetermined period from said earliest and/or latest program clock reference value or values to determine respective common start and/or end points.

5. A method according to claim 4 wherein the predetermined period is 60 seconds.

6. A method according to claim 4 wherein the start and/or end points are sent to the peers, thereby defining the content to be made available by the peers in a swarm for synchronization.

7. A method according to claim 4 wherein a peer is marked as unavailable if it is unable to synchronize the start and/or end points.

8. A method according to claim 7 wherein the program clock reference values are stored in an index file.

9. A method according to claim 1 wherein a portion is subdivided into smaller portions if the size of the portion reaches a threshold size.

10. A broadcast data receiver comprising:

receiving means for receiving broadcast content;

communication means for connecting to a network of one or more peers of further broadcast data receivers;

storage means for storing the content;

the available content being divided into portions, the boundaries of the portions being spaced apart by a predetermined fixed portion or chunk size;

processing means for dividing the content into one or more portions;

the content being shareable by the peers, at least one portion being synchronized between the peers by referring to program clock reference values, wherein the program clock references values at the start and the end of each portion of each peer are monitored and predetermined periods from the earliest or latest program clock reference values are calculated from the earliest or latest values available to determine common start or end points;

wherein a peer with the least dropped packets is assigned as a reference peer against which other peers are compared, such that if a difference in a program clock reference value is detected at a boundary of one or more of the portions, the broadcast data receiver receiving content sends the difference to the corresponding peer such that subsequent portions can be offset by said difference.

11. A method of synchronizing content comprising the steps of:

receiving content via a receiver;

storing the content;

dividing the content into portions, the boundaries of the portions being spaced apart by a predetermined fixed portion or chunk size;

allowing one or more received portions of the content to be shared by at least one further receiver;

at least one portion being synchronized between the receivers using program clock reference values wherein the program clock reference values at the start and the end portion are monitored and predetermined from the earliest or latest values available to determine common start or end points;

wherein the receiver with the least dropped packets is assigned as a reference receiver against which other receivers are compared, such that if a difference in a program clock reference value is detected at a boundary of one or more of the portions, the receiver receiving shared content sends the difference to the corresponding serving receiver such that subsequent portions on the serving receiver can be offset by said difference.

Assignments (8)