Striping data over transmission channels

An apparatus operable to stripe time sensitive data over a plurality of transmission channels, wherein the time sensitive data includes a plurality of packets stored in a queue and at least one packet of the plurality of packets includes an expiration time, the apparatus comprising:

• a striping engine including
• an optimizer operable to
• access the expiration time of the at least one packet waiting to be striped,
• compute probabilities of timely receiving the at least one packet at a destination using the expiration time of the at least one packet and a length of the queue,
• store the computed probabilities in a table,
• retrieve the computed probabilities from the table for at least one other packet of the plurality of packets having the same expiration time as the at least one packet, and
• select a channel of the plurality of channels and a transmission error correction technique of a plurality of transmission error correction techniques based on the retrieved probabilities;
• and
• a mapper operable to assign the at least one other packet to be striped to the selected channel for transmission to the destination using the selected transmission error correction technique;
• and
• a network interface operable to transmit the at least one other packet to be striped on the selected channel using the selected transmission error correction technique.

A non-transitory computer readable medium storing executable instructions which, when executed by a processor, causes the processor to perform a method of striping data over a plurality of transmission channels having limited bandwidths and variable delays, the method comprising:

• accessing a plurality of packets of data to be striped over the plurality of channels, wherein the plurality of packets is stored in a queue and at least one packet of the plurality of packets includes an expiration time;
• accessing the expiration time of the at least one of said plurality of packets;
• computing probabilities of timely receiving the at least one packet at a destination using a recursive function, the expiration time for the at least one packet and a length of the queue storing the at least one packet waiting to be striped;
• storing the computed probabilities in a table;
• retrieving the computed probabilities from the table for at least one other packet of the plurality of packets having the same expiration time and queue length as the at least one packet;
• and
• mapping the at least one other packet to at least one of said plurality of channels based on the retrieved probabilities.