Program transmission optimisation

Claim 3

A method as claimed in claim 1, further comprising the step of selecting a Maximum Response Time (MRT) corresponding to a maximum time a user need wait to commence playing a requested program from a beginning of the program.

Claim 4

A method as claimed in claim 2, wherein step (a) comprises providing the program divided into program segments of a length selected such that at least one program segment is transmitted in the time of one MRT.

Claim 5

A method as claimed in claim 3, wherein step (b) comprises transmitting one or more program segments during each MRT, including a first program segment corresponding to a first segment of playing time of the program, in accordance with the scheduling algorithm, wherein, in use, the first program segment is always available at a receiver within one MRT for immediate playback.

Claim 6

A method as claimed in claim 4, further comprising at the head end of the distribution system the step of numbering the program segments 1 to n, where n equals the number of segments into which the program is divided, and wherein the segments are numbered in the order in which they should appear in the program for normal playback.

Claim 7

A method as claimed in claim 5, wherein implementing the scheduling algorithm involves iteratively calculating during each MRT the result of: COUNT Modulo X=Y, wherein COUNT=a predetermined initial whole number incremented by 1 after each MRT; X=1 to n, where n=the number of segments into which the program has been divided; and organizing the program segments into said predetermined sequence based on said calculation wherein, in use, whenever Y=O, the program segment number X will be transmitted.

Claim 8

A method as claimed in claim 1, further comprising the steps of recording a user identification number, a program title identification number and a time of each request in a subscriber request map; and tracking each request and its progress towards completion.

Claim 11

A system as claimed in claim 8, further comprising at the head end of the system: means for numbering the program segments 1 to n, where n equals the number of program segments into which the program is divided, and wherein the program segments are numbered in the order in which they should appear in the program for normal playback, said means for numbering being operatively connected to said means for providing the program and said means for transmitting the program segments to provide for transmission of the program segments in accordance with the scheduling algorithm.

Claim 12

A system as claimed in claim 9, further comprising at the head end of the system: means for appending a segment identifier to each program segment prior to transmitting, wherein said segment identifier at least identifies a program segment by its number, said means for appending a segment identifier being operatively connected to said means for numbering to determine a number assigned to each program segment for inclusion in said segment identifier.

Claim 13

A system as claimed in claim 8, wherein said means for transmitting transmits one or more of said program segments during each Maximum Response Time (MRT) time interval, wherein MRT corresponds to a maximum time a user need wait to commence playing a requested program.

Claim 14

A system as claimed in claim 11, further comprising scheduling means for scheduling said plurality of program segments, said scheduling means comprising: means for iteratively calculating during each MRT the result of the scheduling algorithm: COUNT Modulo X=Y, wherein COUNT=a predetermined initial whole number incremented by 1 after each MRT; X=1 to n, where n=the number of segments into which the program has been divided; and means for organizing the program segments into said predetermined sequence based on said calculation wherein, in use, whenever Y=0, the program segment number X will be transmitted, and wherein said means for organizing is operatively connected to said means for transmitting the program segments to provide for transmission of the program segments in accordance with said result of said scheduling algorithm.

Claim 15

A receiver for receiving a program supplied to multiple receivers by a program transmission optimization system, wherein more than one of the multiple receivers request a particular program at a same time or different times, the system responds to each request irrespective of whether or not a receiver other than said more than one of the multiple receivers is already receiving the same particular program while minimizing transmission resources required to service the requests, the receiver comprising: buffer storage means for storing a plurality of program segments of the program transmitted from a head end of the program transmission optimization system according to a scheduling algorithm such that during a time required for normal playback of the program at the multiple receivers, at least some of the program segments are transmitted more than once simultaneously from the head end to the multiple receivers with no requirement at any time to dedicate the head end of the system to any specific receiver, and wherein if a same program segment is received by the receiver more than once, said same program segment is stored only once in the buffer storage means; and processing means for processing said program segments stored in the buffer storage means and for supplying the segments in a correct sequence for playback, wherein said scheduling algorithm ensures that the receiver will receive all of the program segments in a manner that will enable continuous playback of the program at a normal playback rate of the program while providing flexibility to structure the buffer storage means to be smaller than is required to hold the entire program if desired.

Claim 16

A receiver for receiving a program supplied to multiple receivers by a program transmission optimization system, wherein more than one of the multiple receivers request a particular program at a same time or different times, the system responds to each request irrespective of whether or not a receiver other than said more than one of the multiple receivers is already receiving the same particular program while minimizing transmission resources required to service the requests, the receiver comprising: buffer storage means for storing a plurality of program segments of the program transmitted from a head end of the program transmission optimization system according to a scheduling algorithm such that during a time required for normal playback of the program at the multiple receivers, at least some of the program segments are transmitted more than once simultaneously from the head end to the multiple receivers with no requirement at any time to dedicate the head end of the system to any specific receiver, and wherein if a same program segment is received by the receiver more than once, said same program segment is stored only once in the buffer storage means; and processing means for processing said program segments stored in the buffer storage means and for supplying the segments in a correct sequence for playback, wherein said scheduling algorithm ensures that the receiver will receive all of the program segments in a manner that will enable continuous playback of the program at a normal playback rate of the program while providing flexibility to structure the buffer storage means to be smaller than is required to hold the entire program if desired.

Claim 17

A receiver as claimed in claim 13, wherein said processing means comprises means for distinguishing received program segments by a segment identifier, wherein said segment identifier at least identifies a segment by its number and wherein, in use, the receiver uses the segment identifier to distinguish redundant segments from segments required for subsequent playback.

Claim 18

A receiver as claimed in claim 13, wherein said processing means further comprises decompressing means for decompressing compressed program segments transmitted from the head end of the program transmission optimization system.

Claim 19

A scheduling apparatus for a program transmission optimization system for optimizing transmission of a program from a head end to multiple receivers, wherein if one or more of the multiple receivers request a particular program at a same time or different times, the system responds to each request irrespective of whether or not a receiver other than said one or more of the multiple receivers is already receiving the same particular program, while minimizing transmission resources required to service the requests, the scheduling apparatus comprising: means for providing the program divided into a plurality of program segments for implementing a scheduling algorithm by which the program segments are organized into a predetermined sequence; and means for scheduling said plurality of program segments according to the scheduling algorithm such that during a time required for normal playback of the program at the multiple receivers at least some of the program segments are transmitted more than once simultaneously from the head end to the multiple receivers with no requirement at any time to dedicate the head end of the system to any specific receiver; and wherein said scheduled program segments are transmitted to one or more receivers of users requesting the program such that if a same program segment is received by a receiver more than once, said same program segment is stored only once in a buffer storage means provided in the receiver, and wherein said scheduling algorithm ensures that a user's receiver will receive all of the program segments in a manner that will enable continuous playback of the program at a normal playback rate of the program while providing the flexibility to structure the buffer storage means to be smaller than is required to hold the entire program if desired.

Claim 20

A scheduling apparatus for a program transmission optimization system for optimizing transmission of a program from a head end to multiple receivers, wherein if one or more of the multiple receivers request a particular program at a same time or different times, the system responds to each request irrespective of whether or not a receiver other than said one or more of the multiple receivers is already receiving the same particular program, while minimizing transmission resources required to service the requests, the scheduling apparatus comprising: means for providing the program divided into a plurality of program segments for implementing a scheduling algorithm by which the program segments are organized into a predetermined sequence; and means for scheduling said plurality of program segments according to the scheduling algorithm such that during a time required for normal playback of the program at the multiple receivers at least some of the program segments are transmitted more than once simultaneously from the head end to the multiple receivers with no requirement at any time to dedicate the head end of the system to any specific receiver; and wherein said scheduled program segments are transmitted to one or more receivers of users requesting the program such that if a same program segment is received by a receiver more than once, said same program segment is stored only once in a buffer storage means provided in the receiver, and wherein said scheduling algorithm ensures that a user's receiver will receive all of the program segments in a manner that will enable continuous playback of the program at a normal playback rate of the program while providing the flexibility to structure the buffer storage means to be smaller than is required to hold the entire program if desired.

Claim 21

A scheduling apparatus as claimed in claim 16, wherein said means for providing the program provides the program divided into segments of a length selected such that at least one segment is transmitted in a Maximum Response Time (MRT) time interval, wherein the MRT corresponds to a maximum time a user need wait to commence playing a requested program from a beginning of the program.

Claim 22

A scheduling apparatus claimed in claim 17, further comprising means for numbering the program segments 1 to n, where n equals the number of segments into which the program is divided, and wherein the segments are numbered in the order in which they should appear in the program for normal playback.

Claim 23

A scheduling apparatus as claimed in claim 18, wherein said scheduling means comprises means for iteratively calculating during each MRT the result of the scheduling algorithm; COUNT Modulo X=Y, wherein COUNT=a predetermined initial whole number incremented by 1 after each MRT: X=1 to n, wherein n=the number of segments into which the program has been divided; and means for organizing the program segments into said predetermined sequence based on said calculation wherein, in use, whenever Y=0, the program segment number X will be transmitted.

Claim 24

An apparatus as claimed in claim 16, wherein said means for providing the program retrieves the program segments from a compressed program storage means wherein the program is stored in compressed segmented format corresponding to said plurality of segments.

Claim 25

A method as claimed in claim 1, wherein step (b) comprises transmitting program segments occurring early in the program more frequently than program segments occurring later in the program.

Claim 26

A method as claimed in claim 1, wherein step (b) comprises transmitting the plurality of program segments in accordance with a modified scheduling algorithm adapted to smooth a transmission load and to reduce transmission bandwidth requirements.

Claim 27

A method as claimed in claim 22, wherein the plurality of program segments comprises a first program segment, and wherein step (b) further comprises transmitting one or more initial program segments at predetermined time intervals for storing indefinitely in the buffer storage means in the receiver and transmitting the plurality of program segments except said one or more initial program segments in accordance with the modified scheduling algorithm, wherein in use, the first program segment is always available at the receiver for immediate viewing.

Claim 28

A method as claimed in claim 1, further comprising, prior to step (b), a step of compressing the program, wherein the plurality of program segments are provided in a compressed format.