Methods and Systems for Data Packet Routing
    3.
    发明申请
    Methods and Systems for Data Packet Routing 有权
    数据包路由的方法和系统

    公开(公告)号:US20140351282A1

    公开(公告)日:2014-11-27

    申请号:US13901613

    申请日:2013-05-24

    CPC classification number: H04L45/48

    Abstract: Optimizing a bitmap data tree and a corresponding lookup operation in the bit map data tree may be provided. A number of branches for each search node of a data tree may be counted. The data tree may comprise a plurality of search nodes. Then an optimum depth for the plurality of search nodes may be identified based on the number of branches in the data tree. Next, a hash node may be added to replace a search node of the data tree when a number of branches for the search node is greater than the identified optimum depth.

    Abstract translation: 可以提供在位图数据树中优化位图数据树和相应的查找操作。 可以对数据树的每个搜索节点的多个分支进行计数。 数据树可以包括多个搜索节点。 然后可以基于数据树中的分支数来识别多个搜索节点的最佳深度。 接下来,当搜索节点的分支数大于所识别的最佳深度时,可以添加散列节点来替换数据树的搜索节点。

    Load balancing eligible packets in response to a policing drop decision

    公开(公告)号:US10320686B2

    公开(公告)日:2019-06-11

    申请号:US15372330

    申请日:2016-12-07

    Abstract: One embodiment includes a packet switching device load balancing eligible packets in response to a policing drop decision. The packet switching device sends packets of a particular packet flow out of the packet switching device over a first path in the network towards a destination node; and in response to a policer discipline determining to drop a particular packet of the particular packet flow, switching from said sending packets over the first path to sending packets of the particular packet flow out of the packet switching device over a second path in the network towards the destination node (possibly by switching output queues associated with the two different paths), with the second path being different than the first path, and with the particular packet not being dropped but being sent out of the packet switching device towards the destination node.

    Dropping or admitting packets to an output queue using policy-based scheduling and virtual destination queue occupancy values

    公开(公告)号:US10205805B2

    公开(公告)日:2019-02-12

    申请号:US15357346

    申请日:2016-11-21

    Abstract: One embodiment is associated with dropping or admitting packets to an output queue using occupancy values of virtual destination queues which are updated according to different independent disciplines upon the enqueuing of a packet to an output queue, and the dequeuing of that packet from an output queue. In one embodiment, a virtual destination queue is determined for a packet. A policing decision is made whether to drop the packet or admit the packet to the output queue based on the occupancy level of the determined virtual destination queue, which is updated upon admission. Packets are dequeued in first-in-first-out order from the output queue. For a dequeued one or more packets, one or more of the occupancy values of the virtual destination queues are updated based a scheduling policy that is independent of the particular virtual destination queue(s) associated with the dequeued packets.

    Methods and systems for data packet routing
    10.
    发明授权
    Methods and systems for data packet routing 有权
    数据包路由的方法和系统

    公开(公告)号:US09444731B2

    公开(公告)日:2016-09-13

    申请号:US13901613

    申请日:2013-05-24

    CPC classification number: H04L45/48

    Abstract: Optimizing a bitmap data tree and a corresponding lookup operation in the bit map data tree may be provided. A number of branches for each search node of a data tree may be counted. The data tree may comprise a plurality of search nodes. Then an optimum depth for the plurality of search nodes may be identified based on the number of branches in the data tree. Next, a hash node may be added to replace a search node of the data tree when a number of branches for the search node is greater than the identified optimum depth.

    Abstract translation: 可以提供在位图数据树中优化位图数据树和相应的查找操作。 可以对数据树的每个搜索节点的多个分支进行计数。 数据树可以包括多个搜索节点。 然后可以基于数据树中的分支数来识别多个搜索节点的最佳深度。 接下来,当搜索节点的分支数大于所识别的最佳深度时,可以添加散列节点来替换数据树的搜索节点。

Patent Agency Ranking