A method for traffic shaping of data frames to transmit in a telecommunication network, the frames to transmit being distinguished between: ∘ express frames, needing to be sent within predetermined time windows, ∘ and normal frames, intended to be sent at times outside said time windows (b)), wherein, for a current normal frame, the method comprises the steps of: - determining whether said normal frame can be fragmented (c)), and if yes: - determining whether a remaining time to the next predetermined time window opening is enough to transmit one or several fragments of said normal frame, and if yes: - transmitting said one or several fragments, characterized by - several flows are being processed and each flow comprises successive normal frames and, if any, one or several fragments remaining from a previous normal frame processing, - said normal frames and/or fragments of each flow are queued in a memory and are assigned with respective processing instants ( TT i), - a current time is compared (a)) with a least processing instant (min( TT i)) among all the queues of the respective flows so as to implement the transmission step as long as the current time is greater than said least processing instant (min( TT i)) and as long as the remaining time to the next predetermined time window is long enough to transmit a fragment from the queue with the least processing instant (min( TTi)), - said processing instants ( TT i) are updated at each scheduled transmission of a frame or a fragment, by estimating a duration of said scheduled transmission on the basis of a transmission flow bitrate ( r i), by dividing the length of the frame or fragment of a flow to be transmitted by the current bitrate ( r i) of that flow (i). ∘ express frames, needing to be sent within predetermined time windows, ∘ and normal frames, intended to be sent at times outside said time windows (b)), - determining whether said normal frame can be fragmented (c)), and if yes: - determining whether a remaining time to the next predetermined time window opening is enough to transmit one or several fragments of said normal frame, and if yes: - transmitting said one or several fragments, - several flows are being processed and each flow comprises successive normal frames and, if any, one or several fragments remaining from a previous normal frame processing, - said normal frames and/or fragments of each flow are queued in a memory and are assigned with respective processing instants ( TT i), - a current time is compared (a)) with a least processing instant (min( TT i)) among all the queues of the respective flows so as to implement the transmission step as long as the current time is greater than said least processing instant (min( TT i)) and as long as the remaining time to the next predetermined time window is long enough to transmit a fragment from the queue with the least processing instant (min( TTi)), - said processing instants ( TT i) are updated at each scheduled transmission of a frame or a fragment, by estimating a duration of said scheduled transmission on the basis of a transmission flow bitrate ( r i), by dividing the length of the frame or fragment of a flow to be transmitted by the current bitrate ( r i) of that flow (i).