A communication method implemented by a first router of an autonomous system using an interior gateway protocol. The method includes determining at least one flow control parameter for sending messages of the interior gateway protocol to the first router, the at least one flow control parameter being determined based on capacity of the first router to process the messages of the interior gateway protocol; and announcing, in a message of the interior gateway protocol, the at least one control parameter to at least a second router of the autonomous system, which is a neighbor of the first router.

A fabric control protocol (FCP) is a data transmission protocol that enables spraying of individual packets for a given packet flow across a data center from an ingress interface of the source data processing unit (DPU) across a plurality of parallel data paths of a logical tunnel in the network fabric to the egress interface of the destination DPU. The FCP has congestion control mechanisms used to determine a degree of congestion at the egress interface of the destination DPU and to modify a send window size at the source DPU based on the degree of congestion. Reliable FCP (rFCP) extensions provide reliability enhancements and improved failure resilience within the data center. The rFCP extensions provide an unsolicited mode for low latency operation with enhanced reliability mechanisms. The rFCP extensions provide failure resilience mechanisms to identify and avoid failed paths among multiple parallel data paths within the logical tunnel.

A novel and useful acknowledgement and adaptive frequency hopping mechanism for use in wireless communication systems such as IO-Link Wireless. One or two additional acknowledgement bits are added to packet transmissions. One is a current acknowledgment bit which indicates whether a packet was successfully received anytime during the current cycle. The second bit is a previous acknowledgment bit which indicates whether packets were received successfully anytime during the previous cycle. An adaptive hopping table is constructed using a greedy algorithm which chooses frequencies with the best PER for transmission of higher priority packets, while equalizing the PER products across cycles. A last resort frequency mechanism further improves transmission success by switching to a better performing channel for the last subcycle when previous attempts to transmit a high priority packet have failed.

A load sharing method includes: establishing a first tunnel and a second tunnel between a first network device and a second network device, where the first tunnel and the second tunnel form a bonding tunnel through hybrid bonding; sending, by the first network device, a plurality of data packets to the second network device; determining, by the first network device, a usage status of buffer space of a bonding tunnel reorder buffer of the second network device based on an acknowledgment response returned by the second network device; and performing, based on the usage status and according to a specified load sharing policy, load sharing between the first tunnel and the second tunnel for a packet to be transmitted by the first network device to the second network device.

A computing system includes a core system and an uncore system. The core system includes a packet generator unit configured to generate a data packet having a plurality of bytes defining a target packet size, and to output a first byte among the plurality of bytes at a packet delivery start time. The uncore system includes an input/output (I/O) bridge configured to connect an I/O component to the core system, and a packet monitor unit configured to monitor the bytes delivered from the packet generator unit to the I/O component. The packet monitor unit further determines a packet delivery end time after detecting a last byte of the data packet. The computing system determines a latency attributed to the uncore system and the I/O bridge based on the packet delivery start time and the packet delivery end time.

A switch in a slice-based network can be used to enforce quality of service (“QoS”). Agents can run in the switches, such as in the core of each switch. The switches can sort ingress packets into slice-specific ingress queues in a slice-based pool. The slices can have different QoS prioritizations. A switch-wide policing algorithm can move the slice-specific packets to egress interfaces. Then, one or more user-defined egress policing algorithms can prioritize which packets are sent out into the network first based on slice classifications.

A method of generating a reduced address dataset for a geographical area includes receiving a source address dataset for a select geographical area, removing personally identifiable address parameters from detailed address parameters of a plurality of source address datapoints to form a reduced address dataset with a plurality of anonymous address datapoints, and storing the first version of the reduced address dataset. The reduced address dataset is for use by a geographical analytics service provider as a reference address dataset in analyzing target parameters in a target dataset associated with one or more managed service providers to develop geographical distributions of the target parameters. A method of generating a geographical distribution of a target parameter of a target dataset by using the reduced address dataset is also provided. Analytics computer system for generating the reduced dataset and for using the reduced address dataset are also provided.

To make it possible to perform retransmission control in which wireless resources are more efficiently utilized, a wireless communication apparatus includes: a wireless communication unit configured to perform wireless communication with a terminal apparatus; a communication control unit configured to control multicast transmission performed by the wireless communication unit; and a setting unit configured to set a threshold for determining whether or not it is necessary for the communication control unit to perform a retransmission process, on the basis of information about reception of a reception acknowledgment response corresponding to the multicast transmission from the terminal apparatus.

The present invention provides according to one of its aspects a method of queueing a data frame in one of a plurality of traffic queues at a communication station for transmission over a communication channel in a communication network comprising a plurality stations and an access point (AP). The method comprising selecting a traffic queue based on at least one of 1) a transmission mode, direct link or uplink, of the data frame, and 2) a transmission mode of the traffic queue; and queueing the data frame in the selected traffic queue. The transmission mode of the traffic queue may be a Multi-User (MU) uplink (UL) mode if a data frame previously stored in the traffic queue has been transmitted, since a predetermined period of time, in a resource unit (RU) provided by the AP within a transmission opportunity granted to the AP on the communication channel. The transmission mode may also be a Single-User (SU) mode.

An example method comprises receiving, by a first PHY of a first transceiver, a timing packet, timestamping, by the first transceiver, the timing packet and providing the timing packet to a first intermediate node, determining a first offset between the first intermediate node and the first transceiver, updating a first field within the timing packet with the first offset between the first intermediate node and the first transceiver, the offset being in the direction of the second transceiver, receiving the timing packet by a second transceiver, the timing packet including the first field, information within the first field being at least based on the first offset, determining a second offset between the second transceiver and an intermediate node that provided the timing packet to the second transceiver and correcting a time of the second transceiver based on the information within the first field and the second offset.