System and method of processing control plane data

Patent metadata

Field	Value
Publication number	US-2024121203-A1
Application number	US-202318487586-A
Country	US
Kind code	A1
Filing date	Oct 16, 2023
Priority date	Sep 29, 2017
Publication date	Apr 11, 2024
Grant date	—

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

1 - 32 . (canceled)

33 . A method in a network device, the method comprising:
receiving network data; and applying a hash function to compute at least one lookup value using at least a portion of the received network data comprising data fields of the received network data that are determined based on a packet class of the received network data; generating a set of result bits comprising at least one bit from a bitfield of the at least one lookup value; and assigning a priority to the received network data, including:
assigning a high priority to the received network data when the set of resulting bits is in a first data state, and
assigning a low priority to the received network data when the set of resulting bits is in a second data state; and
queuing the received network data in a queue based on the assigned priority.

34 . The method of claim 33 , wherein the first data state is one or more bits in the set of resulting bits being unset, wherein the second data state is all the bits in the set of resulting bits being set.

35 . The method of claim 33 , wherein queueing the received network data includes selecting a queue from two or more queues based on the assigned priority and queueing the received network data on the selected queue.

36 . The method of claim 33 , wherein queueing the received network data includes setting a queue threshold for the received network data based on the assigned priority, wherein the queue threshold is the threshold where packets can be dropped.

37 . The method of claim 33 , further comprising, when the bit is in the set state, clearing the bits in the set of resulting bits after passage of a period of time.

38 . The method of claim 37 , wherein the period of time is based on the packet class of the received network data.

39 . The method of claim 33 , further comprising using a second hash function to compute at least a second lookup value based on the packet vector of the received network data, wherein the set of result bits further comprises a bit from a bitfield of the second lookup value.

40 . A network device comprising:
one or more computer processors; and a computer-readable storage device comprising instructions for controlling the one or more computer processors to:
receive network data;
compute at least one lookup value using a portion of the received network data determined based on a packet class of the received network data;
generate a set of result bits comprising at least one bit from a bitfield of the at least one lookup value; and
assign a priority to the received network data, including:
assigning a high priority to the received network data when the set of resulting bits is in a first data state, and
assigning a low priority to the received network data when the set of resulting bits is in a second data state; and

queuing the received network data in a queue based on the assigned priority.

41 . The network device of claim 40 , wherein the first data state is one or more bits in the set of resulting bits being unset, wherein the second data state is all the bits in the set of resulting bits being set.

42 . The network device of claim 40 , wherein queueing the received network data includes selecting a queue from two or more queues based on the assigned priority and queueing the received network data on the selected queue.

43 . The network device of claim 40 , wherein queueing the received network data includes setting a queue threshold for the received network data based on the assigned priority, wherein the queue threshold is the threshold where packets can be dropped.

44 . The network device of claim 40 , wherein the computer-readable storage device further comprises instructions for controlling the one or more computer processors to clear the bits in the set of resulting bits after passage of a period of time when the bit is in the set state.

45 . The network device of claim 44 , wherein the period of time is based on the packet class of the received network data.

46 . The network device of claim 40 , wherein the at least one lookup value is computed using a first hash function, wherein the computer-readable storage device further comprises instructions for controlling the one or more computer processors to use a second hash function to compute at least a second lookup value based on the packet vector of the received network data, wherein the set of result bits further comprises a bit from a bitfield of the second lookup value.

47 . A non-transitory computer-readable storage device in a network device, the non-transitory computer-readable storage device having stored thereon computer executable instructions, which when executed, cause the network device to:
receive network data; compute at least one lookup value using a portion of the received network data determined based on a packet class of the received network data; generate a set of result bits comprising at least one bit from a bitfield of the at least one lookup value; and assign a priority to the received network data, including:
assigning a high priority to the received network data when the set of resulting bits is in a first data state, and
assigning a low priority to the received network data when the set of resulting bits is in a second data state; and
queuing the received network data in a queue based on the assigned priority.

48 . The non-transitory computer-readable storage device of claim 47 , wherein the first data state is one or more bits in the set of resulting bits being unset, wherein the second data is all the bits in the set of resulting bits being set.

49 . The non-transitory computer-readable storage device of claim 47 , wherein queueing the received network data includes selecting a queue from two or more queues based on the assigned priority and queueing the received network data on the selected queue.

50 . The non-transitory computer-readable storage device of claim 47 , wherein queueing the received network data includes setting a queue threshold for the received network data based on the assigned priority, wherein the queue threshold is the threshold where packets can be dropped.

51 . The non-transitory computer-readable storage device of claim 47 , wherein the computer-readable storage device further comprises instructions for controlling the one or more computer processors to clear the bits in the set of resulting bits after passage of a period of time when the bit is in the set state.

52 . The non-transitory computer-readable storage device of claim 47 , wherein the computer-readable storage device further comprises instructions for controlling the one or more computer processors to compute at least a second lookup value based on the packet vector of the received network data, wherein the set of result bits further comprises a bit from a bitfield of the second lookup value.

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