Method of putting a flow of packets of a network for transporting packets of variable length into conformity with a traffic contract

Abstract

The present invention concerns a method of putting a flow of packets of a network for transporting packets of variable length into conformity with a traffic contract. The method is of the type which consists, at each arrival of a packet, of comparing the time of this arrival with a theoretical arrival time and, if this arrival time is earlier than the theoretical time arrival time and, if this arrival time is earlier than the theoretical time by more than the jitter tolerance defined in the contract, destroying the packet or not further processing the packet, otherwise retransmitting the packet and then determining the theoretical arrival time for the next packet. According to the invention, it is characterized in that, in order to determine the theoretical arrival time for the next packet, it consists of adding a time ti related to the present packet i and which is a function ƒ of the theoretical arrival time TATi and if the actual arrival time θi of the packet i to an interpacket time Ti which is a function g of the negotiated time per unit length T defined in the traffic contract and of the length λi of the current packet i.

Description

The present invention concerns a method of putting a flow of packets of a network for transporting packets of variable length into conformity with a traffic contract. Such a method is used in such a network for controlling compliance with traffic contracts reached between the users and the network and thus providing these same users with a performance guarantee.

Such methods of putting packet traffic back into conformity are already known, but for networks for transporting packets of fixed length, such as the cells in the ATM (Asynchronous Transfer Mode) networks.

The specific characteristics of the ATM networks which have made it possible to solve the various problems related to the performance guarantee are as follows.

ATM networks transport cells which are of fixed length which makes it possible to predict the mutual impact of the communications established and therefore allows controllable multiplexing schemes to be put in place. The traffic contract which is negotiated at the time the communication is established defines at least two parameters which are respectively the minimum time between two cell transmissions T (which is the inverse of the peak rate also referred to as “Peak Cell Rate” or “PCR”) and the propagation time jitter tolerance τ (also referred to as “Cell Delay Variation” or “CDV”) which can alter the intercell time. This tolerance τ covers the propagation time variations due to the multiplexing of cells. In more developed traffic contracts, it also accounts for the irregularities due to a source transmitting cells in unpredictable bursts.

ATM networks are generally provided with means for implementing a method of putting a flow of cells into conformity with the traffic contract mentioned previously as well as a method of reformatting the individual flows of cells restoring the original characteristics of the flow perturbed cumulatively by the jitter so as to put them back into conformity with the traffic contract or simply reduce the jitter in order to provide a better fluidity of the network.

For example, according to a known method of putting a flow of cells into conformity, the actual arrival time of a cell is compared with its Theoretical Arrival Time, hereinafter denoted TAT. If it is less than this theoretical arrival time by an amount greater than the jitter tolerance τ, the cell is deemed to be too early and is then destroyed. Otherwise, it is transmitted and the theoretical arrival time for the next cell is updated by adding, either to the actual arrival time or to the theoretical arrival time, according to the greater of these two times, the minimum time between two cell transmissions.

It should also be noted that, according to this method, if a cell arrives earlier than its theoretical arrival time, it is the theoretical arrival time which is used for the updating. If it arrives later than its theoretical arrival time, it is its actual arrival time which is used for the updating. This implementation avoids the phenomenon of silence followed by a burst.

As for a known method of reformatting the individual flows of cells, this can be implemented in a spacing controller which no longer works on the arrival times of the cells, but on the retransmission times of the said cells.

The method described above, which establishes a virtual schedule of the theoretical arrival times of the cells and verifies at the time of the arrival of a cell that its theoretical arrival time conforms, is effective only because it is used in networks transporting packets which are of fixed length, such as the cells of ATM networks, with the result that the useful time consumed by the sending of each cell of any queue in the said network is fixed and can be determined.

However, this fixed size can prove highly constraining from the point of view of certain applications, and in particular applications which are low-speed but with a considerable real-time constraint, such as voice communication services. For example, this has led to specifying, in connection with and supplementary to the ATM standard, a superposed switching and multiplexing mode (AAL 2 ) inserting, inside the cells of an ATM logical channel (“virtual channel” or VC), “mini-cells” of variable length limited to 48 (or 64) octets (generally to 48).

There is therefore a requirement for a method of putting a flow of packets into conformity with a traffic contract which is applicable to a network for transporting mini-cells and, more generally, packets of variable length. Such a method will provide a solution to the performance guarantee problem in such a network by allowing control of the traffic at the access and management of the flows.

The aim of the present invention is therefore to meet this requirement and propose a method of putting a flow of packets into conformity with a traffic contract which is applicable to a network for transporting packets of variable length.

To that end, a method of putting into conformity with a traffic contract according to the present invention consists, at each arrival of a packet, of comparing the time of this arrival with a theoretical arrival time and, if this arrival time is earlier than the said theoretical time by more than the jitter tolerance τ defined in the said traffic contract, destroying the said packet or not taking it into account, otherwise retransmitting the said packet and then determining the theoretical arrival time for the next packet. This method is characterised in that, in order to determine the said theoretical arrival time for the next packet, it consists of adding, on the one hand, a time t i related to the present packet i and which is a function ƒ of the theoretical arrival time TAT i and of the actual arrival time θ i of the said packet i to, on the other hand, an interpacket time T i which is a function g of the negotiated time per unit length T defined in the said traffic contract and of the length λ i of the current packet i:

TAT i+1 =t i +T i =ƒ( TAT i , θ i )+ g ( T , λ i )

Advantageously, the said interpacket time T i is equal to the product of the negotiated time per unit length T and the length λ i of the current packet i expressed in this same unit of length:

T i =g ( T, λ i )= T·λ i

As for the time related to the present packet t i , this is advantageously equal to the greater of the two times, the actual arrival time θ i of the current packet i, on the one hand, and the theoretical arrival time TAT i of the current packet i, on the other hand:

  t i =ƒ( TAT i , θ i )=max( TAT i , θ i )

Advantageously, t i is equal to θ i for the first packet.

The present invention also concerns a method of putting a flow of packets of a network for transporting packets of variable length into conformity with a traffic contract, of the type which consists, at each arrival of a packet, of determining the theoretical arrival time of the present packet, of comparing the actual time of this arrival with the said theoretical arrival time and, if this arrival time is earlier than the said theoretical time by more than the jitter tolerance, destroying the said packet or not taking it into account, otherwise retransmitting the said packet. It consists, in this case, in order to determine the said theoretical arrival time for the present packet, of adding, on the one hand, a time t i−1 related to the previous conforming packet i−1 and which is a function ƒ of the theoretical arrival time TAT i−1 and of the actual arrival time θ i−1 of the said packet i−1 to, on the other hand, an interpacket time T i which is a function g of the negotiated time per unit length T defined in the said traffic contract and of the length λ i of the current packet i:

TAT i =t i−1 +T i =ƒ( TAT i−1 , θ i−1 )+ g ( T, λ i )

Advantageously, the said interpacket time T i is equal to the product of the negotiated time per unit length T and the length λ i of the current packet i expressed in this same unit:

T i =g ( T, λ i )= T·λ i

As for the time related to the previous conforming packet i−1, this is advantageously equal to the greater of the two times: the actual arrival time θ i−1 of the said previous packet and its theoretical arrival time TAT i−1 :

t i−1 =ƒ( TAT i−1 , θ i−1 )=max( TAT i−1 , θ i−1 )

Advantageously, t i is equal to θ i for the first packet.

According to the two methods of the present invention described above, a packet which is deemed conforming is retransmitted at its actual arrival time θ i .

According to a variant of these two methods, a packet deemed conforming but arriving at a time θ i earlier than its theoretical arrival time TAT i is retransmitted at the expiry of the theoretical arrival time related to the said packet, then denoted TRT i .

The characteristics of the invention mentioned above, as well as others, will emerge more clearly from a reading of the following description of example embodiments, the said description being given in relation to the accompanying drawings, among which:

FIG. 1 is a diagram showing the different steps of a method according to a first embodiment of the present invention,

FIG. 2 is a timing diagram showing the processing of six packets by a method according to a first embodiment of the present invention,

FIG. 3 is a diagram showing the different steps of a method according to a second embodiment of the present invention,

FIG. 4 is a timing diagram showing the processing of six packets by a method according to a second embodiment of the present invention.

The present invention concerns a method of putting a flow of packets of a network for transporting packets of variable length into conformity with a traffic contract. The traffic contract which is negotiated at the time of the establishment of the communication defines two parameters which are respectively a negotiated time per unit length T (which is for example the inverse of the peak octet rate of the application, the unit of length then being the octet) and the propagation time jitter tolerance τ which can alter the interpacket time.

The jitter tolerance τ covers the variability in propagation time of packets in a network with queues. According to the method of the present invention, the variability in the length of packets generated by the source is known explicitly and taken into account during calculation of the virtual schedule. The necessity of a burst tolerance when it is introduced in ATM for accounting for the behaviour of a source which segments data packets into cells is therefore removed.

As can be seen in FIG. 1 , at the arrival of a packet i, its arrival time θ i is compared, at a step 10 , with a theoretical arrival time TAT i which was previously determined at a step 20 . If this actual arrival time θ i is less than the theoretical arrival time TAT i by an amount greater than the jitter tolerance τ, that is to say, if the following relationship is verified:

θ i <TAT i −τ

Then the packet i is deemed as having arrived too early and is destroyed in a step 30 . Otherwise, it is retransmitted immediately.

The theoretical arrival time TAT i+1 , for the next packet i+1 is updated at the step 20 . It is the calculation of the theoretical arrival time TAT i+1 , of the next packet or TAT i of the current packet which is characteristic of the present invention.

According to a first embodiment, the theoretical arrival time TAT i+1 of the following packet i+1 is equal to a time t i related to the current packet i and which is a function ƒ of the theoretical arrival time TAT i of the current packet i and of its actual arrival time θ i , to which there is added an interpacket time T i which is a function g of the negotiated time per unit length T defined in the traffic contract and of the length λ i of the current packet i, with the result that the following can be written:

TAT i+1 =t i +T i =ƒ( TAT i , θ i )+ g ( T, λ i )

For example, the time t i =ƒ(TAT i , θ i ) is equal to the greater of the two times, the arrival time θ i of the current packet i, on the one hand, and the theoretical arrival time TAT i of the current packet i, on the other hand. This then gives:

t i =ƒ( TAT i , θ i )=max( TAT i , θ i )

Moreover, the interpacket time T i is for example equal to the product of the negotiated time per unit length T defined in the traffic contract and the length λ i , of the current packet i expressed in this same unit of length. This then gives:

T i =g ( T,λ i )= T·λ i

In these two cases combined, the following can therefore be written:

TAT i+1 =max( TAT i , θ i )+ T·λ i

TAT i is equal to θ i at the arrival of the first packet.

It should be noted that the negotiated time T which is defined in the traffic contract corresponds to a minimum imaginary delay per unit length, for example the octet.

FIG. 2 depicts a timing diagram showing the implementation of the method which has just been described in the case of six packets P 1 to P 6 of lengths λ 1 to λ 6 respectively equal to 4, 8, 4, 6, 10 and 6 units.

The first packet P 1 arrives at the time θ 1 . It is retransmitted immediately and its arrival time θ 1 serves as a reference for calculating the theoretical arrival time of the following packet (which amounts to writing that TAT 1 =θ 1 ). Its length being 4 , the theoretical arrival time of the next packet P 2 is then equal to:

TAT 2 =θ 1 +4 T

The packet P 2 arrives at the time θ 2 corresponding to its theoretical arrival time TAT 2 . It is therefore retransmitted immediately. Its length being 8 , the theoretical arrival time TAT 3 is then calculated:

TAT 3 =θ 2 +8 T

The packet P 3 arrives at the time θ 3 which is earlier than the theoretical arrival time TAT 3 from which the jitter tolerance τ is subtracted. It is therefore destroyed. TAT 3 remains the reference theoretical arrival time for the following packet, the packet P 4 in the example of FIG. 2 .

The packet P 4 arrives at the time θ 4 which is earlier than the theoretical arrival time TAT 3 but situated inside the time interval defined by the jitter tolerance τ. It is therefore retransmitted straight away. Its length being 6 , the theoretical arrival time TAT 5 of the next packet is calculated:

TAT 5 =max( TAT 3 , θ 4 )+6 T=TAT 3 +6 T

The packet P 5 arrives at the time θ 5 which is later than the theoretical arrival time TAT 5 . It is therefore retransmitted straight away. Its length being 10 , the theoretical arrival time TRT 6 of the next packet is calculated:

TAT 6 =max( TAT 5 , θ 5 )+10 T =θ 5 +10 T

The process continues with the arrival of the packet P 6 .

FIG. 3 depicts another embodiment of the present invention.

According to this embodiment, at a step 120 implemented at the arrival time θ i of a packet i, the theoretical arrival time TAT i of the current packet i is determined by adding, to a time t i−1 related to the previous conforming packet i−1 and which is a function ƒ of the theoretical arrival time TAT i−1 of the previous packet i−1 and of its actual arrival time θ i−1 , an interpacket time T i which is a function g of the negotiated time per units length T defined in the said traffic contract and of the length λ i of the current packet i:

ti TAT i =t i−1 +T i =ƒ( TAT i−1 , θ i−1 )+ g ( T, λ i )

Like the previous embodiment, the time t i−1 =ƒ(TAT i−1 , θ i−1 ) is equal to the greater of the two times, the arrival time θ i−1 of the previous conforming packet i−1, on the one hand, and the theoretical arrival time TAT i−1 of the previous conforming packet i−1, on the other hand. This then gives:

t 1−1 =ƒ( TAT i−1 , θ i−1 )=max( TAT i−1 , θ i−1 )

Also, the interpacket time T i is advantageously equal to the product of the negotiated time T and the length λ i of the current packet i expressed in the same unit:

T i =g ( T, λ i )= T·λ i

The following can therefore be written:

TAT i =max( TAT i−1 , θ i−1 )+ T·λ i

At a step 110 , the actual arrival time θ i of the current packet i is compared with the theoretical arrival time TAT i which has just been calculated. If it is less than this theoretical time TAT i by more than the jitter tolerance τ the packet i is deemed nonconforming and is therefore destroyed at a step 130 . Otherwise, it is retransmitted.

FIG. 4 depicts a timing diagram showing the implementation of the method which has just been described in the case of six packets P 1 to P 6 of lengths λ 1 to λ 6 respectively equal to 4, 8, 6, 4, 10 and 6 arbitrary units.

The first packet P 1 arrives at the time θ 1 and is then retransmitted. The theoretical time TAT 1 is equal to this time θ 1 .

The packet P 2 , of length 8 , arrives at the time θ 2 and its theoretical arrival time TAT 2 is determined as being equal to:

TAT 2 =TAT i +8 T

As may be noted in the diagram of FIG. 4 , the time TAT 2 corresponds to the actual arrival time of the packet P 2 . The packet P 2 is therefore retransmitted.

The packet P 3 , of length 6 , arrives at the time θ 3 . The theoretical arrival time TAT 3 is determined:

TAT 3 =max( TAT 2 , θ 2 )+6 T=TAT 2 30 6 T

The actual arrival time θ 3 of the packet P 3 is earlier than this theoretical time TAT 3 but is within the interval defined by the jitter tolerance τ. The packet P 3 is therefore retransmitted.

The packet P 4 , of length 4 , arrives at the time θ 4 . The theoretical arrival time TAT 4 is determined:

TAT 4 =max( TAT 3 ,θ 3 )+4 T=TAT 3 +4 T

The actual arrival time θ 4 of the packet P 4 is earlier than this theoretical time TAT 4 from which the jitter tolerance τ has been subtracted. The packet P 4 which is therefore not conforming is destroyed.

The reference time for calculating the arrival time of the next packet therefore remains the time t 3 =max(TAT 3 , θ 3 ).

The packet P 5 , of length 10 , arrives at the time θ 5 . The theoretical arrival time TAT 5 is determined by the following equation:

TAT 5 =max( TAT 3 , θ 3 )+10 T=TAT 3 +10 T

The actual arrival time θ 5 of the packet P 5 is later than this theoretical time TAT 5 with the result that the packet P 5 is retransmitted.

The process continues with the arrival of the packet P 6 , of length 6 , at the time θ 6 . The theoretical arrival time of this packet becomes equal to:

TAT 6 =max( TAT 5 , θ 5 )+6 T=θ 5 +6 T

In the previous two embodiments, a packet i determined as being conforming by the corresponding comparison step 10 or 110 is retransmitted at its actual arrival time θ i .

It should be noted that, according to a variant of these two embodiments, a packet, instead of being retransmitted immediately after the comparison step 10 or 110 might be retransmitted (at the steps 50 or 150 respectively depicted in dotted lines in FIGS. 1 and 3 ) only at the theoretical arrival time TAT i , if it is greater than the actual arrival time θ i . “Theoretical Retransmission Time” TRT i is then referred to.

Thus, for example, according to the first embodiment, at the step 10 , the arrival time θ i of the current packet i is compared with the theoretical arrival time TAT i previously determined at the step 20 of the previous packet deemed conforming. If it is earlier than the said theoretical time by more than the jitter tolerance τ, the packet is deemed non-conforming and is destroyed at the step 30 . Otherwise, the packet is deemed conforming and is retransmitted in a step 50 at the expiry of TRT i =ƒ(TAT i , θ i ), for example equal to max(TAT i , θ i ).

The theoretical arrival time of the following packet is updated in the step 20 :

TAT i+1 =ƒ( TAT i , θ i )+ g ( T, λ i )= TRT i +g ( T,λ i )

In this case, as can be seen in FIG. 2 , the packets P 2 to P 6 are respectively retransmitted at the times TRT 2 to TRT 6 which are identical to the times TAT 2 to TAT 6 with the exception of TRT 5 which is equal to θ 5 .

According to the second embodiment, at the step 120 implemented at each arrival time θ i of a cell i, the theoretical arrival time TAT i of the said packet is calculated according to the following equation:

TAT i =max( TAT i−1 , θ i−1 )+ g ( T, λ i )

The arrival time θ i of the current packet i is next compared to the theoretical arrival time TAT i which has just been determined at the previous step 120 . If it is less than this theoretical time TAT i by more than the jitter tolerance τ, the packet is deemed non-conforming and is destroyed at the step 130 . Otherwise, the packet is deemed conforming and is retransmitted in a step 150 at the expiry of TRT i =ƒ(TAT i , θ i ), for example equal to max(TAT i , θ i ).

In this case, as can be seen in FIG. 4 , the packets P 2 to P 6 are respectively retransmitted at the times TRT 2 to TRT 6 which are identical to the times TAT 2 to TAT 6 with the exception of TRT 5 which is equal to θ 5 .

A method according to the present invention can be implemented at a network access interface. It can also be implemented in switching mechanisms of the network which incorporate calculation of the theoretical retransmission times for rearranging the packets belonging to different logical channels at the time they are multiplexed, or even for retransmitting them at the calculated theoretical times.

It should be noted that the packets which are processed by a method according to the present invention can belong to a single logical channel but also to a number of logical channels.

The packets can be of variable length on a logical channel. The packet length information λ i required by the method of the invention for implementation is then generally carried by the packets themselves which, in order to do this, have for example a length indication field. It can be deduced from the method of delimiting the packets at the time they are received.

The packets can be of constant length on each logical channel, in the case of a number of logical channels. This length is for example negotiated at the time of establishment of the connection and is transmitted to the system implementing the method of the invention in the same way as the other control parameters, namely the negotiated time T and the jitter tolerance τ.

A method according to the present invention allows better optimization of the resources inasmuch as it is the actual lengths of the packets which are taken into account in the admission and control mechanisms and not their permitted maximum values. The unknown factor introduced for example by the ATM burst tolerance (“Maximum burst size” represented by τ MBS ) is therefore removed by the method.

It should be noted that, according to the last embodiment of the present invention which effectively spaces out the packets according to their theoretical arrival time, the theoretical retransmission time TRT i is determined additively from the theoretical retransmission time TRT i−1 of the previous packet. This embodiment therefore preserves the order of the cells on the link.

The same applies for the other embodiments since the retransmission of a packet, if it takes place (if the packet is conforming), is concomitant with its arrival.

It has been possible to state that the use of the spacing function in the second embodiment of the present invention implicitly assigns a relative time priority to the short packets over the long packets issuing from different logical channels. This is due to the fact that each packet is delayed by a time proportional to its length: a long packet is subject to a greater effective delay than a short packet. Thus, the packets carrying voice information, a priori much shorter, will be attended to with priority over the longer data packets. The same would apply for the packets carrying service or control information which are generally very short and which would therefore be attended to with priority over those carrying user information.

Claims

1. Method of putting a flow of packets of a network for transporting packets of variable length into conformity with a traffic contract, the method consisting, at each arrival of a packet, of comparing the time of this arrival with a theoretical arrival time and, if this arrival time is earlier than the theoretical time by more than the jitter tolerance defined in the contract, destroying the packet or not further processing the packet, otherwise retransmitting the packet and then determining the theoretical arrival time for the next packet, characterised in that, in order to determine the theoretical arrival time for the next packet, it consists of adding a time ti related to the present packet i and which is a function ƒ of the theoretical arrival time TATi and of the actual arrival time θi of the packet i to an interpacket time Ti which is a function g of the negotiated time per unit length T defined in the traffic contract and of the length λi of the current packet i:TATi+1=ti+Ti=ƒ(TATi, θi)+g(T, λi).

2. Method of putting into conformity according to claim 1, characterised in that the interpacket time Ti is equal to the product of the negotiated time T defined in the traffic contract and the length λi of the current packet i expressed in the same unit:Ti=T·λi.

3. Method of putting into conformity according to claim 1, characterised in that the time ti is equal to the greater of the two times, the arrival time θi of the current packet i, on the one hand, and the theoretical arrival time TATi of the current packet i, on the other hand:ti=max(θi, TRTi).

4. Method of putting into conformity according to claim 3, characterised in that the time ti is equal to the actual arrival time θi for the first packet.

5. Method of putting a flow of packets of a network for transporting packets of variable length into conformity with a traffic contract, the method consisting, at each arrival of a packet, of determining the theoretical arrival time of the present packet, of comparing the time of this arrival with the theoretical arrival time arid, if this arrival time is earlier than the theoretical time by the jitter tolerance τ defined in the traffic contract, destroying the packet or not further processing the packet, otherwise retransmitting the packet, characterised in that, in order to determine the theoretical arrival time for the present packet, it consists of adding, on the one hand, a time ti−1 related to the previous conforming packet i−1 and which is a function ƒ of the theoretical arrival time TATi−1 and of the actual arrival time θi−1 of the said packet i−1 to, on the other hand, an interpacket time Ti which is a function g, on the one hand, of a negotiated time per unit length T defined in the traffic contract and, on the other hand, of the length λi of the current packet i:TATi=ti−1+Ti=ƒ(TATi−1, θi−1)+g(T, λi).

6. Method of putting into conformity according to claim 5, characterised in that the interpacket time Ti is equal to the product of the negotiated time T defined in the traffic contract and the length λi of the current packet i expressed in the same unit:Ti=T·λi.

7. Method of putting into conformity according to claim 5, characterised in that the time ti−1 which is related to the previous conforming packet i−1 and which is a function ƒ of its theoretical arrival time TATi−1 and of its actual arrival time θi−1 is equal to the greater of the two times, the arrival time θi−1 of the previous conforming packet i−1, on the one hand, and the theoretical arrival time TATi−1 of the previous conforming packet i−1, on the other hand:ti−1=max(θi−1, TATi−1).

8. Method of putting into conformity according to claim 7, characterised in that, for the first packet, it consists of making the theoretical arrival time TATi of the current packet i equal to the actual arrival time θi.

9. Method of putting into conformity according to one of the previous claims, characterised in that a packet deemed conforming is retransmitted at its actual arrival time θi.

10. Method of putting into conformity according to one of claims 1 to 8, characterised in that a packet deemed conforming but arriving at a time θi earlier than its theoretical arrival time TATi is retransmitted at the expiry of the theoretical time TATi related to the packet.