WE CLAIM:
[Claim 1]
A method implemented by computer means of a communicating entity in a packet-switched network, said communicating entity comprising at least one port for transmitting communication signal frames, said frames comprising:
a first type of frames (SF), intended to be transmitted in a plurality of streams for which a traffic shaping is defined, and
a second type of frames (UF), for which no traffic shaping is defined, each frame being able to be fragmented so as to transmit a fragment only of a frame of said second type, wherein the communicating entity:
stores:
a plurality of first queues of frames of the first type, said first queues (Qi) being associated respectively to said plurality of streams, and at least one second queue (Qu) for frames of the second type,
and schedules:
transmissions of first type frames, and
between at least two first type frames, transmission of at least a fragment of at least one second type frame,
and wherein, for deciding to transmit a fragment only of a second type frame, the communicating entity determines:
whether the size of the fragment to be transmitted is greater than a threshold (MinFragSize), and
whether the size of a remaining fragment of said second type frame is greater than said threshold,
and otherwise prevents from fragment transmission. [Claim 2]
The method of claim 1, wherein each of said first and second queues is stored in a first-in-first-out type buffer (BUFF), and wherein a queue to which a

first type frame is assigned is determined according to the stream to which said first type frame belongs, depending on features of said first type frame. [Claim 3]
The method of claim 2, wherein said features of said first type frame include a frame length and a current rate of the stream to which said first type frame belongs,
and wherein a time taken for the transmission of each first type frame in
its queue is calculated and respective transmission times are scheduled for said
first type frames according to said respective times taken for the transmissions
of the first type frames. [Claim 4]
The method of claim 2 or claim 3, wherein a frame belonging to a shaped stream is selected for transmission by comparing scheduled transmission times (TTTi) of frames placed at the head of each first queue, the frame associated to the smallest scheduled transmission time (miniTTTi) being selected as a next candidate for transmission. [Claim 5]
The method of claim 4, wherein the communicating entity performs a time counting for determining a current time (T) and implements transmission of said next candidate if:
the scheduled transmission time (TTTk.) associated to said next candidate is smaller or equal to the current time (T), and if
no other first type frame is currently being transmitted , and if
no second type frame or fragment is currently being transmitted. [Claim 6]
The method according to anyone of claims 4 and 5, wherein the communicating entity determines whether a second type frame or frame

fragment is being transmitted, and if yes whether said second type frame or frame fragment can be further fragmented for interrupting a transmission of said second type frame or frame fragment, and allowing thereby a transmission of said next candidate. [Claim 7]
The method of claim 6, wherein the communicating entity implements a fragmentation of said second type frame or frame fragment:
if the size of said second type frame or frame fragment which transmission is to be interrupted is greater than said threshold (MinFragSize), and
if the size of a frame fragment to remain in said second queue after the interruption is greater than said threshold. [Claim 8]
The method according to anyone of the precedent claims, wherein the communicating entity performs a time counting for determining a current time and implements a second type frame fragmentation in view of fragment transmission:
if no first type frame is currently being transmitted, and
if no first type frame placed at a first queue head has a scheduled transmission time (TTTi) smaller or equal to the current time (T). [Claim 9]
The method according to anyone of claims 4 to 7, wherein said communicating entity inserts a probe frame (PF) at the head of at least one of the first queues comprising said next candidate for transmission, so as to avoid any latency of transmission of said next candidate. [Claim 10]
A communicating entity, comprising at least one port for transmitting communication signal frames in a packet-switched network, and further comprising a computer circuit for performing the method according to anyone of

the precedent claims. [Claim 11]
A computer program product, comprising instructions for performing the method as claimed in anyone of claims 1 to 9, when run by a processor.