Methods for adding timestamps to packets from data streams in a computing network may include receiving, in a processor in the computing network, a plurality of data streams and building, by the processor a first packet from a first data stream in the plurality of data streams. The processor may further determine a value of a first timestamp for outputting the first packet that satisfies one or more parameters of the first data stream, add the first timestamp to the first packet, and hand over the first packet to a network device in the computing network.

A method of managing transport of packets transmitted over a time division multiplexed, TDM, link in a network. The method performed at a second network node comprises: receiving (102) blocks of data from a first network node. Data from one packet is received in a plurality of blocks and a first block from a packet has a time-stamp indicating arrival time of the packet at the first network node. The blocks are multiplexed for transmission over the TDM link. The method also comprises: queuing (106) the received blocks and if a block from the top of the queue (108, 110) has a time-stamp (110—yes) and a maximum allowed latency has been exceeded (112) the method discards (116) blocks containing data from the same packet as the block with said time-stamp if there is at least one block containing data from another packet in the queue (114—yes). An apparatus is also disclosed.

Disclosed herein is technology to reduce latency of frames through a network device supporting various priorities. In an implementation, a method comprises configuring one or more priorities with a preemptive right over other one or more of said plurality of priorities; receiving frames in a sequence, each of the frames having a frame priority comprising of one of said plurality of priorities; queuing the received frames in a predetermined order based on a frame arrival time and the frame priority; transmitting a current frame based on a current frame priority and current frame arrival time; stopping transmission of the current frame when a later frame in the sequence is received that has a later frame priority with preemptive right over the current frame priority; transmitting an invalid frame check sequence; transmitting the later frame; and restarting the transmission of the current frame after transmitting the later frame.

This invention concerns the transmitting and receiving of digital media packets, such as audio and video channels and lighting instructions. In particular, the invention concerns the transmitting and receiving of redundant media packet streams. Samples are extracted from a first and second media packet stream. The extracted samples are written to a buffer based on the output time of each sample. Extracted samples having the same output in time are written to the same location in the buffer. Both media packet streams are simply processed all the way to the bugger without any particular knowledge that one of the packet streams is actually redundant. This simplifies the management of the redundant packet streams, such as eliminating the need for a “fail-over” switch and the concept of an “active stream”, the location is the storage space allocated to store one sample. The extracted sample written to the location may be written over another extracted sample from a different packet stream previously written to the location. These extracted samples written to the same location may be identical.

Example implementations described herein involve a system that manages a dispatch of data within an Internet of Things (IoT) system that can involve a first process for intaking new data and conducting one of dispatching the new data or queuing the new data; a second process executed at lower priority than the first process involving determining if queued data exceeds a retry count; forwarding the queued data to a third process if the retry count does not exceed the threshold; and popping the queued data into an error process if the queued data exceeds the retry count; and the third process executed after receiving the queued data from the second process, involving attempting to dispatch the queued data.

A method for generating a schedule for the transmission of time-triggered, TT, messages in a network, wherein said network communicates TT messages according to said schedule and based on a global, network-wide time, wherein said network communicates rate-constrained, RC messages, wherein for each of said RC messages real-time requirements are provided, wherein the method comprises: Step 1: setting the transmission time of all TT messages which are communicated in the network, and Step 2: executing a search function to find a set of TT transmission times so that the real-time requirements of all RC messages are fulfilled, and when all real-time requirements or at least real-time requirements for defined RC messages are fulfilled, generating in Step 3: the schedule based on the transmission times retrieved in Step 2, or executing Step 2 again when not all real-time requirements or not all real-time requirements for the defined RC messages are fulfilled.

The present disclosure generally relates to a device, method, or system for time sensitive networking. In an example, the device can include a time-sensitive networking controller and a scheduler. The device also includes an enhanced gate control list maintained on the time-sensitive networking controller to include a direct memory access address, a launch time, and a pre-fetch time for a data packet. The device may also include a transmitter of the time-sensitive networking controller to transmit the data packet retrieved using the direct memory access address at the launch time identified by the scheduler.

An approach to optimize performance for large scale inference models. Data in the form of images is received from sensors such as cameras. The data is processed to generate data tags associated with the context of the image and portion the images. Model tags are generated based on data characteristics or user input. The tags and their associated data are added to a time-based queue for delivery to the appropriate inference models. Based on the embedded delivery time and frequency, the portioned images are delivered to the appropriate inference models.

Latency Based Forwarding (LBF) techniques are presented for the management of the latencies, or delays, of packets forwarded over nodes, such as routers, of a network. In addition to a network header indicating a destination node for receiving the packet, a packet also includes an LBF header indicating the packets accumulated delay since leaving the sender, a maximum latency for the entire journey from the sender to the receiver and a minimum latency for the entire journey from the sender to the receiver. When a packet is received at a node, based on the accumulated delay, the maximum latency, and the minimum latency, the node places the packet in a forwarding queue to manage the delays between the sender and the receiver. The LBF can also indicate a policy for the forwarding node to used when determining the enqueueing of the packet.

Systems and method for routing data packets in an interconnection network. The data packets transmitted across the interconnection network each include age data. Routers positioned throughout the interconnection network may control the flow of the data packets through the use of aging first-in, first-out (FIFO) queues and age-based arbiters. The age-based arbiters within the routers are configured to prioritize older data packets over newer data packets being pushed from the FIFO queues. Each data packet inserted into the FIFO queues may be updated such that the age data of the data packet is converted from an age to an injection time. When the data packet is read from the FIFO, the age data of the data packet is converted back to an age.