Method and system for correcting burst errors in communications networks, related network and computer program product

Field of the invention

The present invention relates to techniques that enable correction of burst errors in communications networks.

In a specific way, the invention relates to techniques for modifying dynamically the level of redundancy for forward error correction (FEC) on the basis of the conditions of noise on the channel.

The invention has been developed with particular attention paid to its possible use in wireless local-area networks (WLANs), but can be applied to all communications networks that may be exposed to loss of information (loss-prone networks).

Description of the related art

The growing number of applications that use transport protocols of an unreliable type, such as the UDP (Unreliable Datagram Protocol), renders necessary the adoption of techniques for the recovery of the lost packets to obtain error-resistant transmissions, above all in the case where the transmission occurs on error-prone communications networks, such as for example wireless networks.

An excessive packet-loss rate can very markedly reduce the quality of the received data. One of the techniques for recovery of lost packets (which preserves the quality of the data) uses the Reed-Solomon (RS) error-correction code. This technique envisages the generation of (n-k) redundant packets (FEC packets) for each block of k packets of transmitted data. The FEC packets are transmitted together with the data flow in order to protect the received data from losses. This type of solution enables protection of the data of up to a maximum of (n-k) lost packets every n packets transmitted.

The disadvantages in the use of this technique regard optimal assignment of the parameters n and k for error correction. The parameters can be chosen so as to maximize efficiency in terms of useful data using an error correction that is precise to the point of compensating exactly the level of loss and nothing else.

It is hence necessary to reach a balance between the amount of information added by the error-correction code (which uses bandwidths that could be used for useful data and thus causes reduction in the efficiency of transmission of the data) and the minimum amount of error-correction packets necessary on the basis of the conditions of the channel (which can be useful to increase the efficiency of transmission of the data, avoiding retransmissions).

Strictly connected to the above disadvantages is the problem of the distribution of the recurrences (occurrences) of the lost packets. In effect, a loss model can have a more or less important effect on the resulting distortion at the receiver end, and hence accurate models for forecasting losses may represent a valid aid for minimizing the resulting distortion.

In particular, burst losses have a given recurrence on loss-prone networks, particularly wireless networks, and generally cannot be easily or completely recovered. In the presence of burst errors, the techniques based upon the simple calculation of the mean packet error rate (PER) are those that afford the worst performance.

FEC packets generated by error-correction codes, such as the Reed-Solomon code, on account of their capacity for recovering more than one packets in a data block, are a good tool against burst distribution of losses.

In the presence of burst losses, the FEC packets can be more effective if they are used together with an interleaving technique.

Interleaving techniques enable random burst losses to be more sparse within the data flow and are based on the solution of transmitting the packets not in their sequential order but according to a different order, defined by a pre-set law. An example of pre-defined order is the one shown in Figure 1.

In particular, in Figure 1 first all the packets "pck0" of the t blocks are transmitted in order starting from the packet "pck0" of block "0" up to the packet "pck0" of block "t-1", then all the packets "pck1" are transmitted always in the same order, and so on up to the packets "pck(k-1)". After the k packets of all the t blocks have been transmitted, the n FEC packets are transmitted once again in the same order.

The number of blocks designed to be interleaved is chosen taking into account the need to render sparse the errors and respecting constraints in terms of decoding delay, which are particularly important for real-time applications (before starting the operation of decoding, all the blocks involved in interleaving must have been received).

The problem can be reduced to the operation of finding the optimal values for the following parameters: <ul id="ul0001" list-style="dash" compact="compact"><li>number k of data packets to be protected with the FEC packets;</li><li>number (n-k) of FEC packets that protect the k data packets computed at the previous step; and</li><li>depth of interleaving (understood as the number of blocks that are involved in interleaving).</li></ul>

The purpose of the above procedure is to enable maximization of the efficiency of transmission of the useful data and minimization of the residual losses (losses of the data packets) at the receiver end.

Various known methods for providing error correction typically supply a fixed number of FEC packets, without considering the expedience of increasing/decreasing the efficiency of transmission on the basis of detection of variations in the condition of congestion or noise on the channel.

Other known solutions propose a dynamic modification of the percentage of packets that are introduced for correcting transmission errors. The majority of these solutions do not prove, however, suitable for modelling and exploiting the measurement of the level of burstiness of the error model to improve protection in regard to errors. The mean packet error rate by itself is not a good reference parameter for representing the actual characteristics of the error model because, in the presence of burst losses, the mean packet error rate is usually much lower than the burst packet error rate.

The example of Figure 2 shows a model that comprises 64 packets, in which a "1" denotes a packet that has been received, a "0" denotes a lost packet, and an "X" denotes a rejected packet.

The burst consists of the twelve packets designated in Figure 2 by the reference "burst" that starts with a rejected packet X and ends with a lost packet 0. The first correct-reception interval, designated by "gap", begins at the start of the session, and the second correct-reception interval terminates at the end of transmission. Half-way between the two correct-reception intervals there is precisely the burst-error interval designated by "burst".

The parameter Gmin is the minimum distance in the received packets between two lost/rejected packets so that a loss can be considered as belonging to a correct-reception interval.

For example, if the parameter Gmin is adjusted at the value 16, the burst density is 0.33 (4 lost or rejected packets divided by the total number of 12 expected packets) and the density of the correct-reception interval is 0.04 (2 lost or rejected packets divided by the total number of 52 expected packets). Consequently, the loss rate is 9.4%.

As has been said, Figure 2 provides a real trace of the errors, where "1" means that the packet has been received and "0" that the packet has been lost. The mean PER (calculated dividing the sum of the lost and/or rejected packets by the total number of expected packets) is 9.4%. Introduction of a FEC only on the basis of this parameter will render non-recoverable all the losses in the burst interval (i.e., 33% of the expected packets). On the other hand, the FEC introduced in the correct-reception interval is useless.

Other known solutions propose dynamic methods for flexible adaptation of the error-correction capacity for recovering the lost packets and simultaneously adapting the data rate in such a way as not to increase the total data rate, applying a number of FEC packets. These methods are usually based upon the responses transmitted by the receiver to the transmitter.

As regards specifically the patent literature, the document <patcit id="pcit0001" dnum="US5699365A"><text>US-A-5 699 365</text></patcit> describes a method and an apparatus for adaptive forward error correction in data-communication systems. This solution envisages dynamic variation of the error-correction parameters on the basis of the conditions of the communication channel, as well as the level of noise and the error rate.

In the method proposed in the document <patcit id="pcit0002" dnum="US5699365A"><text>US-A-5 699 365</text></patcit>, data are received, which have a current degree of forward error correction, and a channel parameter is controlled, such as, for example, the bit error rate or packet error rate. A threshold level is moreover defined for the channel parameter, and the channel parameter controlled is compared with said threshold level. When the channel parameter does not fall within a pre-set or adaptable range of variance of the threshold level, a new modified parameter of forward error correction is selected, which has a higher or lower degree of capacity for forward error correction. This modified error-correction parameter is transmitted on the channel. The device that receives the modified error-correction parameter transmits the data encoded using the new modified error-correction parameter.

The document <patcit id="pcit0003" dnum="WO2004040831A"><text>WO-A-2004/040831</text></patcit> describes a solution applied to packet-transmission networks. An adaptive scheme of error control performed at the application level is proposed, at the same time enabling a maximum tolerated packet error rate to be respected. According to the scheme proposed, the amount of redundancy is adapted so as to afford a possibility of error correction enabling the maximum tolerated error rate to be respected. The maximum tolerated error rate is established by the particular application.

The document <patcit id="pcit0004" dnum="CA2430218"><text>CA 2 430 218</text></patcit> describes an adaptive error-correction technique based upon the noise bursts in which the rate of occurrence of these bursts is measured. The error-correction parameters are determined using statistics that describe the duration and period of the noise bursts. The occurrences, duration and period of the noise bursts are determined by the length of the error vector calculated during the decoding process.

The document <patcit id="pcit0005" dnum="US5181207A"><text>US-A-5 181 207</text></patcit> describes a mechanism for correcting errors in a digital data stream encoded by the transmitter and transmitted on a communication channel to a receiver and decoded by the receiver for recovering the digital data pre-encoded using a parity encoder. The position of the errors is determined by an operation of comparison, on the basis of which the receiver can generate a mask of the model of the errors in the received digital data stream. This mask of the error model is used in an preventive iterative error-correction process for identifying the position of the burst errors contained in the data recovered and for modifying the output of the host decoder of the receiver in a controllable way so as to eliminate the errors identified from the data originally decoded.

The document <patcit id="pcit0006" dnum="US2004015765A"><text>US-A-2004/015765</text></patcit> describes an adaptable and dynamic scheme of error correction for a communication channel. The method calculates the real bit error rate in order to make a comparison with a reference bit error rate. When a channel provides a performance better than the required performance, the power of forward error correction can be reduced in order to provide a better efficiency. If the real bit error rate calculated is higher than the reference bit error rate, then the power of error correction is increased in an attempt to reduce the bit error rate. A feedback loop is used for continuous calculation of the modified bit error rates whilst the power of error correction is increased or decreased.

The document <patcit id="pcit0007" dnum="US6741569A"><text>US-A-6 741 569</text></patcit> describes a subjective quality-control system for multimedia-signal packet-transmission systems that evaluates the parameters of a statistical model that represents the probability of the packet-transmission system that is in a condition of low losses or in a condition of high losses and uses said evaluations of the parameters for predicting the subjective quality of the multimedia signal. The quality-control system contains a plurality of quality-control functions located in the point of conversion between multimedia signal and packet.

Object and summary of the invention

From the foregoing description of the current situation, it emerges that there exists the need to define solutions capable of treating, in a more satisfactory way, burst error correction in communications networks.

The object of the present invention is to meet the aforesaid need.

In accordance with the present invention, the above object is achieved by a method having the characteristics recalled in the claims that follow. The present invention also relates to a corresponding system, a network comprising said system, as well as a computer-program product, loadable into the memory of at least one computer and comprising software code portions for implementing the aforesaid method. As used herein, the reference to such a "computer-program product" is to be understood as being equivalent to the reference to a medium that can be read by a computer and contains instructions for controlling a computer system in order to co-ordinate execution of the method according to the invention. The reference to "at least one computer" is aimed at highlighting the possibility for the present invention to be implemented in a distributed and/or modular way.

The annexed claims form an integral part of the disclosure of the invention provided herein.

Basically, the solution described herein uses detailed information on the description of the error model (see, for example, the document "RTP Control Protocol Extended Reports (RTCP XR)" Network Working Group RFC 3611, available on line at the date of filing of the present application on the web site at the address <u style="single">http://www.ietf.org/rfc/rfc3611.txt?number=3611</u>) and defines the method for using this information in order to derive the percentage of FEC packets and the interleaving factor.

In the currently preferred embodiment, the solution described herein is based upon the information transmitted from the receiver to the transmitter. The information includes the mean packet error rate (PER) but also some supplementary statistical information that aims at characterizing the loss model better in terms of length and recurrence of the burst losses. The transmitter uses all the statistical information for calculating the best level of protection to apply.

Brief description of the drawings

The invention will now be described, by way of non-limiting example, with reference to the annexed figures of drawing, wherein: <ul id="ul0002" list-style="dash" compact="compact"><li>Figures 1 and 2, referring to the prior art, have already been described previously;</li><li>Figure 3 shows an example of a domestic scenario of application of the solution described herein; and</li><li>Figure 4 shows an example of transmission on a communications network in the framework of the present invention.</li></ul>

Detailed description of examples of embodiment of the invention

For reasons of simplicity and as typical example of application of the proposed solution, the domestic scenario of continuous flow of packet data shown in Figure 3 is considered, in which a user or client 140 wishes to receive a video program (stream) from a server 100 through an access point 120 and by means of a wireless card, for example of the 802.11x type. The variations in conditions of the wireless connection in this typical domestic environment, due to the effect of propagation or interference of traffic generated by other devices present, may cause the loss of some packets (it is possible to consider another PC in the same home that has access to the Internet via the same server and through the same access point).

A way for controlling the quality of the transmission and of the connection is provided by the statistical information signalled by a control protocol, such as for example RTCP (Real-Time Transfer Control Protocol), in the periodic responses that the receiver sends to the transmitter. In particular, as for example in the solution described herein, it is possible to consider more detailed metrics, such as the ones defined in the document "RTP Control Protocol Extended Reports (RTCP XR)" Network Working Group RFC 3611. These metrics are to be considered supplementary with respect to the ones envisaged of the normal RTCP report.

Figure 4 shows an example of transmission, on a communications network based upon a real-time protocol (such as RTP), between a transmitter 200 and a receiver 220 by means of a communication channel 240.

The transmission channel 240 is prone to loss of information. On the channel 240 blocks of data (Block 0, Block 1...) are sent, each of which contains the k data packets to be transmitted (pck0, pck1, ... pck(k-1)) and the (n-k) error-correction packets (FEC0, FEC1, ... FEC(n-k-1)). At pre-set intervals, the receiver 220 sends to the transmitter 200 periodic responses 260 containing information and metrics on the transmission by means of the extended reports (XRs).

The document RFC 3611 defines statistics capable of describing in a very detailed way the losses that have occurred during a period of observation between two successive report blocks: the losses are described not only in terms of mean PER, but also in terms of length of the burst, length of the correct-reception interval, and density (where a burst is a period during which the rate of loss/rejection of packets is large enough to cause of a considerable degradation of quality, whilst a correct-reception interval is a period during which there is a rare occurrence lost/rejected packets, and hence the resulting quality is generally very good).

The main idea of the solution described herein is the definition of a method that uses the characteristics of the bursts and of the correct-reception interval as parameters for identifying optimal values for the parameters k and (n-k) of forward error correction to maximize the efficiency of transmission of the data and minimize the residual losses.

The sequel of the present description makes express reference to some parameters appearing in RTP documents, such as: <ul id="ul0003" list-style="dash" compact="compact"><li>"A Transport Protocol for Real-Time Applications", Network Working Group RFC 3550, <u style="single">http://www.ietf.org/rfc/rfc3550.txt?number=3550</u>; and</li><li>"RTP Control Protocol Extended Reports (RTCP XR)", Network Working Group RFC 3611, <u style="single">http://www.ietf.org/rfc/rfc3611.txt?number=3611</u>.</li></ul>

The first of the aforesaid parameters is the PER. The packet error rate or the rate of loss of the packet is perhaps the simplest metrics that can be computed to evaluate the conditions of transmission. If the interval between two reception reports is considered, the difference in the cumulative number of lost packets gives the number of lost packets during the interval. The difference in the progressive numbers between the last packets of two successive reception reports yields the number of packets expected during the interval. The ratio of these two values (lost packets and expected packets) is the fraction of loss of packets over the interval. This ratio is equal to the fraction of lost packets only if the two reception reports are successive; otherwise it is not. Furthermore, the duplicated packets will not be counted as received packets, whereas the packets will be counted as lost if they are rejected on account of delayed arrival.

Another parameter is the so-called burst length. As used herein "burst" means a sequence of packets that has the following characteristics: <ul id="ul0004" list-style="none" compact="compact"><li>i) it starts with a lost or rejected packet;</li><li>ii) it does not contain any occurrence of Gmin consecutively received packets (where Gmin is the minimum distance in received packets between two lost/rejected packets so that a loss can be considered to belong to a correct-reception interval);</li><li>iii) it concludes with a lost or rejected packet.</li></ul>

Another parameter is then represented by the correct-reception interval or "gap". The correct-reception interval is defined as a period with low packet losses and/or rejects (i.e., the period of time of correct reception between two bursts).

The bursts and the correct-reception intervals are characterized by a density. The burst density is the fraction of data packets that have been lost or rejected during the burst period from the start of reception. The density of the correct-reception interval is the fraction of the data packets that have been lost or rejected within the correct-reception intervals between successive bursts from the start of reception.

The following parameters are moreover defined: <ul id="ul0005" list-style="dash" compact="compact"><li>k as <i>output_par-&gt;data</i> (number of data packets to be protected with the FEC packets);</li><li>(n-k) as <i>output_par-&gt;redundancy</i> (number of FEC packets that protect the k data packets);</li><li><i>output_par-&gt;rate</i> as new rate at which the application must encode the new data once the parameters <i>output_par-&gt;data</i> and <i>output_par-&gt;redundancy</i> have been computed;</li><li><i>output_par-&gt;interleaving</i> as interleaving depth;</li><li><i>xr-&gt;burst_length, xr-&gt;burst_density, xr-&gt;g_min</i> e <i>xr-&gt;gap_length</i>, as metrics signalled (in mean values) by the extended reports; and</li><li><i>input_par-&gt;startrate</i> as index of initial encoding of the application.</li></ul>

The solution proposed herein enables determination of the optimal values for the FEC parameters in the following way: <ul id="ul0006" list-style="none" compact="compact"><li>the number of data packets to be protected by means of the FEC packets (the k data in a block, <i>output_par-&gt;data</i>) is computed as the sum of the mean burst length and of Gmin minus the mean number of effective losses in a burst (<i>errors_in_burst</i>), then the number of FEC packets (the redundancy, <i>output_par-&gt;redundancy</i>) is adjusted at the same value as the parameter <i>errors_in_burst</i>.</li></ul>

The above operations can be translated into the following pseudo-code: <ul id="ul0007" list-style="none" compact="compact"><li><i>data = xr-&gt;burst_length + xr-&gt;g</i>_<i>min</i></li><li><i>loss_rate = xr-&gt;burst_density</i></li><li><i>errors_in_burst=xr-&gt;burst_length*xr-&gt;burst_density</i>/<i>100</i></li><li><i>output_par-&gt;rate=input_par-&gt;startrate*(1-loss_rate</i>/<i>100)</i></li><li><i>output_par-&gt;data = data - errors_in_burst</i></li><li><i>output_par-&gt;redundancy = errors_in_burst</i></li></ul>

Calculation of a new value for the <i>output par-&gt;rate</i> parameter is necessary in order not to exceed the available bandwidth. Furthermore, the value of the length of the correct-reception interval plus the length of the burst can be used for fixing the interleaving depth, as indicated in what follows: <maths id="math0001" num=""><math display="block"><mrow><mi mathvariant="italic">output_par</mi><mo>-</mo><mo>&gt;</mo><mi mathvariant="italic">interleaving</mi><mo>=</mo><mrow><mo>(</mo><mi mathvariant="italic">xr</mi><mo>-</mo><mo>&gt;</mo><mi mathvariant="italic">gap_length</mi><mo>+</mo><mi mathvariant="italic">xr</mi><mo>-</mo><mo>&gt;</mo><mi mathvariant="italic">burst_length</mi><mo>)</mo><mo>/</mo><mi mathvariant="italic">xr</mi><mo>-</mo><mo>&gt;</mo><mi mathvariant="italic">burst_length</mi><mo mathvariant="italic">;</mo></mrow></mrow></math><img file="EP1710941A1_D0001.tif" /></maths>

The advantage provided by the solution described herein is representing by the fact that good (if not excellent) values are achieved for the number k of data packets in a block, for the number (n-k) of FEC packets, and for the number of packets to be interleaved, proceeding not by trial-and-error, as in the case of decisions based upon the packet error rate (PER), but following upon application of a rule.

A confirmation of the advantages afforded by the solution described herein is provided by simulations obtained using data streams that present a loss model obtained from transmission on LAN wireless networks. A transmission data stream (duration 125 sec) is considered, during which there has been detected a mean packet error rate of approximately 18.3%. The first test, the results of which are given in what follows, is an evaluation of the reduction of the losses (in terms of residual losses, i.e., of data packets lost) when (n-k) FEC packets are applied to blocks each with k packets.

The value n is a fixed parameter, such as the interleaving depth, whilst (n - k) is computed dynamically with respect to the rate of losses or "loss_rate" (PER) signalled periodically in the response reports.

The number (n-k) of FEC packets is computed according to the following rules: <ul id="ul0008" list-style="dash" compact="compact"><li>if the loss rate is 0 &lt; loss_rate &lt; 3%, then no action is taken;</li><li>if the loss rate is 3% &lt;= loss_rate &lt; 10%, then, in a block of n packets, 10% are FEC packets;</li><li>if the loss rate is 10% &lt;= loss_rate &lt; 20%, then, in a block of n packets, 20% are FEC packets;</li><li>if the loss rate is 20% &lt;= loss_rate &lt; 30%, then, in a block of n packets, 30% are FEC packets;</li><li>if the loss rate is 30% &lt;= loss rate &lt; 40%, then, in a block of n packets, 40% are FEC packets; and so forth.</li></ul>

The duration of the period monitored, starting from a value of 500 ms, changes on the basis of the time necessary for the complete reception of the packets comprised in an interleaving block. The results presented in Table 1 show the average residual losses obtained applying said rules and varying the interleaving parameter depth.

On account of constraints on the decoding delay (30 packets per block and 30 blocks per interleaving depth means that there is to be expected the reception of 900 packets before start of decoding), as best value may be considered the value of the residual data losses in the last row and column in Table 1 appearing below. It should be noted that this value has been obtained after a given number of attempts. <tables id="tabl0001" num="0001"><table frame="all"><title><b>Table 1</b></title><tgroup cols="7" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="17mm" colsep="1" /><colspec colnum="2" colname="col2" colwidth="10mm" colsep="1" /><colspec colnum="3" colname="col3" colwidth="24mm" colsep="1" /><colspec colnum="4" colname="col4" colwidth="31mm" colsep="1" /><colspec colnum="5" colname="col5" colwidth="29mm" colsep="1" /><colspec colnum="6" colname="col6" colwidth="31mm" colsep="1" /><colspec colnum="7" colname="col7" colwidth="27mm" colsep="1" /><thead><row><entry namest="col1" nameend="col1" align="center" valign="top">Length</entry><entry namest="col2" nameend="col2" align="center" valign="top">n</entry><entry namest="col3" nameend="col3" align="center" valign="top">Loss rate (%)</entry><entry namest="col4" nameend="col4" align="center" valign="top">Data-block length (k)</entry><entry namest="col5" nameend="col5" align="center" valign="top">Redundancy (%)</entry><entry namest="col6" nameend="col6" align="center" valign="top">Interleaving depth</entry><entry namest="col7" nameend="col7" align="center" valign="top">Residual losses</entry></row></thead><tbody><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">10</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">7.62</entry><entry namest="col5" nameend="col5" align="center" valign="top">23.78</entry><entry namest="col6" nameend="col6" align="center" valign="top">-</entry><entry namest="col7" nameend="col7" align="center" valign="top">11.943</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">20</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">15.72</entry><entry namest="col5" nameend="col5" align="center" valign="top">21.19</entry><entry namest="col6" nameend="col6" align="center" valign="top">-</entry><entry namest="col7" nameend="col7" align="center" valign="top">12.15</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">30</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">23.79</entry><entry namest="col5" nameend="col5" align="center" valign="top">20.43</entry><entry namest="col6" nameend="col6" align="center" valign="top">-</entry><entry namest="col7" nameend="col7" align="center" valign="top">11.73</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">30</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">23.78</entry><entry namest="col5" nameend="col5" align="center" valign="top">20.48</entry><entry namest="col6" nameend="col6" align="center" valign="top">2</entry><entry namest="col7" nameend="col7" align="center" valign="top">10.46</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">30</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">23.77</entry><entry namest="col5" nameend="col5" align="center" valign="top">20.51</entry><entry namest="col6" nameend="col6" align="center" valign="top">3</entry><entry namest="col7" nameend="col7" align="center" valign="top">10.27</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">30</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">23.69</entry><entry namest="col5" nameend="col5" align="center" valign="top">20.61</entry><entry namest="col6" nameend="col6" align="center" valign="top">5</entry><entry namest="col7" nameend="col7" align="center" valign="top">9.528</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">30</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">23.73</entry><entry namest="col5" nameend="col5" align="center" valign="top">20.61</entry><entry namest="col6" nameend="col6" align="center" valign="top">7</entry><entry namest="col7" nameend="col7" align="center" valign="top">10.04</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">30</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">23.7</entry><entry namest="col5" nameend="col5" align="center" valign="top">20.6</entry><entry namest="col6" nameend="col6" align="center" valign="top">9</entry><entry namest="col7" nameend="col7" align="center" valign="top">9.63</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">30</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">23.65</entry><entry namest="col5" nameend="col5" align="center" valign="top">20.71</entry><entry namest="col6" nameend="col6" align="center" valign="top">11</entry><entry namest="col7" nameend="col7" align="center" valign="top">9.1</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">30</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">23.6</entry><entry namest="col5" nameend="col5" align="center" valign="top">20.71</entry><entry namest="col6" nameend="col6" align="center" valign="top">15</entry><entry namest="col7" nameend="col7" align="center" valign="top">9.71</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">30</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">23.57</entry><entry namest="col5" nameend="col5" align="center" valign="top">20.61</entry><entry namest="col6" nameend="col6" align="center" valign="top">20</entry><entry namest="col7" nameend="col7" align="center" valign="top">9.53</entry></row><row><entry namest="col1" nameend="col1" align="center" valign="top">125 sec</entry><entry namest="col2" nameend="col2" align="left" valign="top">30</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">16.05</entry><entry namest="col4" nameend="col4" align="center" valign="top">23.4</entry><entry namest="col5" nameend="col5" align="center" valign="top">20.75</entry><entry namest="col6" nameend="col6" align="center" valign="top">30</entry><entry namest="col7" nameend="col7" align="center" valign="top">8.38</entry></row></tbody></tgroup></table></tables>

Applying the solution described herein to assign in an optimal way the number of FEC packets and the interleaving parameters on the basis of the same percentage of redundancy, almost the same optimal value for the residual losses can be obtained, as shown by the results given in Table 3.

In order to render homogeneous the comparison between the data appearing in Table 1 and Table 3, the best case has been given again in Table 1 (obtained for n=30 and interleaving parameter equal to 30) using a period for the response reports fixed at 2700 ms. The same value has been used for the test in Table 3. <tables id="tabl0002" num="0002"><table frame="all"><title><b>Table 2</b></title><tgroup cols="5" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="15mm" colsep="1" /><colspec colnum="2" colname="col2" colwidth="30mm" colsep="1" /><colspec colnum="3" colname="col3" colwidth="24mm" colsep="1" /><colspec colnum="4" colname="col4" colwidth="29mm" colsep="1" /><colspec colnum="5" colname="col5" colwidth="32mm" colsep="1" /><thead><row><entry namest="col1" nameend="col1" align="center" valign="top">Length</entry><entry namest="col2" nameend="col2" align="center" valign="top">Period monitored</entry><entry namest="col3" nameend="col3" align="center" valign="top">Loss rate (%)</entry><entry namest="col4" nameend="col4" align="center" valign="top">Redundancy (%)</entry><entry namest="col5" nameend="col5" align="center" valign="top">Residual losses (%)</entry></row></thead><tbody><row><entry namest="col1" nameend="col1" align="center" valign="top">90 sec</entry><entry namest="col2" nameend="col2" align="center" valign="top">2700 ms</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">18.29</entry><entry namest="col4" nameend="col4" valign="top" align="char" char="." charoff="41">19.52</entry><entry namest="col5" nameend="col5" valign="top" align="char" char="." charoff="40">7.92</entry></row></tbody></tgroup></table></tables>

As may be noted from Table 3, in the case where the number of FEC packets and the interleaving parameter are dynamic and calculated as proposed in this patent, values of residual losses very close to those of the optimal case given in Table 2 are obtained. <tables id="tabl0003" num="0003"><table frame="all"><title><b>Table 3</b></title><tgroup cols="5" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="15mm" colsep="1" /><colspec colnum="2" colname="col2" colwidth="30mm" colsep="1" /><colspec colnum="3" colname="col3" colwidth="24mm" colsep="1" /><colspec colnum="4" colname="col4" colwidth="29mm" colsep="1" /><colspec colnum="5" colname="col5" colwidth="32mm" colsep="1" /><thead><row><entry namest="col1" nameend="col1" align="center" valign="top">Length</entry><entry namest="col2" nameend="col2" align="center" valign="top">Period monitored</entry><entry namest="col3" nameend="col3" align="center" valign="top">Loss rate (%)</entry><entry namest="col4" nameend="col4" align="center" valign="top">Redundancy (%)</entry><entry namest="col5" nameend="col5" align="center" valign="top">Residual losses (%)</entry></row></thead><tbody><row><entry namest="col1" nameend="col1" align="center" valign="top">90 sec</entry><entry namest="col2" nameend="col2" align="center" valign="top">2700 ms</entry><entry namest="col3" nameend="col3" valign="top" align="char" char="." charoff="40">18.29</entry><entry namest="col4" nameend="col4" valign="top" align="char" char="." charoff="41">19.61</entry><entry namest="col5" nameend="col5" valign="top" align="char" char="." charoff="40">8.54</entry></row></tbody></tgroup></table></tables>

In conclusion, the experimental data confirm that the use of the metric provided by RTCP XR (in particular, as regards the density of the bursts and the length of the correct-reception intervals) and the adoption of this method is a good solution in order to arrive, by means of a rule (and hence not by means of attempts), at the optimal values for the parameters k and (n-k) and at the value of interleaving depth for maximizing the efficiency of the data and minimizing the data losses.

Consequently, without prejudice the principle of the invention, the details of implementation and the embodiments may vary, even significantly, with respect to what is described and illustrated herein purely by way of non-limiting example, without thereby departing from the scope of the invention, as defined by the ensuing claims.