Patent Description:
A vehicle, (e.g., an airplane, spacecraft, helicopter, watercraft, ground vehicle, etc.), generates data while in operation. The data can pertain to various aspects of the vehicle and can be transmitted with a telemetry unit. The telemetry unit has a finite storage space to store the data. Further, the storage of the telemetry unit is a single storage buffer for all the data types (e.g., one large shared buffer), but instead is several buffers each dedicated to a different data source (e.g., sensor) and data type.

<CIT>, according to its abstract, states that a system and method include collecting vehicle sensor data, wherein prioritizing vehicle sensor data includes identifying a level of importance for each of a plurality of vehicle sensor data types included in the vehicle sensor data; generating a vehicle sensor data schedule, wherein generating the vehicle data schedule includes one or more of (i) identifying a transmission order for each of the plurality of vehicle sensor data types and (ii) identifying a storage scheme selected from a hierarchy of data storage types for each of the plurality of vehicle sensor data types; transforming vehicle sensor data into message data, wherein the transforming includes selectively converting one or more of the vehicle sensor data types of the vehicle sensor data to a messaging format based on the prioritization; and transmitting, via one or more selected communication networks, the message data according to the vehicle sensor data schedule.

<CIT>, according to its abstract, states that a vehicle-mounted device collects and transmits sensor data to an external apparatus, a buffer unit that stores the sensor data. A determination unit that determines whether or not a predetermined condition is satisfied, and a controller that controls transmission of the sensor data by the transmitter to the external apparatus. The controller causes the transmitter to stop transmitting the sensor data collected by the collector to the external apparatus when the determination unit determines that the predetermined condition is satisfied, and causes, when a determination result obtained by the determination unit changes to indicate that the predetermined condition is not satisfied after the determination unit determines that the predetermined condition is satisfied, the transmitter to concurrently transmit the sensor data stored in Foreign Application Priority Data the buffer unit to the external apparatus while giving priority to sensor data with a shorter delay time based on priority levels according to delay time.

There is described herein a method comprising: identifying transmission priorities for a plurality of streamed data sources, wherein each of streamed data sources is configured to generate a respective amount of data, and wherein the transmission priorities indicate a transmission order associated with the plurality of streamed data sources; generating a first permutation that is a first assignment of the plurality of streamed data sources to a plurality of transmitters for transmission; generating a first prediction of whether and how much data from the plurality of streamed data sources will need to be stored prior to transmission based on the first permutation, the respective amounts of data to be generated by the plurality of streamed data sources, the transmission priorities and bandwidths of the plurality of transmitters; generating a first allocation of storage space sizes that the plurality of streamed data sources will need based on the first permutation and the first prediction; generating a second permutation that is a second assignment of the plurality of streamed data sources to the plurality of transmitters for transmission; generating a second prediction of whether and how much data from the plurality of streamed data sources will need to be stored prior to transmission based on the second permutation, the respective amounts of data to be generated by the plurality of streamed data sources, the transmission priorities and the bandwidths of the plurality of transmitters; generating a second allocation of storage space sizes that the plurality of streamed data sources will need based on the second permutation and the second prediction; and determining whether to retain the first permutation or the second permutation based on the first and second allocations.

There is also described herein, a computer program comprising a set of computer program instructions that, when executed by one or more computer processors of a computing system cause the computing system to perform a method comprising: identifying transmission priorities for a plurality of streamed data sources, wherein each of streamed data sources is configured to generate a respective amount of data, and wherein the transmission priorities indicate a transmission order associated with the plurality of streamed data sources; generating a first permutation that is a first assignment of the plurality of streamed data sources to a plurality of transmitters for transmission; generating a first prediction of whether and how much data from the plurality of streamed data sources will need to be stored prior to transmission based on the first permutation, the respective amounts of data to be generated by the plurality of streamed data sources, the transmission priorities and bandwidths of the plurality of transmitters; generating a first allocation of storage space sizes that the plurality of streamed data sources will need based on the first permutation and the first prediction; generating a second permutation that is a second assignment of the respective amounts of data to be generated by the plurality of streamed data sources to the plurality of transmitters for transmission; generating a second prediction of whether and how much data from the plurality of streamed data sources will need to be stored prior to transmission based on the second permutation, the transmission priorities and the bandwidths of the plurality of transmitters; generating a second allocation of storage space sizes that the plurality of streamed data sources will need based on the second permutation and the second prediction; and determining whether to retain the first permutation or the second permutation based on the first and second allocations.

There is also described herein a computer-readable storage medium having stored thereon a computer program comprising a set of computer program instructions that, when executed by one or more computer processors of a computing system cause the computing system to perform a method comprising: identifying transmission priorities for a plurality of streamed data sources, wherein each of streamed data sources is configured to generate a respective amount of data, and wherein the transmission priorities indicate a transmission order associated with the plurality of streamed data sources; generating a first permutation that is a first assignment of the plurality of streamed data sources to a plurality of transmitters for transmission; generating a first prediction of whether and how much data from the plurality of streamed data sources will need to be stored prior to transmission based on the first permutation, the respective amounts of data to be generated by the plurality of streamed data sources, the transmission priorities and bandwidths of the plurality of transmitters; generating a first allocation of storage space sizes that the plurality of streamed data sources will need based on the first permutation and the first prediction; generating a second permutation that is a second assignment of the plurality of streamed data sources to the plurality of transmitters for transmission; generating a second prediction of whether and how much data from the plurality of streamed data sources will need to be stored prior to transmission based on the second permutation, the respective amounts of data to be generated by the plurality of streamed data sources, the transmission priorities and the bandwidths of the plurality of transmitters; generating a second allocation of storage space sizes that the plurality of streamed data sources will need based on the second permutation and the second prediction; and determining whether to retain the first permutation or the second permutation based on the first and second allocations.

There is also described herein a computer system comprising: a computer processor; and a memory having stored therein a computer program comprising a set of computer program instructions that, when executed by one or more computer processors of a computing system cause the computing system to perform a method comprising: identifying transmission priorities for a plurality of streamed data sources, wherein each of streamed data sources is configured to generate a respective amount of data, and wherein the transmission priorities indicate a transmission order associated with the plurality of streamed data sources; generating a first permutation that is a first assignment of the plurality of streamed data sources to a plurality of transmitters for transmission; generating a first prediction of whether and how much data from the plurality of streamed data sources will need to be stored prior to transmission based on the first permutation, the respective amounts of data to be generated by the plurality of streamed data sources, the transmission priorities and bandwidths of the plurality of transmitters; generating a first allocation of storage space sizes that the plurality of streamed data sources will need based on the first permutation and the first prediction; generating a second permutation that is a second assignment of the plurality of streamed data sources to the plurality of transmitters for transmission; generating a second prediction of whether and how much data from the plurality of streamed data sources will need to be stored prior to transmission based on the second permutation, the respective amounts of data to be generated by the plurality of streamed data sources, the transmission priorities and the bandwidths of the plurality of transmitters; generating a second allocation of storage space sizes that the plurality of streamed data sources will need based on the second permutation and the second prediction; and determining whether to retain the first permutation or the second permutation based on the first and second allocations.

There is also described herein a vehicle comprising a computer system comprising: a computer processor; and a memory having stored therein a computer program comprising a set of computer program instructions that, when executed by one or more computer processors of a computing system cause the computing system to perform a method comprising: identifying transmission priorities for a plurality of streamed data sources, wherein each of streamed data sources is configured to generate a respective amount of data, and wherein the transmission priorities indicate a transmission order associated with the plurality of streamed data sources; generating a first permutation that is a first assignment of the plurality of streamed data sources to a plurality of transmitters for transmission; generating a first prediction of whether and how much data from the plurality of streamed data sources will need to be stored prior to transmission based on the first permutation, the respective amounts of data to be generated by the plurality of streamed data sources, the transmission priorities and bandwidths of the plurality of transmitters; generating a first allocation of storage space sizes that the plurality of streamed data sources will need based on the first permutation and the first prediction; generating a second permutation that is a second assignment of the plurality of streamed data sources to the plurality of transmitters for transmission; generating a second prediction of whether and how much data from the plurality of streamed data sources will need to be stored prior to transmission based on the second permutation, the respective amounts of data to be generated by the plurality of streamed data sources, the transmission priorities and the bandwidths of the plurality of transmitters; generating a second allocation of storage space sizes that the plurality of streamed data sources will need based on the second permutation and the second prediction; and determining whether to retain the first permutation or the second permutation based on the first and second allocations.

The features, functions, and advantages that have been discussed can be achieved independently in various examples or can be combined in yet other examples further details of which can be seen with reference to the following description and drawings.

The various advantages of the examples will become apparent to one skilled in the art by reading the following specification and appended claims, and by referencing the following drawings, in which:.

Turning now to <FIG>, a conventional storage buffer allocation process <NUM> and an enhanced storage buffer allocation process <NUM> are illustrated. In the conventional storage buffer allocation process <NUM>, storage is only analyzed from an overall perspective rather than on a buffer-by-buffer basis leading to inefficiency, lost data and poor memory allocations. The enhanced storage buffer allocation process <NUM> is executed with a PST tool (e.g., a computing system, computing device, non-transitory computer readable storage medium, etc.). As will be explained in further detail below, the enhanced storage buffer allocation process <NUM> provides a granular analysis of storage capacity that will be required by various data sources. For example, some vehicles (e.g., an aircraft, a ground vehicle, watercraft, spacecraft such as a satellite, space telescope, or space vehicle, etc.) transmit information to a base station during transit. The information can be stored on-board the vehicle prior to transmission for various reasons (e.g., bandwidth limitations). Examples as related to the enhanced storage buffer allocation process <NUM> determine an individual amount of storage space that each data source (e.g., sensor(s)) will need for buffering information during transit. For example, the enhanced storage buffer allocation process <NUM> may include predicting amounts of data storage that each of the data sources will individually utilize. A storage space is divided into buffers based on the predicted amounts so that each respective data source has an adequate amount of data storage associated with the respective data source. That is, granular buffer storage amounts are set in order to avoid situations in which the data sources generate an amount of data that exceeds buffer storage limits. Doing so reduces data loss during transit and efficiently allocates resources to reduce data storage overhead.

Examples as related to the enhanced storage buffer allocation process <NUM> include a live data failure detection where the PTS tool detects where live data is predicted to not be fully transmitted. Doing so enables the PST tool and/or a user to identify such cases, and further allows an automated selection of data storage characteristics to prevent and/or reduce data omission. Thus, even though some live data (e.g., live imagery) never buffers (e.g., no allocation of any buffer memory to live imagery because the live imagery data is always transmitted live or immediately), the PST tool still considers the live data as part of the below modelling process. If the PST tool shows that live data is being dropped in the model, then the PST tool detects that a current (or projected) data rate for the mission fails and the data rate must be changed so the live data will not be dropped.

Turning now to conventional storage buffer allocation process <NUM>, a conventional data storage graph <NUM> is illustrated. The conventional data storage graph <NUM> shows an overall data storage pattern throughout transit of a vehicle (e.g., aircraft, a ground vehicle, watercraft, a spacecraft such as an artificial satellite, space telescope, or space vehicle, etc.). The conventional data storage graph <NUM> can be a projected amount of data (e.g., an estimation, etc.) that will be generated. Data that cannot be transmitted, will be stored in the conventional buffers <NUM> unless the conventional buffers <NUM> are at full capacity. In such an event, data is dropped as the data cannot be stored or transmitted, and is therefore discarded.

In conventional storage buffer allocation process <NUM>, there are three different types of data. Specifically, there is first data, second data, and third data. Each of the three different types of data originates with a different data source (e.g., sensor, computing device, etc.). For example, a camera can generate the second data (e.g., live imagery data), while a global positioning satellite system can generate the first data.

Based on the conventional data storage graph <NUM>, the conventional storage buffer allocation process <NUM> allocates <NUM> GB of storage to each of the first data, the second data, and the third data. Each of the first, second, and third conventional storage buffers 104a, 104b, 104c has allocated one gigabyte of storage space. The first, second, and third conventional storage buffers 104a, 104b, 104c can be part of a same storage. Thus, the space of the same storage is equally distributed among the first, second, and third conventional storage buffers 104a, 104b, 104c.

A transmitter <NUM> transmits data from the conventional buffers <NUM> to a ground station <NUM>. The transmitter <NUM> transmits the data during transit (e.g., a flight, mission, etc.) of the vehicle, and completes transmission of all data prior to the transit ending. Any data that cannot be immediately transmitted is stored in the conventional buffers <NUM> until the transmitter <NUM> is available. When the transmitter <NUM> is available, the data is transmitted and deleted from storage in the conventional buffers <NUM>. Data that is not transmitted is stored in the conventional buffers <NUM>.

The transmitter <NUM> transmits data according to the priority table 106a. First data has a priority of one meaning that the first data is transmitted first. The second data has a priority of two, meaning that second data is transmitted second and after all of the first data has been transmitted, or in some cases concurrently therewith if sufficient bandwidth exists for concurrent transmission. Sufficient bandwidth exists when the second data and third data have a combined transmission amount that is equal to or below the maximum available bandwidth of the transmitter <NUM>. The third data has a priority of three, meaning that the third data is transmitted last and after the first data and second data have been transmitted (or in some cases concurrently therewith if sufficient bandwidth exists). Thus, data is transmitted based on priorities assigned to the data and/or the data sources that generate the data.

At around two seconds as indicated on the conventional data storage graph <NUM>, the third data is unable to be stored in the third conventional storage buffer 104c. In detail, the third conventional storage buffer 104c is fully occupied as illustrated by the "occupied space. " That is, the bandwidth of the transmitter <NUM> is consumed by transmitting the first data and/or the second data. As such, the transmitter <NUM> does not have available bandwidth to transmit the third data to alleviate congestion in the third conventional storage buffer 104c. Thus, the third data accumulates in the third conventional storage buffer 104c until the third conventional storage buffer 104c is fully occupied. When the third conventional storage buffer 104c is fully occupied, incoming third data can no longer be stored in the third conventional storage buffer 104c unless other third data is removed from the third conventional storage buffer 104c.

Thus, the conventional storage buffer allocation process <NUM> fails to transmit all data since some of the third data is not stored in the third conventional storage buffer 104c. As such, the conventional storage buffer allocation process <NUM> results in incomplete data transmissions. Furthermore, the conventional storage buffer allocation process <NUM> allocates excess storage space to both the first conventional storage buffer 104a and the second conventional storage buffer 104b as illustrated by the free spaces. In contrast, the third conventional storage buffer 104c is not allocated sufficient space and therefore cannot store all data. That is, the conventional storage buffer allocation process <NUM> does not allocate storage in a real-life and usage based manner. As a consequence, the conventional storage buffer allocation process <NUM> fails to transmit all data.

That is, the conventional data storage graph <NUM> is based on all the data (the sum of all data types including the first data, second data, and third data) for a permutation (e.g., an arrangement of data sources to a particular transmitter that will transmit data from the data sources). For example, the conventional storage buffer allocation process <NUM> assigns the first data, second data, and third data to the transmitter <NUM> as one permutation. Other unillustrated permutations exists with other unillustrated transmitters and data sources (e.g., the first data is assigned to a different transmitter). The conventional data storage graph <NUM> implies that there is only one value for storage at a given time. Such a generalized analysis fails to identify the granular storage spaces that are required by the data sources. For example, the utilized storage will increase if the bandwidth of the transmitter <NUM> is insufficient to transmit some stored data and it will decrease if the transmitter <NUM> has enough data to transmit real time and storage data.

Turning now to the enhanced storage buffer allocation process <NUM>, an efficient storage allocation is illustrated. In the enhanced storage buffer allocation process <NUM> each of the first data, the second data, and the third data is shown at a granular level with respect to time and storage size in enhanced data storage graph <NUM>. Each of the first data, the second data, and the third data originates with a different data source (e.g., sensor) similar to the above. The enhanced data storage graph <NUM> can anticipate data storage, and is based on the bandwidth of the transmitter <NUM>, the priorities of the different data types (e.g., first data, second data, and third data) as well as a projected amount of each data type.

The exact amount of data storage of each data type with respect to time is shown in the enhanced data storage graph <NUM>. For example, at time equals two seconds it can be understood that that over <NUM> GB of storage space is needed by the third data. Further, at around <NUM> seconds, it can be understood that around <NUM> gigabytes of storage space is needed for the third data. In contrast, less than <NUM> gigabytes is ever needed for the first data, and less than. <NUM> gigabytes of data is ever needed for the second data. The second data is shown in more detail at area <NUM>, which shows a greater detail in <FIG>. In <FIG> it can be seen that the second requires less than <NUM> gigabytes of storage space.

The enhanced data storage graph <NUM> is generated based on the priorities of the data, the bandwidth of the transmitter <NUM>, and a predicted amount of data that will be generated during transit. That is, the enhanced storage buffer allocation process <NUM> predicts how much of the first data, the second data and the third data will be generated during transit, and how effectively the transmitter <NUM> can transmit the generated data to determine how much data will not be immediately transmitted and thus will be stored.

In some examples of the enhanced storage buffer allocation process <NUM>, the PST data includes live data failure detection. In detail, the second data is live data which should not be stored and should always be immediately transmitted. In such a case, the transmitter <NUM> can simultaneously transmit the first and second data. If the second data is illustrated in the enhanced data storage graph <NUM>, the PST tool can determine that the current bandwidth allocations of the transmitter <NUM> are ineffective to meet the requirement that the live data is immediately transmitted, and modify parameters. For example, the parameters can include bandwidth allocations of the transmitter <NUM> and/or storage allocations of the enhanced storage buffers <NUM>. After the modification, the PST tool can generate the enhanced data storage graph <NUM> based on the modified parameters and determine if the modified parameters result in meeting the requirement that the live data is immediately transferred.

The transmitter <NUM> transmits data to the ground station <NUM> based on the priority table 124a. In the enhanced storage buffer allocation process <NUM>, second data (which is associated with a first data source) has a priority of one and is transmitted first, first data (which is associated with a second data source) has a priority of two and is transmitted second, and third data has a priority of three and is transmitted third.

Allocations of data storage space (e.g., storage space sizes) are determined based on the enhanced data storage graph <NUM>. The first enhanced storage buffer 122a will store the first data, the second enhanced storage buffer 122b will store the second data, and the third enhanced storage buffer 122c will store the third data. Therefore, the first enhanced storage buffer 122a has a total storage capacity of <NUM> gigabytes, the second enhanced storage buffer 122B has a total storage capacity of <NUM> gigabytes while the third enhanced storage buffer 122C has a storage capacity of <NUM> gigabytes. Therefore, even at time equals <NUM> seconds, the third data will be able to be stored in the third enhanced storage buffer 122c. In the conventional storage buffer allocation process <NUM>, third data cannot be stored in the third conventional storage buffer 104c at time equals <NUM> seconds. Indeed, throughout the entirety of the enhanced data storage graph <NUM>, the third enhanced storage buffer 122c is able to sufficiently store the third data to avoid dropping of any data.

Furthermore, the total storage required by the first enhanced storage buffer 122a, the second enhanced storage buffer 122b, and the third enhanced storage buffer 122c is less than the total space required by the first conventional storage buffer 104a, second conventional storage buffer 104b, and the third conventional storage buffer 104c. Thus, the enhanced storage buffer allocation process <NUM> not only allocates resources effectively to reduce dropping of information, but utilizes less resources in order to do so. As such, the enhanced storage buffer allocation process 120as described herein enhances computer efficiency and resource utilization to effectively transmit data while in transit.

In some examples of the enhanced storage buffer allocation process <NUM>, the maximum storage values of the first data, the second data, and the third data from the enhanced data storage graph <NUM> are used to feed classifiers and select permutations based on the max values and other parameters. Thus, the enhanced storage buffer allocation process <NUM> can include different combinations of data with different transmitters. In some examples of the enhanced storage buffer allocation process <NUM>, enhanced storage buffers <NUM> and transmitter <NUM> form a telemetry unit. The enhanced storage buffer allocation process <NUM> allows user to optimized buffer allocations for each type of data based on each permutations which could be uniform or non-uniform distribution based on hardware and design capability.

<FIG> illustrates various permutations <NUM>. A vehicle includes first, second, third, and fourth data sources <NUM>, <NUM>, <NUM>, <NUM>, first telemetry unit <NUM> and second telemetry unit <NUM>. A first permutation 202a allocates first data source <NUM> and second data source <NUM> to a first telemetry unit <NUM> (which includes buffers and a transmitter), and a third data source <NUM> and a fourth data source <NUM> to a second telemetry unit <NUM> (which includes buffers and a transmitter). A second permutation 202b allocates first data source <NUM> and third data source <NUM> to the first telemetry unit <NUM>, and a second data source <NUM> and a fourth data source <NUM> to the second telemetry unit <NUM>. A third permutation 202c allocates fourth data source <NUM> and third data source <NUM> to the first telemetry unit <NUM>, and the second data source <NUM> and the first data source <NUM> to the second telemetry unit <NUM>. A fourth permutation 202d allocates second data source <NUM>, first data source <NUM>, and third data source <NUM> to the first telemetry unit <NUM>, and the fourth data source <NUM> to the second telemetry unit <NUM>.

Each respective permutation of the first through the fourth permutations (hereinafter "first-fourth") 202a-202d can be analyzed according to the enhanced storage buffer allocation process <NUM> to determine if the respective permutation meets certain metrics. The metrics include whether all data will be transmitted prior to a transit (e.g., mission) of the vehicle completing. If not, the respective permutation is abandoned and will not be utilized. If the data will complete transmission prior to the transit ending, the respective transmission is analyzed further to determine how much storage space will be utilized by the respective permutation. A permutation with the least amount of storage space and that will complete prior to transit completion is selected as the final permutation, and storage spaces sizes are allocated to match the storage spaces sizes of the permutation as determined by the enhanced storage buffer allocation process <NUM>.

In some examples, permutations which result in an amount of data of the plurality of streamed data sources being greater than a maximum available size of buffers associated with the first or second telemetry units <NUM>, <NUM> are discarded. For example, suppose that the fourth permutation 202d results in one or more of the first, second, and third data sources <NUM>, <NUM>, <NUM> having a storage size that is greater than a maximum available size of a buffer of the first telemetry unit <NUM>. The fourth permutation 202d can be discarded. In contrast, permutations of the first-fourth 202a-202d are maintained when an amount of data of the plurality of streamed data sources is less than an available size of buffers associated with the first and second telemetry units <NUM>, <NUM>.

<FIG> shows a method <NUM> of storing and transmitting data. The method <NUM> is generally implemented by any of the examples described herein, for example,
the enhanced storage buffer allocation process <NUM> (<FIG>) and/or various permutations <NUM> (<FIG>) can be executed in conjunction with method <NUM>.

In some examples, the method <NUM> is implemented at least partly in one or more modules as a set of logic instructions stored in a non-transitory machine- or computer-readable storage medium such as random access memory (RAM), read only memory (ROM), programmable ROM (PROM), firmware, flash memory, etc., in configurable logic such as, for example, programmable logic arrays (PLAs), field programmable gate arrays (FPGAs), complex programmable logic devices (CPLDs), in fixed-functionality logic hardware using circuit technology such as, for example, application specific integrated circuit (ASIC), complementary metal oxide semiconductor (CMOS) or transistor-transistor logic (TTL) technology, or any combination thereof.

Illustrated processing block <NUM> initializes all memory buffers to zero. Illustrated processing block <NUM> puts all data for an iteration (which corresponds to a slice of time during transit) into a buffer. Illustrated processing block <NUM> determines if a bandwidth is sufficient for highest priority data. The bandwidth corresponds to a transmitter that will transmit the data. If not, illustrated processing block <NUM> transmits a portion of the highest priority data and stores a remainder of the highest priority data in, for example, a corresponding buffer. If the bandwidth is sufficient for the highest priority data, illustrated processing block <NUM> transmit all of highest priority data. Illustrated processing block <NUM> reduces the current priority (e.g., decrements the priority by one). Illustrated processing block <NUM> determines if the bandwidth is sufficient for current priority data. If not, illustrated processing block <NUM> transmits as much of the current priority data as the bandwidth permits. Illustrated processing block <NUM> then determines if the current iteration is the last iteration. If not, illustrated processing block <NUM> executes again. Otherwise, the method <NUM> ends. If processing block <NUM> determines that the bandwidth is sufficient for the current priority data, illustrated processing block <NUM> transmits all of the current priority data (in addition to the highest priority data), and illustrated processing block <NUM> executes again to reduce the current priority and analyze whether further lower priority data can be transmitted in the following processing blocks.

<FIG> shows a method <NUM> of generating allocations. The method <NUM> is generally implemented by any of the examples described herein, for example, the enhanced storage buffer allocation process <NUM> (<FIG>), various permutations <NUM> (<FIG>) and/or method <NUM> (<FIG>).

Illustrated processing block <NUM> identifies transmission priorities for a plurality of streamed data sources, where the transmission priorities indicate a transmission order associated with the plurality of streamed data sources. Illustrated processing block <NUM> generates a first permutation that is a first assignment of the plurality of streamed data sources to a plurality of transmitters for transmission. Illustrated processing block <NUM> generates a first prediction of whether data from the plurality of streamed data sources will need to be stored prior to transmission based on the first permutation, the transmission priorities and bandwidths of the plurality of transmitters. Illustrated processing block <NUM> generates a first allocation of storage space sizes that the plurality of streamed data sources will need based on the first permutation and the first prediction.

In a first example of the method <NUM>, the plurality of streamed data sources is associated with a vehicle, and the method <NUM> further includes determining whether to maintain or discard the first allocation of the storage space sizes based on whether data generated by the plurality of streamed data sources will be transmitted prior to a completion of an operation by the vehicle. In a second example, the method <NUM> assigns first and second streamed data sources from the plurality of streamed data sources to a first transmitter from the plurality of transmitters. The second example can be combined with a third example in which the method <NUM> determines a first amount of data that the first streamed data source will generate, determines a second amount of data that second streamed data source will generate, and determines the first allocation of the storage space sizes based on the first and second amounts. In a fourth example that can be combined with the second and third examples, the method <NUM> determines that the first streamed data source is associated with a first transmission priority from the transmission priorities, determines that the second streamed data source is associated with a second transmission priority from the transmission priorities and determines based on the first and second transmission priorities, that the first streamed data source is to have data transmitted by the first transmitter before data from the second streamed data source is transmitted by the first transmitter and determines the first allocation of the storage space sizes based on the first streamed data source having data transmitted by the first transmitter before data from the second streamed data source is transmitted by the first transmitter.

In a fifth example that is combinable with any of the examples of the method <NUM>, the method <NUM> generates a second permutation that is a second assignment of the plurality of streamed data sources to the plurality of transmitters for transmission, generates a second prediction of whether data from the plurality of streamed data sources will need to be stored prior to transmission based on the second permutation, the transmission priorities and the bandwidths of the plurality of transmitters, generates a second allocation of storage space sizes that the plurality of streamed data sources will need based on the second permutation and the second prediction and determines whether to retain the first permutation or the second permutation based on the first and second allocations. In a sixth example that is combinable with any of the examples of the method <NUM>, the method <NUM> determines whether to maintain or discard the first permutation based on whether an amount of data of the plurality of streamed data sources is less than an available size of buffers associated with the plurality of transmitters.

<FIG> shows a method <NUM> of generating permutations. The method <NUM> is generally implemented by any of the examples described herein. The method <NUM> is generally implemented by any of the examples described herein, for example, the enhanced storage buffer allocation process <NUM> (<FIG>), various permutations <NUM> (<FIG>), method <NUM> (<FIG>) and/or method <NUM> (<FIG>).

Illustrated processing block <NUM> generates a new permutation that is an assignment of the plurality of streamed data sources to a plurality of transmitters for transmission. Illustrated processing block <NUM> generates a prediction of whether data from the plurality of streamed data sources will need to be stored prior to transmission based on the first permutation, transmission priorities and bandwidths of the plurality of transmitters. Illustrated processing block <NUM> predicts an allocation of storage space sizes that the plurality of streamed data sources will need based on the first permutation and the first prediction. Illustrated processing block <NUM> determines if another new permutation is possible. If so, illustrated processing block <NUM> executes again. Otherwise, illustrated processing block <NUM> selects one of the permutations as a final permutation, for example based on the enhanced storage buffer allocation process <NUM>, and allocates buffers accordingly. For example, processing block <NUM> selects the most efficient permutation (e.g., utilizes the least amount of memory and completes prior to a completion of transit).

<FIG> illustrates a telemetry architecture <NUM>. A plurality of data sources <NUM> are coupled with telemetry unit <NUM>. The telemetry unit <NUM> includes a telemetry processor and controller, buffers assigned to different priorities and a multiplexer. The telemetry unit transmits data through the radio frequency transmitter <NUM> to a ground station.

Example sizes/models/values/ranges can have been given, although examples are not limited to the same. Arrangements can be shown in block diagram form in order to avoid obscuring examples, and also in view of the fact that specifics with respect to implementation of such block diagram arrangements are highly dependent upon the computing system within which the example is to be implemented, i.e., such specifics should be well within purview of one skilled in the art. The term "coupled" can be used herein to refer to any type of relationship, direct or indirect, between the components in question, and can apply to electrical, mechanical, fluid, optical, electromagnetic, electromechanical, or other connections. In addition, the terms "first", "second", etc. can be used herein only to facilitate discussion, and carry no particular temporal or chronological significance unless otherwise indicated.

As used in this application and in the claims, a list of items joined by the term "one or more of' can mean any combination of the listed terms. For example, the phrases "one or more of A, B, or C" can mean A; B; C; A and B; A and C; B and C; or A, B, and C.

Claim 1:
A method comprising:
identifying (<NUM>) transmission priorities (124a) for a plurality of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>), wherein each of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>) is configured to generate a respective amount of data, and wherein the transmission priorities (124a) indicate a transmission order associated with the plurality of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>);
generating (<NUM>) a first permutation (202a) that is a first assignment of the plurality of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>) to a plurality of transmitters (<NUM>, <NUM>) for transmission;
generating (<NUM>) a first prediction of whether and how much data from the plurality of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>) will need to be stored prior to transmission based on the first permutation (202a), the respective amounts of data to be generated by the plurality of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>), the transmission priorities (124a) and bandwidths of the plurality of transmitters (<NUM>, <NUM>);
generating (<NUM>) a first allocation of storage space sizes (122a, 122b, 122c) that the plurality of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>) will need based on the first permutation (202a) and the first prediction;
generating a second permutation (202b) that is a second assignment of the plurality of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>) to the plurality of transmitters (<NUM>, <NUM>) for transmission;
generating a second prediction of whether and how much data from the plurality of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>) will need to be stored prior to transmission based on the second permutation (202b), the respective amounts of data to be generated by the plurality of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>), the transmission priorities (124a) and the bandwidths of the plurality of transmitters (<NUM>, <NUM>);
generating a second allocation of storage space sizes (122a, 122b, 122c) that the plurality of streamed data sources (<NUM>, <NUM>, <NUM>, <NUM>) will need based on the second permutation (202b) and the second prediction; and
determining whether to retain the first permutation (202a) or the second permutation (202b) based on the first and second allocations.