System and method of processing control plane data

Patent metadata

Field	Value
Publication number	US-11805077-B2
Application number	US-201816146988-A
Country	US
Kind code	B2
Filing date	Sep 28, 2018
Priority date	Sep 29, 2017
Publication date	Oct 31, 2023
Grant date	Oct 31, 2023

Abstract

A method and apparatus of a network element that processes control plane data in a network element is described. In an exemplary embodiment, the network element receives control plane data and determines a class of the control plane data. In addition, the network element marks the control plane data based on at least on an existence of an indication of whether the network element had previously processed other data in the same class as the class of the control plane data. Furthermore, the network element queues the control plane data.

First claim

What is claimed is:

1. A non-transitory machine-readable medium having executable instructions to cause one or more processing units to perform a method to process control plane data in a network element, the method comprising:
receiving, by the network element, the control plane data, wherein the control plane data is data that is processed by a control plane of the network element;
determining, in the control plane, a routing protocol packet class of the received control plane data,
determining, in the control plane, that the network element had previously processed other data in a same routing protocol packet class as the determined routing protocol packet class of the received control plane data by:
computing a hash on a packet vector associated with the received control plane data to produce a hash result, wherein the packet vector is based on the routing protocol packet class; and
determining whether a bit location corresponding to the hash result in a bitfield is set;

in response to determining that the network element had previously processed other data in the same routing protocol packet class, queuing, in a queue in the control plane, the received control plane data based on a priority, the priority being determined based on whether the bit location is set, the setting of the bit location relating to the previously processed determination of the control plane data, and a control plane processor processing the control plane data de-queued from the queue; and
clearing the bit location corresponding to the hash result in the bitfield after an expiration time, wherein the expiration time is based on at least the determined routing protocol packet class of the data.

2. The machine-readable medium of claim 1 , further comprising marking the received control plane data based on an existence of an indication, wherein the indication is when all of a first group of bits in a group of bitfields are set to a selected value.

3. The machine-readable medium of claim 2 , wherein all of the bits in the first group of bits are set to the selected value when the network element had previously processed the other data in the same routing protocol packet class as the determined routing protocol packet class of the received control plane data within a time period.

4. The machine-readable medium of claim 2 , wherein all of the bits in the first group of bits are not set to the selected value when the network element had not previously processed the other data in the same routing protocol packet class as the determined routing protocol packet class of the received control plane data within a time period.

5. The machine-readable medium of claim 1 , further comprising:
marking the received control plane data based on an existence of an indication; and
forwarding the marked control plane data to a central processing unit based on at least the marking.

6. The machine-readable medium of claim 1 , further comprising marking the received control plane data based on an existence of an indication, wherein the control plane data is given a first priority marking when there is not the existence of the indication for the determined routing protocol packet class.

7. The machine-readable medium of claim 1 , further comprising marking the received control plane data based on an existence of an indication, wherein the control plane data is given a second priority marking when there is the existence of the indication for the determined routing protocol packet class.

8. The machine-readable medium of claim 1 , further comprising marking the received control plane data based on an existence of an indication, wherein the indication is determined at least by computing a function of a subset of received control plane data characteristics of the received control plane data.

9. The machine-readable medium of claim 8 , wherein the function is a hash function.

10. The machine-readable medium of claim 8 , wherein the subset of received control plane data characteristics is selected based on at least a control plane data type of the received control plane data.

11. The machine-readable medium of claim 10 , wherein the control plane data type is selected from the group consisting of Internet Protocol (IP) unresolved next hops, address resolution protocol, IPv6 neighbor discovery packets, Access Control List logging, packet addressed to the network element, packets addressed to the network element from a known source, and maximum transmission unit violations.

12. The machine-readable medium of claim 8 , wherein the subset of received control plane data characteristics is based on at least user criteria.

13. The machine-readable medium of claim 2 , further comprising:
clearing a second group of bits in a group of bitfields after the expiration time.

14. The machine-readable medium of claim 13 , wherein the time period is measured using a timer.

15. The machine-readable medium of claim 1 , further comprising marking the received control plane data based on an existence of an indication, wherein queuing the control plane data comprises:
selecting at least one of a queue and a queue threshold for the control plane data based on at least the existence of the indication.

16. The machine-readable medium of claim 1 , wherein the queue is one or more of a single queue having different drop thresholds based on the priority and a plurality of queues having different scheduling properties associated with the priority.

17. The machine-readable medium of claim 1 , wherein the bit location is alternatively set using a probability function.

18. The machine-readable medium of claim 1 , wherein the expiration time is further based on one of a round trip time for an Address Resolution Protocol (ARP) request between the network device and a sender of the control plane data when the control plane data is an ARP request, and a frequency for logging an Access Control List (ACL) when the control plane data is an ACL logging packet.

19. A method to process control plane data in a network element, the method comprising:
receiving, by the network element, the control plane data, wherein the control plane data is data that is processed by a control plane of the network element;
determining, in the control plane, a routing protocol packet class of the received control plane data;
determining, in the control plane, whether the network element had previously processed other data in a same routing protocol packet class as the determined routing protocol packet class of the received control plane data by:
computing a hash on a packet vector associated with the received control plane data to produce a hash result, wherein the packet vector is based on the routing protocol packet class; and
determining whether a bit location corresponding to the hash result in a bitfield is set;

in response to determining that the network element had previously processed other data in the same routing protocol packet class, queuing, in a queue in the control plane, the received control plane data based on a priority, the priority being determined based on whether the bit location is set, the setting of the bit location relates to the previously processed determination of the control plane data, and a control plane processor processing the control plane data de-queued from the queue; and
clearing the bit location corresponding to the hash result in the bitfield after an expiration time, wherein the expiration time is based on at least the determined routing protocol packet class of the data.

20. Th

Assignees

• Arista Networks Inc

Inventors

• Labonte Francois
• Holbrook Hugh W

Classifications

• H04L49/3018 Primary

  Input queuing · CPC title

• H04L47/2441

  relying on flow classification, e.g. using integrated services [IntServ] · CPC title

• H04L49/252

  Store and forward routing · CPC title