H04L47/564

Luminaire Network System
20220158948 · 2022-05-19 ·

Example embodiments relate to luminaire network systems. One example luminaire network system includes one or more luminaires. A luminaire of the one or more luminaires is provided with a luminaire controller and a storage device configured to store messages to be transmitted in a queue. The luminaire controller is configured to associate a message in the queue with an indication of a time before which the message needs to be transmitted. The luminaire controller is also configured to check whether the indication of at least one message of a plurality of messages in the queue indicates that the at least one message has to be transmitted. Additionally, the luminaire controller is configured to transmit the plurality of messages in the queue, when a result of the checking is that the at least one message has to be transmitted.

Determining whether to suppress an interrupt indicating completion of processing of a frame based on priority of the frame and current value information
11188399 · 2021-11-30 · ·

According to an embodiment, a notification control device includes a memory and one or more hardware processors configured to function as a determination unit and a notification unit. The determination unit is configured to determine, using notification control information set according to a priority of a frame, whether to notify of completion notification indicating completion of processing of the frame. The notification unit is configured to notify the completion notification when it is determined to notify of the completion notification.

Communication device, communication system, and communication method
11228540 · 2022-01-18 · ·

A communication device includes: multiple queues, each of which stores a packet; an input section that inputs a concerned packet to a queue that is among the multiple queues and corresponds to a priority of the concerned packet; an adder that acquires first time when the concerned packet is input to the queue corresponding to the priority, and that adds the first time to the concerned packet; a reader that reads packets from each of the multiple queues in order from a packet with the highest priority; a calculator that acquires second time when the concerned packet is read from the queue corresponding to the priority, and that calculates delay time of the concerned packet from the difference between the first time and the second time; and a priority controller that increases the priority of the concerned packet based on the delay time.

RTA queue management in wireless local area network (WLAN) stations

A wireless communication circuit for operating over a wireless local area network (WLAN) in which real time application (RTA) traffic and non-RTA traffic coexist and are distinguished from one another. RTA queues are created to enqueue RTA packets while non-RTA packets are pushed into non-RTA queues. Management frames containing RTA session parameters and RTA queue setting information are exchanged between stations. Channel time is allocated to RTA queues for transmitting packets, during which non-RTA queues are not allowed to access the channel. Stations determine which RTA queues to enqueue an RTA packet into based on RTA queue classification information of its RTA session.

Time sensitive networking device
11216408 · 2022-01-04 · ·

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.

Method and device for performing SL communication in NR V2X on basis of auxiliary information

Provided are a method for a first device to perform wireless communication and a device supporting same. The method comprises the steps of: receiving an auxiliary information request from a second device; generating auxiliary information on the basis of the auxiliary information request; transmitting first sidelink control information (SCI), including scheduling information about a physical sidelink shared channel (PSSCH), to the second device through a physical sidelink control channel (PSCCH), wherein the first SCI includes information related to frequency resource allocation, information related to time resource allocation, information related to a demodulation reference signal (DMRS) pattern, and information related to a modulation and coding scheme (MCS); and transmitting the auxiliary information to the second device through the PSSCH in response to the auxiliary information request, wherein the auxiliary information may include information for sidelink (SL) resource selection for the second device.

Redundant media packet streams

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.

Data validity based network buffer management system
11811672 · 2023-11-07 · ·

Systems and methods for data scheduling and queuing. A data network node is configured to transmit data in a store-and-forward fashion. The data network node includes a delay and validity determination module that determines and assigns a validity value to each data packet incoming via an input port based on a time stamp of the data packet, a current time value, an expected delay on a route of the data packet to its destination, and a packet urgency value. A scheduling module and a queue managing module execute their functions based on the validity value assigned to a data packet in a transmission buffer.

DEADLINE-BASED DATA PACKETS

Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a network node may receive an indication of a deadline for transmission of a protocol data unit (PDU) set, the indication of the deadline including one or more of: an indication of a jitter of the PDU set, an indication of a packet delay budget that is based at least in part on the jitter of the PDU set and a nominal PDU set delay budget (PSDB), or an indication of an absolute time of the deadline. The network node may transmit the PDU set at a time that is based at least in part on the indication of the deadline. Numerous other aspects are described.

PACKET RECEIVING METHOD AND INFORMATION PROCESSING APPARATUS
20230344780 · 2023-10-26 · ·

When a user thread with a deadline waits for a packet, a computer determines a reference time that is associated with and comes before the deadline. If the packet is not received by a communication interface by the reference time, the computer transfers control to a kernel thread and uses the kernel thread to perform polling to repeatedly check reception status of the communication interface. When the packet is received by the communication interface during polling, the computer uses the kernel thread to read out the received packet and pass the read packet to the user thread.