Abstract: A method of ordonnancing packets belonging to different flows comprises: a step (E58) of queuing each packet in a queue associated with the flow of said packet; and for each of said queues processed cyclically, a step of sending packets contained in said queue up to a quota for said cycle; said method being characterized in that it further includes: a step (E40, E54) of determining the priority of said packet before said step (E58, E56, E48) of queuing, the priority packets being, firstly, the first packets of the inactive flows, namely the flows for which no packet has been received in said cycle, and, secondly, the packets of the active flows for which the volume of packets received in the cycle is less than the quota; and a step of sending with priority in said cycle packets determined to have priority during said determination step (E40, E54).

Abstract: The inventive method consists in determining a flow (F) to which belongs each new incoming packet (P), when said flow (F) is on a list of active flows, in introducing said packet into a fair share scheduling mechanism (6), when said flow (F) is absent from the list of active flows, in obtaining an estimation of the quantity of incoming data items (I.Bytes) with respect to said flow over a reference time period, in comparing said estimation with a maximum value (MaxBytes), wherein the reference time period or the maximum value are determined according to a fair share data rate, in adding said flow to the list of active flows and in introducing the packet (P) into the fair share scheduling mechanism (6), if said estimation exceeds the maximum value, and in introducing the packet (P) into the end of a priority queue (5), in the alternative case.

Abstract: The inventive method consists in determining a flow (F) to which belongs each new incoming packet (P), when said flow (F) is on a list of active flows, in introducing said packet into a fair share scheduling mechanism (6), when said flow (F) is absent from the list of active flows, in obtaining an estimation of the quantity of incoming data items (I.Bytes) with respect to said flow over a reference time period, in comparing said estimation with a maximum value (MaxBytes), wherein the reference time period or the maximum value are determined according to a fair share data rate, in adding said flow to the list of active flows and in introducing the packet (P) into the fair share scheduling mechanism (6), if said estimation exceeds the maximum value, and in introducing the packet (P) into the end of a priority queue (5), in the alternative case.

Abstract: A method of ordonnancing packets belonging to different flows comprises: a step (E58) of queuing each packet in a queue associated with the flow of said packet; and for each of said queues processed cyclically, a step of sending packets contained in said queue up to a quota for said cycle; said method being characterized in that it further includes: a step (E40, E54) of determining the priority of said packet before said step (E58, E56, E48) of queuing, the priority packets being, firstly, the first packets of the inactive flows, namely the flows for which no packet has been received in said cycle, and, secondly, the packets of the active flows for which the volume of packets received in the cycle is less than the quota; and a step of sending with priority in said cycle packets determined to have priority during said determination step (E40, E54).