US 11,750,526 B2
Using stateful traffic management data to perform packet processing
Yi Li, Fremont, CA (US); Michael Feng, Mountain View, CA (US); Anurag Agrawal, Santa Clara, CA (US); Jeongkeun Lee, Los Altos, CA (US); Changhoon Kim, Palo Alto, CA (US); and Remy Chang, Milpitas, CA (US)
Assigned to Barefoot Networks, Inc., Santa Clara, CA (US)
Filed by Barefoot Networks, Inc., Santa Clara, CA (US)
Filed on Dec. 24, 2020, as Appl. No. 17/134,110.
Application 17/134,110 is a continuation of application No. 15/835,238, filed on Dec. 7, 2017, granted, now 10,911,377.
Claims priority of provisional application 62/537,917, filed on Jul. 27, 2017.
Claims priority of provisional application 62/535,934, filed on Jul. 23, 2017.
Prior Publication US 2021/0119939 A1, Apr. 22, 2021
Int. Cl. H04L 47/625 (2022.01); H04L 45/7453 (2022.01); H04L 41/142 (2022.01); H04L 49/00 (2022.01); H04L 43/0882 (2022.01); H04L 43/16 (2022.01); H04L 45/00 (2022.01); H04L 45/745 (2022.01); H04L 45/24 (2022.01); H04L 47/32 (2022.01); H04L 47/628 (2022.01); H04L 49/109 (2022.01); H04L 47/62 (2022.01); H04L 49/90 (2022.01); H04L 69/22 (2022.01); H04L 49/101 (2022.01); H04L 12/18 (2006.01)
CPC H04L 47/6255 (2013.01) [H04L 41/142 (2013.01); H04L 43/0882 (2013.01); H04L 43/16 (2013.01); H04L 45/245 (2013.01); H04L 45/72 (2013.01); H04L 45/745 (2013.01); H04L 45/7453 (2013.01); H04L 47/32 (2013.01); H04L 47/62 (2013.01); H04L 47/628 (2013.01); H04L 49/109 (2013.01); H04L 49/3063 (2013.01); H04L 49/90 (2013.01); H04L 69/22 (2013.01); H04L 12/1886 (2013.01); H04L 49/101 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method performed by a network forwarding integrated circuit (IC), the method comprising:
receiving queue depth information at a non-final stage of a packet processing pipeline from a certain stage of the packet processing pipeline, the non-final stage being subsequent to the certain stage in the packet processing pipeline; and
at the non-final stage of the packet processing pipeline, allocating a packet to a particular queue based on the received queue depth information;
wherein:
the certain stage comprises a match-action stage;
the queue depth information is to be stored, at least in part, in multiple copies of match-action stage table data stored in the match-action stage; and
the non-final stage is to write the queue depth information to at least one memory location identified by the certain stage.