A device receives a notification indicating a failure of a first server device responsible for a primary message queue that includes messages at a time of the failure. A second server device is responsible for a standby message queue to which the messages are replicated, where a position in the standby message queue and a message time are assigned to each of the replicated messages. The device obtains a record time that identifies the message time of one of the messages that was last obtained from the primary message queue prior to the failure, compares an adjusted record time and the message time of one or more of the messages of the standby message queue to determine a starting position in the standby message queue, and processes messages obtained from the standby message queue beginning at one of the messages assigned to the position that matches the starting position.

A system and method for efficiently processing and managing data stored in a queue. A processing device may process the data stored in the queue. Queue protocols can be applied to the queue to efficiently process and manage data stored in the queue. Queue protocols may facilitate efficient use of processing resources that process the data stored in one or more queues. A queue protocol may include at least a first protocol for facilitating transfer of data in the queue to another queue processed by another processing device or a second protocol for inhibiting transfer of data in the queue to another queue.

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.

Techniques for transmitting data packets on a shared channel in a data communications network include storing, on a local node, a current number of turns in a transmitting queue and a current turn based on packets received from other nodes on the channel. For a first local data packet to transmit, a local transmit turn is obtained based on successfully transmitting the packet in a time interval following a last turn in the queue. A data link layer header includes queue fields for the current number of turns, the local transmit turn, and a request for adding the local transmit turn. While there is still a remaining packet to transmit and when the current turn is the local transmit turn, the packet is transmitted with queue fields indicating the current number of turns, the current turn, and an indication of no new turn. An acknowledgement control packet indicates successful transmission.

Embodiments of the present disclosure relate to the field of network communication technology and disclose a datagram processing method, processing unit and VPN server. The present disclosure is applicable to a VPN server. The VPN server includes a packet receiving thread, a plurality of processing threads and a packet sending thread. According to some embodiments, the packet receiving thread receives datagrams and distributes the datagrams to the plurality of processing threads successively in a preset order; the plurality of processing threads carry out parallel processing on the datagrams after receiving the datagrams; the packet sending thread acquires the processed datagrams from the plurality of processing threads successively in a preset order. The efficiency of datagram transmission may be improved on the basis of ensuring the datagram transmission sequence.

The present disclosure relates to systems, non-transitory computer-readable media, and methods for dynamically controlling requestor device queues by monitoring and utilizing the throughput rate of matched provider devices and requestor devices. In some embodiments, the disclosed systems determine throughput rate of matched provider devices and requestor devices in real-time and/or predicts throughput rate utilizing historical features of a particular location. The disclosed systems can generate and provide queue request notifications to requestor devices based on a throughput rate at the location. Specifically, the disclosed systems can monitor a current queue status over time, compare the queue status to a queue threshold, and dynamically generate queue request notifications that reflects throughput-based queue modifiers as the current queue status approaches the queue threshold.

Methods and apparatus for transmitting and obtaining uplink HARQ feedbacks are provided. The method of transmitting uplink HARQ feedbacks includes: obtaining a service priority ordered list associated with a plurality of downlink subframes; generating to-be-sent HARQ feedbacks, by bundling HARQ feedbacks associated with downlink subframes in a descending order of service priorities based on the service priority ordered list; and successively assigning uplink subframes for the to-be-sent HARQ feedbacks to transmit the to-be-sent HARQ feedbacks to a base station. With the method of transmitting uplink HARQ feedbacks provided by the present disclosure, user equipment may preferentially transmit HARQ feedbacks of subframes with low-latency to the base station. When the base station determines that the transmission of the latency-sensitive service data is faulty, the downlink subframe carrying the latency-sensitive service data is preferentially re-transmitted, thereby shortening the delivery time of the latency-sensitive service data.

Technologies for distributing network packet workload are disclosed. A compute device may receive a network packet and determine network packet extrinsic entropy information that is based on information that is not part of the contents of the network packet, such as an arrival time of the network packet. The compute device may use the extrinsic entropy information to assign the network packet to one of several packet processing queues. Since the assignment of network packets to the packet processing queues depend at least in part on extrinsic entropy information, similar or even identical packets will not necessarily be assigned to the same packet processing queue.

In general, techniques are described for facilitating balanced cell handling by fabric cores of a fabric plane for an internal device switch fabric. In some examples, a routing system includes a plurality of fabric endpoints and a switching fabric comprising a fabric plane to switch cells among the fabric endpoints. The fabric plane includes two fabric cores and one or more inter-core links connecting the fabric cores. Each fabric core selects an output port of the fabric core to which to route a received cell of the cells based on (i) an input port of the fabric core on which the received cell was received and (ii) a destination fabric endpoint for the received cell, at least a portion of the selected output ports being connected to the inter-core links, and switches the received cell to the selected output port.

Techniques for providing topic-based data routing in a publish-subscribe messaging environment are disclosed. In one example, a system supported by hardware in a publish-subscribe messaging environment may include a message broker to receive topic metadata at a first instance according to a first interval into a predefined fixed topic. Further, the system may include a topic list subscriber that subscribes to the predefined fixed topic and obtains a list of topics from the message broker. Furthermore, the system may include a subscription manager to assign topics in the list of topics to a set of subscribers according to a criteria. In one example, the message broker may route data corresponding to the topics to the set of subscribers in accordance with the topics assigned to the set of subscribers.