Method and apparatus for managing a data carousel
First Claim
Patent Images
1. A method comprising:
- determining a worst case latency between successive transmissions of a data file in a data carousel, wherein the determining comprises;
determining the number of other data files that will be transmitted between successive transmissions of the data file; and
determining the time needed to transmit each of the other data files;
comparing the worst case latency with a threshold latency value; and
modifying composition of the data carousel if the worst case latency exceeds the threshold latency value.
2 Assignments
0 Petitions
Accused Products
Abstract
A data carousel contains multiple data files. A procedure determines a worst case latency between successive transmissions of a data file in the data carousel. The worst case latency is compared with a threshold latency value. The composition of the data carousel is modified if the worst case latency exceeds the threshold latency value.
-
Citations
46 Claims
-
1. A method comprising:
-
determining a worst case latency between successive transmissions of a data file in a data carousel, wherein the determining comprises; determining the number of other data files that will be transmitted between successive transmissions of the data file; and determining the time needed to transmit each of the other data files; comparing the worst case latency with a threshold latency value; and modifying composition of the data carousel if the worst case latency exceeds the threshold latency value. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A method comprising:
-
receiving a request to add a new data file to a data carousel; identifying a plurality of existing data files in the data carousel; for each of the plurality of existing data files, identifying a worst case latency between successive transmissions of the existing data file in the data carousel; determining a data file having the largest worst case latency; and deleting all instances of the data file having the largest worst case latency from the data carousel. - View Dependent Claims (16, 17)
-
-
18. A method comprising:
-
receiving a request to add a new data file to a data carousel; identifying a plurality of existing data files in the data carousel; for each of the plurality of existing data files, identifying a smallest latency between successive transmissions of the existing data file in the data carousel; and deleting at least one instance of the data file having the smallest latency from the data carousel. - View Dependent Claims (19, 20, 21)
-
-
22. A method comprising:
-
determining a number of data files accommodated by a data carousel; identifying a maximum latency value permitted between successive transmissions of a particular data file in the data carousel; identifying a request frequency associated with various data files; inserting data files into the data carousel based on the identified request frequency and the maximum latency value permitted between successive transmissions of a particular data file in the data carousel; monitoring the worst case latency between successive transmissions of a data file in a data carousel; and modifying composition of the data carousel if the worst case latency exceeds a threshold value. - View Dependent Claims (23, 24, 25, 45, 46)
-
-
26. A method comprising:
-
determining a number of data files that can be stored in a data carousel; determining a number of bits associated with each data file in the data carousel; determining a data transmission rate associated with the data carousel; determining a maximum allowed latency associated with the data carousel; determining a ratio of frequencies of pairs of data files in the data carousel; and calculating a worst case latency between successive transmissions of a particular data file. - View Dependent Claims (27, 28, 29, 30)
-
-
31. A method comprising:
-
identifying a darn carousel, wherein the data carousel comprises a plurality of positions arranged as a loop, wherein; each of the plurality of positions is configured to maintain a data file, in its entirety; and the data carousel repeatedly transmits data flies that are maintained in the plurality of positions, wherein an order of data file transmissions is determined based on an order of the positions within the loop; determining a worst case latency between a transmission of an instance of a particular data file in the data carousel and a next transmission of an instance of the particular data file; comparing the worst case latency with a threshold latency value; and requesting an increase in a data delivery rate associated with the data carousel if the worst case latency exceeds the threshold latency value.
-
-
32. An apparatus comprising:
-
means for storing a plurality of data files in a data carousel; means for generating a plurality of new data files to be stored in the data carousel; and means for controlling the data carousel, the means for controlling the data carousel; identifying one of the plurality of data files to be deleted from the data carousel; identifying one of the plurality of new data files to store in the data carousel; and modifying arrangement of the plurality of data files in the data carousel. - View Dependent Claims (33, 34, 35)
-
-
36. An apparatus comprising:
-
a carousel generator configured to generate data files to be stored in a data carousel; and a carousel controller coupled to the carousel generator and configured to; manage the insertion of data files into the data carousel; manage the deletion of data files from the data carousel; determine a maximum latency between successive transmissions of multiple instances of a data file in the data carousel, wherein the carousel controller prevents insertion in a transport stream of data files having a maximum latency between successive transmissions that exceed a threshold; and report calculated worst case latency associated with each module in the data carousel, wherein the carousel controller is configured to identify each of these latencies as either complying with or exceeding a reference latency threshold. - View Dependent Claims (37, 38, 39)
-
-
40. One or more computer-readable media having stored thereon a computer program that, when executed by one or more processors, causes the one or more processors to execute a method, the method comprising:
-
identifying a data carousel, wherein the data carousel comprising a plurality of positions arranged as a loop, wherein; each of the plurality of positions is configured to maintain a data file, in its entirety; and the data carousel repeatedly transmits data files that are maintained in the plurality of positions, wherein the order of data file transmissions is determined based on the order of the positions within the loop; determining a maximum latency value associated with the data carousel; determining a worst case latency between successive transmissions of an existing data file in the data carousel; comparing the worst case latency to the maximum latency value; and deleting the existing data file if the worst case latency exceeds the maximum latency value. - View Dependent Claims (41, 42, 43, 44)
-
Specification