Huawei Technologies Co., Limited

Future Wei Technologies, Inc.

Xiaozhong Wang

Jun Gong

Sai Yuan

Zhen Wang

Guang Li

Jian Zhang

Wenbin Yang

Jian Ken Song

Rui Hu

Wan Lam

Zixiong Wang

Hongfei Chen

Yu Bai

Suping Zhai

Wenyong Zhang

Yunfeng Bian

Tuanhui Sun

Hao Su

Xiquan Zhao

Yuanming Zheng

Degao Zheng

Hua Wei

Hunghsiang Jonathan Chao

Chong Zhan

Hexuan Zhao

Hongxiang Zhao

A method for load balancing and packet re-sequencing on a network includes an ingress node that determines an identifier of a destination chip based on a destination address of a packet flow and a forwarding table, allocates, based on the identifier of the destination chip, a channel identifier and a sequence number of each packet that is in the packet flow and that enters a channel, to generate an updated packet flow, where each packet in the updated packet flow includes a packet in a corresponding packet flow, a sequence number of the packet, and the channel identifier, and the updated packet flow is sent in a per-packet load sharing manner.

Method and apparatus for load balancing and packet re-sequencing on network

A memory management method includes: determining that available storage space of a first memory in a network device is less than a first threshold, where the first threshold is greater than 0 and the first memory stores a first packet queue; and deleting at least one packet at the tail of the first packet queue from the first memory based on the available storage space of the first memory being less than the first threshold. When the available storage space of the first memory is less than the first threshold, a packet queue, namely, the first packet queue, is selected and a packet at the tail of the packet queue is deleted from the first memory.

Buffer management method and apparatus

A packet forwarding method to shorten a transmission latency of an elephant flow is provided. In the method, for a first packet flow used as an elephant flow, a network device may receive a plurality of packets of the first packet flow, and determine a characteristic parameter of the first packet flow based on the plurality of packets, where the characteristic parameter of the first packet flow is used to indicate a transmission latency of the first packet flow. After determining the characteristic parameter of the first packet flow, the network device determines a forwarding policy of the first packet flow based on the characteristic parameter of the first packet flow. The forwarding policy of the first packet flow is used to indicate latency sensitivity of the first packet flow.

Packet forwarding method and apparatus

A method for determining a packet dequeue rate includes allocating a plurality of consecutive blocks in a first memory to a first packet, storing the first packet and a first length in the plurality of blocks, where the first length is of a first packet queue and is obtained when the first packet is enqueued into the first packet queue, and determining, based on a first span and the first length stored, a first rate at which a packet in the first packet queue is dequeued, where the first span is equal to a difference between a second time and a first time, the first time is when the first packet is enqueued into the first packet queue, and the second time is when the first packet is dequeued from the first packet queue.

Method and apparatus for determining packet dequeue rate

Embodiments provide a packet processing method and a device. The method includes: acquiring a first packet, and determining an identifier of a first table. The method also includes determining description information of the first table, and performing first processing on the first packet according to the description information and the first table, where the first table is a convention table. The method also includes determining an identifier of a next table according to the description information of the first table, where the identifier of the next table corresponds to description information of the next table. The method also includes processing, according to the description information, and the next table, the first packet that has undergone the first processing.

Packet processing method and device

A method includes receiving, by a forwarding device, M pieces of description information that are sent by a controller and are in a one-to-one correspondence with M forwarding services. Each piece of description information includes preset performance of a corresponding forwarding service and an identifier of a table to be searched, and a set including preset performance of the M forwarding services includes Q elements. The method further includes generating Q pieces of simultaneous access information according to the M pieces of description information; and determining, according to the Q pieces of simultaneous access information, that N tables are to be stored in at least one memory of the forwarding device.

Method for determining storage location of table, forwarding device, and controller

One embodiment of the present invention provides a router. The router includes a storage, a forwarding table management mechanism, and a longest prefix matching mechanism. The storage stores, in a data structure corresponding to a rich prefix node associated with a trie, a plurality of network address prefixes represented by the trie. The forwarding table management mechanism expresses a respective network address prefix using one or more of: 1) a traversal path on the trie from a root node to a subtrie of the trie; and 2) an encoded representation of a node in the subtrie. The longest prefix matching mechanism matches a network address with a longest prefix from the network address prefixes stored in the data structure corresponding to the prefix node.

Optimized trie-based address lookup

A method for selecting a hash function, a method for storing and searching a routing table and devices thereof are provided. The method for selecting a hash function includes: hashing data to be hashed by using a current alternative hash function; decoding a hash result; accumulating decoded results until no carry occurs during the accumulation; and selecting a current alternative hash function with no carry generated as a formal hash function. The method for storing a routing table includes: dividing the routing table into a next-level node pointer portion and a prefix portion for being stored; and selecting a hash function by using the above method for selecting a hash function. The method for searching a routing table includes: directly searching an IP address to be searched according to a directly stored length of a next-level node pointer portion for storing the routing table; and reading a prefix node according to a searched result. Thus, hash collision can be avoided, and memory resources occupied by the routing table can be effectively reduced.

Method for selecting hash function, method for storing and searching routing table and devices thereof

Growing community of inventors

Beijing, China

Xiaozhong Wang