The application provides a routing method which includes configuring a first path and a second path in charge of load sharing for a data flow, and configuring a third path in charge of reroute protection. A first group entry is generated for instructing the forwarding device to use the first path and the second path as load-sharing paths and use the third path to perform reroute protection on the first path and the second path. A flow entry for instructing to perform an operation of going to the first group entry is generated.

A communication device includes a providing unit, a flow control unit, and a cryptography processing unit. The providing unit provides a cryptographic key generated using quantum key distribution technology. The flow control unit, if the cryptographic key has not been provided at time of reception of target data for cryptography processing, performs, with respect to the received data, an operation selected from among a first operation of destroying the data, a second operation of holding the data, and a third operation of attaching, to the data, information indicating that the cryptographic key has not been provided, and then outputting the data. The cryptography processing unit, with respect to data output from the flow control unit, performs the cryptography processing using the cryptographic key.

An improved autonegotiation approach includes determining that a negotiated rate between a first network device and a second network device exceeds data transfer capacity over a network path downstream of the second network device. In response, a configuration message is generated and transmitted to the first network device. When received by the first network device, the configuration message causes the first network device to limit data transfer between the first network device and the second network device to no more than the downstream data transfer capacity.

Methods, systems and devices for network congestion control exploit the inherent burstiness of network traffic, using a wave-based characterization of network traffic and corresponding multiplexing methods and approaches.

This disclosure provides a data transmission method and apparatus. The method includes: determining a data flow mapped onto a data radio bearer (DRB); and controlling a transmission rate of the data flow based on the transmission rate of the data flow and a first rate threshold of the data flow. This disclosure provides the data transmission method and apparatus, to control the transmission rate of the data flow mapped onto the DRB.

A method and an apparatus for data traffic restriction are applied to a network device where a link aggregation group interface includes member ports. Firstly, configuring, for each link aggregation group interface, a credit bucket for storing tokens overflowing from a token bucket corresponding to each member port, and the tokens overflowing from the different token buckets are distinctively labeled; receiving a packet to be sent, if a number of tokens in the token bucket is not sufficient for sending the packet to be sent, borrowing, from the credit bucket, tokens overflowing from a non-current token bucket, if the tokens of the current token bucket and the borrowed tokens are sufficient for sending the packet to be sent, sending the packet to be sent, and meanwhile, reducing the number of tokens in the current token bucket and tokens in the credit bucket. A dynamic restriction of data traffic is achieved.

Systems and methods for rate limiting one or more clusters of service instances using at least one rate limit controller are described herein. A token distribution is determined for each one of a plurality of rate limiters. The token distribution comprising a maximum number of tokens and a token generating rate. The maximum number of tokens and the token generating rate are assigned to each one of the plurality of rate limiters. At least one request for additional tokens is received from at least a given one of the plurality of rate limiters. The token distribution of at least the given one of the plurality of rate limiters is adjusted based on the request and on token consumption information of at least the given one of the plurality of rate limiters. An adjusted token distribution is assigned to the given one of the plurality of rate limiters.

In an example, a network switch is configured to operate natively as a load balancer. The switch receives incoming traffic on a first interface communicatively coupled to a first network, and assigns the traffic to one of a plurality of traffic buckets. This may include looking up a destination IP of an incoming packet in a fast memory such as a ternary content-addressable memory (TCAM) to determine whether the packet is directed to a virtual IP (VIP) address that is to be load balanced. If so, part of the source destination IP address may be used as a search tag in the TCAM to assign the incoming packet to a traffic bucket or IP address of a service node.

A technique allows stations to utilize an equal share of resources (e.g., airtime or throughput). This prevents slow stations from consuming too many resources (e.g., using up too much air time). Fairness is ensured by selective dropping after a multicast packet is converted to unicast. This prevents slow stations from using more than their share of buffer resources. Multicast conversion aware back-pressure into the network layer can be used to prevent unnecessary dropping of packets after multicast to unicast (1:n) conversion by considering duplicated transmit buffers. This technique helps achieve airtime/resource fairness among stations.

The disclosure relates in some aspects to a scheduling and token bucket scheme for co-existence of different radio access technologies on a communication resource. In some aspects, the scheme may avoid traffic collisions on the resource and promotes access fairness on the resource.