Abstract: The present invention relates to a method implemented in a packet-switched network for scheduling transmission of Ethernet frames, comprising the steps of: a) determining a priority level of each Ethernet frame to transmit, based on identification of data given in said Ethernet frame and related to a stream to which said Ethernet frame belongs, b) determining, among the frames having the highest priority level, a frame, candidate for transmission, having a closest next time at which said candidate frame is to be transmitted, and c) estimating an end-of-transmission time of said candidate, and checking whether a frame having a higher priority than the candidate does not have a next transmission time occurring before the end-of-transmission time of the candidate, and eventually transmitting the candidate.

Abstract: The invention relates to a method implemented in a packet-switched network for scheduling transmission of Ethernet frames, where a time of a next transmission of a future time-critical traffic frame (Express frame), among several time-critical traffic frames to transmit, is determined on the basis of respective priority levels of the time-critical traffic frames. The determination of this next transmission time allows a fair timing of transmission of such time-critical traffic frames which might belong to different streams. It makes possible also to transmit, before the aforesaid next transmission time, preemptable frames of non-time-critical traffic.

Abstract: The invention relates to a method for transmitting messages in a network having a communication mode involving publisher and subscriber devices over the network, the method comprising:—an extraction of payloads (DataSetMessages) of received messages, and a concatenation of said payloads within a same combined message,—addition of a header to said combined message, aid header comprising a single identifier of a publisher device (PublisherId=k), said publisher identifier being predetermined so as to intend the combined message to at least one chosen subscriber device.

Abstract: The invention relates to transmission of communication signal frames by a communicating entity in a packet-switched network, the communicating entity comprising an egress port for transmitting communication signal frames. The frames comprise a first type of frames, intended to be transmitted in a plurality of bursts for which a traffic shaping is defined as an express traffic, and a second type of frames, for which no traffic shaping is defined, as a sporadic traffic. The communicating entity is configured for storing a plurality of first queues of frames of the first type, associated respectively to the aforesaid plurality of bursts, and at least one second queue for frames of the second type. The bursts are stored in respective first queues with a signaling frame preceding each burst, and this signaling frame comprises a timestamp of generation of said burst.

Abstract: A communicating entities include one master entity, configured for communicating according to a first protocol at least, and a plurality of slave entities. The slave entities include a first group of slave entities able to support communications according to said first protocol and unable to support communications according to a second protocol, and a second group of slave entities able to support communications according to at least said second protocol. The first protocol is implemented by a token passing with communication data from the master entity to successively each neighbour slave entity, until the token reaches again the master entity, defining thus a first cycle according to the first protocol. The second protocol is implemented by passing a data frame including data intended to entities of said second group, one current entity of said second group, when receiving said data frame.

Abstract: The invention relates to a method implemented by a communicating entity in a packet-switched network, comprising at least one port for transmitting communication signal frames comprising a first type of frames, intended to be transmitted in a plurality of streams for which a traffic shaping is defined, and a second type of frames, 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. The communicating entity stores a plurality of first queues of frames of the first type, the first queues being associated respectively to said plurality of streams, and at least one second queue for frames of the second type. The entity further 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.

Abstract: A communicating entities include one master entity, configured for communicating according to a first protocol at least, and a plurality of slave entities. The slave entities include a first group of slave entities able to support communications according to said first protocol and unable to support communications according to a second protocol, and a second group of slave entities able to support communications according to at least said second protocol. The first protocol is implemented by a token passing with communication data from the master entity to successively each neighbour slave entity, until the token reaches again the master entity, defining thus a first cycle according to the first protocol. The second protocol is implemented by passing a data frame including data intended to entities of said second group, one current entity of said second group, when receiving said data frame.

Abstract: The invention is related to a method for transmitting sporadic data stream (SStream) over a packet switched network carrying out further a transmission of priority data transmission within scheduled successive priority time windows. More particularly, the transmission of the sporadic data stream is preceded by a transmission of a reservation frame (RSVFrame) including information related at least to a timing for transmitting the sporadic data stream outside from said scheduled priority time windows.

Abstract: The method comprises the steps of: a) providing a plurality of memory buffers, associated to respective indexes of priority, each buffer comprising one queue of frames having a same index of priority, b) sorting the received frames in a chosen buffer according to their index of priority, c) in each buffer, sorting the frames according to their respective timestamps, for ordering the queue of frames in each buffer from the earliest received frame on top of the queue to the latest received frame at the bottom of the queue, and d) feeding the transmitting ports with each frame or block of frame to transmit, in an order determined according to the index of priority of the frame, as well as an order of the frame or of the block of frame in the queue associated to the index of priority of the frame.

Abstract: The invention relates to a method implemented by a communicating entity in a packet-switched network, comprising at least one port for transmitting communication signal frames comprising a first type of frames, intended to be transmitted in a plurality of streams for which a traffic shaping is defined, and a second type of frames, 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. The communicating entity stores a plurality of first queues of frames of the first type, the first queues being associated respectively to said plurality of streams, and at least one second queue for frames of the second type. The entity further 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.

Abstract: A method for traffic management at a network node in a packet-switched network is proposed. The method comprises performing traffic shaping on a current packet belonging to a packet flow and stored in a memory queue associated with the packet flow, the traffic shaping comprising, if a theoretical reception time, TRT, value of the current packet is smaller than or equal to a time counter value, output the current packet through an egress port. The TRT value of the packet is determined by performing traffic policing of incoming packets of the packet flow.

Abstract: The invention is related to a method for transmitting sporadic data stream (SStream) over a packet switched network carrying out further a transmission of priority data transmission within scheduled successive priority time windows. More particularly, the transmission of the sporadic data stream is preceded by a transmission of a reservation frame (RSVFrame) including information related at least to a timing for transmitting the sporadic data stream outside from said scheduled priority time windows.

Abstract: The present invention relates to packet-switched networks, such as Ethernet, and more particularly to a method for traffic shaping of data frames to transmit in such 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. More particularly, for a current normal frame, the method comprises the steps of: determining whether said normal frame can be fragmented, and if yes: determining whether a remaining time to a next time window opening is enough to transmit one or several fragments of said normal frame, and if yes: transmitting said one or several fragments.

Abstract: The method comprises the steps of: a) providing a plurality of memory buffers, associated to respective indexes of priority, each buffer comprising one queue of frames having a same index of priority, b) sorting the received frames in a chosen buffer according to their index of priority, c) in each buffer, sorting the frames according to their respective timestamps, for ordering the queue of frames in each buffer from the earliest received frame on top of the queue to the latest received frame at the bottom of the queue, and d) feeding the transmitting ports with each frame or block of frame to transmit, in an order determined according to the index of priority of the frame, as well as an order of the frame or of the block of frame in the queue associated to the index of priority of the frame.

Abstract: A method for traffic management at a network node in a packet-switched network is proposed. The method comprises performing traffic shaping on a current packet belonging to a packet flow and stored in a memory queue associated with the packet flow, the traffic shaping comprising, if a theoretical reception time, TRT, value of the current packet is smaller than or equal to a time counter value, output the current packet through an egress port. The TRT value of the packet is determined by performing traffic policing of incoming packets of the packet flow.

Abstract: For allocating resources in a mesh communications network for setting up a data stream transmission from a talker device to a listener device via at least one node device, data paths being defined throughout the mesh communications network following a link-state routing protocol, each node device performs receiving, obtaining, determining, and checking. And when there are enough said resources, temporarily reserving and propagating. And when receiving for said data stream transmission a stream reservation response representative of a positive acknowledgement to said stream reservation request, effectively allocating and propagating.

Abstract: The present invention relates to packet-switched networks, such as Ethernet, and more particularly to a method for traffic shaping of data frames to transmit in such 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. More particularly, for a current normal frame, the method comprises the steps of: determining whether said normal frame can be fragmented, and if yes: determining whether a remaining time to a next time window opening is enough to transmit one or several fragments of said normal frame, and if yes: transmitting said one or several fragments.

Abstract: Node devices of a mesh communications network are interconnected by links. Forwarding tables are initially built following a link-state routing protocol. Each node device performs, upon detecting a link failure or a link recovery, determining and transmitting. Each end-point, when receiving said message(s) representative of said link failure or said link recovery, records an indication of whether each data path identified in the received message(s) can be activated or not. When the received message(s) is(are) representative of a link failure, each end-point performs selecting and transmitting.

Abstract: Node devices of a mesh communications network are interconnected by links. Forwarding tables are initially built following a link-state routing protocol. Each node device performs, upon detecting a link failure or a link recovery, determining and transmitting. Each end-point, when receiving said message(s) representative of said link failure or said link recovery, records an indication of whether each data path identified in the received message(s) can be activated or not. When the received message(s) is(are) representative of a link failure, each end-point performs selecting and transmitting.

Abstract: For allocating resources in a mesh communications network for setting up a data stream transmission from a talker device to a listener device via at least one node device, data paths being defined throughout the mesh communications network following a link-state routing protocol, each node device performs receiving, obtaining, determining, and checking. And when there are enough said resources, temporarily reserving and propagating. And when receiving for said data stream transmission a stream reservation response representative of a positive acknowledgement to said stream reservation request, effectively allocating and propagating.