9 results about "Minimum latency" patented technology

Embodiments of the present invention provide computer-implemented methods, computer program products and computer systems. Embodiments of the present invention can identify an effective channel on a transmission stream framework comprising a plurality of channels and nodes using current capacity states and current transmission schedules. Embodiments of the present invention can then determine whether to continue marshalling on a current channel or to marshal to the effective channel based on transmission demands between nodes and channel providing a minimum latency between available options within the transmission stream framework

The embodiment of the invention provides a time delay reporting method, and the method comprises the steps: reporting target time delays corresponding to data at a plurality of specific positions in a data stream, and enabling the specific positions to be spaced by a fixed length; wherein the period of the plurality of specific positions corresponds to the length of one or more convolution interleaving sequences, and the specific positions correspond to a delay line with the maximum or minimum time delay introduced in convolution interleaving; or, the period of the plurality of specific positions corresponds to the length of one or more distribution sequences, and each distribution sequence corresponds to eight distributed subsequences; or the period of the plurality of specific positions corresponds to an integral multiple of N data blocks, each data block in the N data blocks corresponds to a forward error correction (FEC) code word, N is a positive integer, and the length of each data block is 120 bits, or 128 bits, or 110 bits, or 126 bits. By using the scheme, the time delay can be accurately reported.

The embodiment of the application provides a communication negotiation method and device, which are used for controlling the single transmission duration of an access hot spot AP and a station STA, and ensuring that the low-latency service requirement is met. Specifically, the communication negotiation device determines the minimum latency requirement according to the latency requirement of a plurality of to-be-transmitted data devices, wherein the plurality of to-be-transmitted data devices include the AP and the STA; meanwhile, the communication negotiation device determines the to-be-transmitted data device in a transmission cycle according to the minimum latency requirement and the latency requirement of the plurality of to-be-transmitted data devices; the communication negotiation device determines the single maximum transmission duration according to the minimum latency requirement and the number of the to-be-transmitted data device in the transmission cycle, wherein the single maximum transmission duration meets the total duration of the to-be-transmitted data device in the transmission cycle for transmitting a data packet once in sequence is less than or equal to the minimum latency requirement; and the communication negotiation device instructs the to-be-transmitted data device in the transmission cycle to transmit the data packet according to the single maximum transmission duration.

This invention discloses a minimum latency MPTCP data scheduling method based on predicted packet arrival time. When the current data packet arrives at the sending buffer, the round-trip time is obtained based on the ACKs returned by the receiver to each sub-stream. The flight time of data packets in each sub-stream is calculated, the link parameters of each sub-stream are statistically analyzed, and the throughput of each sub-stream is calculated. Network jitter is calculated using previously recorded round-trip time samples from each sub-stream. The total number of bytes of unsent data packets in the sending queue of each sub-stream and the number of bytes of the current data packet are calculated. The time required for both unsent data packets and the current data packet to be sent is calculated. Considering packet loss feedback, the predicted arrival time of data packets in each sub-stream is comprehensively calculated, and the sub-stream with the smallest value is selected to schedule the current data packet. This invention can reasonably schedule data packets based on the arrival time of each data packet in each sub-stream, thereby reducing the number of out-of-order data packets at the receiver, reducing transmission latency, and meeting the low latency requirements of real-time video services.

Apparatus and techniques are provided for on-time packet transmission through a series of computing nodes in a network. A node receives a packet from an input network interface, enforces an earliest allowed time for transmission of the packet to a next node based on data extracted from an information field in the packet, determines a transmission time for the packet that is no earlier than the earliest allowed transmission time, stores an indication of a minimum latency for the packet at the next node in the information field of the packet based on the determined transmission time, and transmits the packet to the next node through an output network interface.

This disclosure discloses a network model training method and apparatus, an electronic apparatus and a computer-readable storage medium. The method includes: acquiring training data and inputting the training data into an initial model to obtain output data, wherein the initial model includes an embedding layer, the embedding layer is constructed based on preset network layer latency information, the preset network layer latency information includes network layer types and at least two types of latency data corresponding to each network layer type, and each type of latency data corresponds to different device types; inputting a current device type and a target network layer type of each target network layer in the initial model into the embedding layer to obtain target latency data corresponding to other device type; calculating a target loss value based on the target latency data, the training data and the output data, and adjusting parameters of the initial model based on the target loss value; and obtaining a target model based on the initial model in response to a training completion condition is satisfied. By means of the method, the target model has a minimum latency when running on a device corresponding to the other device type.

A method for determining whether clock skew may exist between a sending node and a remote node during two-way network testing (using protocols such as TWAMP), and a computational method for revising measured latency data to compensate for clock differences.The method for compensating for clock skew comprises monitoring the network latency between two nodes during a defined time interval. When clock skew is detected, a flag is set, and, after the time interval has completed, clock skew S is estimated using the minimum latency values for the interval. The recorded latency values for the interval are then revised using the calculated clock skew S, and one-way latency results reported.The improved accuracy can be achieved with only on a few computations after the data have been collected. This a posteriori approach saves on computational resources, which can be at a premium for network testing equipment.

The invention relates to a conflict detection rule lock-free updating method for a network security access control strategy, and belongs to the technical field of network security. According to the method, the memory can be recycled in time under the condition that the lowest delay of the read thread is guaranteed to the greatest extent, and a special write thread recycling stage or a special garbage recycling thread is not needed. According to the method, the cache block is applied in the memory in advance and is defined as the structure of the space table, so that the overhead of the system caused by frequent application and release of the memory can be avoided, and the memory can be allocated in a universal available space table free list. The memory blocks which are not used can be directly used, if the cache blocks are all occupied by the threads, distribution is applied from a system, and the memory blocks are not directly released after being used and are stored by a free list. According to the method, a quick, safe and stable access control rule updating algorithm is realized through a lock-free mechanism, and the problems of low efficiency and large influence on concurrency under the condition of using a lock are avoided.

Disclosed are a bus inversion encoder module that utilizes future data in a data bus including a serializer with minimum latency and high transition reduction efficiency by comparing current data with both past data and the future data and encoding the current data, and a bus inversion system including the same. The bus inversion encoder module uses current data, past data, and future data transmitted through a bus and each including a plurality of bits, determines whether to invert the current data, and generates a current flag and coded current data by using whether to invert, an output flag, and the current data. The output flag is generated by summing the current flag and the coded current data and serially converting the current flag and the coded current data.