NETWORK DEVICE SLEEP CONTROL METHOD AND APPARATUS, NETWORK DEVICE, AND STORAGE MEDIUM

    公开(公告)号:US20240419233A1

    公开(公告)日:2024-12-19

    申请号:US18819761

    申请日:2024-08-29

    Abstract: This application discloses a network device sleep control method and apparatus. The method is applied to the network device, and the method includes: obtaining measurement data, where the measurement data is attribute data that indicates the network device to process a service; obtaining a first sleep policy, where the first sleep policy includes a rule item and an action item; determining that the measurement data meets the rule item; and controlling, according to the action item, one or more indicated sleep objects to sleep in a corresponding sleep time period, where the sleep objects include at least one of the following objects: a switch board, a switch chip, and a switch port, the network device includes a service board and the switch board, the switch board includes the switch chip and the switch port, and the switch port is used for communication between the switch board and the service board.

    ROUTING TABLE ESTABLISHMENT METHOD AND DEVICE AND ROUTING TABLE LOOKUP METHOD AND DEVICE
    2.
    发明申请
    ROUTING TABLE ESTABLISHMENT METHOD AND DEVICE AND ROUTING TABLE LOOKUP METHOD AND DEVICE 审中-公开
    路由表建立方法和设备和路由表查找方法和设备

    公开(公告)号:US20130034096A1

    公开(公告)日:2013-02-07

    申请号:US13649633

    申请日:2012-10-11

    CPC classification number: H04L45/54 H04L45/742 H04L45/748

    Abstract: The embodiments of the present invention relate to a routing table establishment method and device and a routing table lookup, method and device. The routing table establishment method includes: partitioning a data structure of a routing table into a trunk and a TRIE sub-tree (101); adding entries of the routing table to the TRIE sub-tree (102); and storing an upgrade sub-node of the TRIE sub-tree's root in the trunk, where the height of the TRIE sub-tree is smaller than or equal to a set height threshold (103), and the upgrade sub-node of the TRIE sub-tree's root is a sub-root among prefix sub-nodes included in the TRIE sub-tree's root. Thereby ensuring the high compression ratio of the routing table; and the height of the TRIE sub-tree is controlled according to the height threshold, thereby reducing times for accessing a memory, improving lookup speed, and reducing lookup delay.

    Abstract translation: 本发明的实施例涉及路由表建立方法和设备以及路由表查找,方法和设备。 路由表建立方法包括:将路由表的数据结构划分为中继线和TRIE子树(101); 将所述路由表的条目添加到所述TRIE子树(102); 并且将所述TRIE子树的根的升级子节点存储在所述中继线中,其中所述TRIE子树的高度小于或等于设定的高度阈值(103),并且所述TRIE的升级子节点 子树的根是包含在TRIE子树根中的前缀子节点之间的子根。 从而确保路由表的高压缩比; 并根据高度阈值控制TRIE子树的高度,从而减少访问存储器的时间,提高查找速度,减少查找延迟。

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

    公开(公告)号:US10158503B2

    公开(公告)日:2018-12-18

    申请号:US15274943

    申请日:2016-09-23

    Abstract: 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.

    Packet Processing Method and Device
    4.
    发明申请

    公开(公告)号:US20180324095A9

    公开(公告)日:2018-11-08

    申请号:US15198010

    申请日:2016-06-30

    CPC classification number: H04L45/745 H04L45/54 H04L69/22

    Abstract: 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 forwarding method and apparatus

    公开(公告)号:US11653251B2

    公开(公告)日:2023-05-16

    申请号:US17154759

    申请日:2021-01-21

    CPC classification number: H04W28/0268 H04W28/0236

    Abstract: 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.

    Buffer management method and apparatus

    公开(公告)号:US11695710B2

    公开(公告)日:2023-07-04

    申请号:US17408057

    申请日:2021-08-20

    CPC classification number: H04L49/9084

    Abstract: 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.

    Method and Apparatus for Determining Packet DeQueue Rate

    公开(公告)号:US20210176182A1

    公开(公告)日:2021-06-10

    申请号:US17171250

    申请日:2021-02-09

    Abstract: 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.

Patent Agency Ranking