Method and apparatus for determining bandwidth-consuming frame flows in a network

• US 9,054,972 B2
• Filed: 10/11/2013
• Issued: 06/09/2015
• Est. Priority Date: 07/25/2007
• Status: Expired due to Fees

• Current Assignee: Avago Technologies International Sales Pte Limited (Broadcom, Inc.)
• Original Assignee: Brocade Communications Systems, Inc. (Broadcom, Inc.)
• Inventors: Kanda, Amit, Gnanasekaran, Sathish Kumar
• Primary Examiner(s): LY, ANH VU H
• Application Number:
  US14/052,393
• Publication Number:
  US 20140036717A1
• Time in Patent Office: 606 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: H04L 43/026 using flow identification
• CPC Class Codes: H04L 43/0894 Packet rate
• CPC Class Codes: Y02D 30/50 in wire-line communication networks, e.g. low power modes or reduced link rate

Abstract

A port monitor monitors network traffic that passes through a port of a switch. Frame flows routed through the switch are counted by hardware frame counting logic, which includes a content-addressable memory (CAM) and counters corresponding to various frame flows. Port monitor software includes logical containers (“buckets”), which are used to record and sort counts of the frame flows from hardware based on activity of the frame flows. Frame flow sorting is based on confidence building algorithms such that the thrashing of frame flows between buckets is reduced. Storage and sorting of the frame flows in software allows the activity level of any number of frame flows associated with the switch to be counted, regardless of hardware limitations on how many frame flows can be counted. This allows a real-time analysis of frame flows and a determination of frame flows that are major users of Fiber Channel bandwidth.

Claims

1. A method comprising:

counting every frame of a first set of a plurality of flows and of a portion of a second set of said plurality of flows over a first time period;

selecting flows from said plurality of flows for inclusion in said first set and said second set; and

changing said portion of said second set counted so that each flow in said second set is periodically counted every frame over a second time period.

2. The method of claim 1, wherein said first set of flows has higher flow rates than said second set of flows.

3. The method of claim 2, wherein said selecting is based on flow rates of frames.

4. The method of claim 1, said first set has same number of hardware counters associated with it for counting frames as there are frame flows in said first set.

5. The method of claim 1, wherein said second set has a smaller number of hardware counters associated with it for counting frames than there are frame flows in said second set.

6. The method of claim 5, wherein a content-addressable memory associates each frame flow having an associated hardware counter to the associated hardware counter.

7. The method of claim 1, wherein selecting flows from said plurality of flows for inclusion in said first set comprises selecting frame flows with the highest count values for said first set.

8. The method of claim 7, further comprising selecting the remaining flows for inclusion in said second set.

9. The method of claim 1, wherein said first set of flows is smaller than the second set.

10. A non-transitory computer readable storage medium storing instructions, the instructions when executed causing a processor to:

count every frame of a first set of a plurality of flows and of a portion of a second set of said plurality of flows over a first time period;

select flows from said plurality of flows for inclusion in said first set and said second set; and

change said portion of said second set counted so that each flow in said second set is periodically counted every frame over a second time period.

11. The non-transitory computer readable storage medium of claim 10, wherein said first set of flows has higher flow rates than said second set of flows.

12. The non-transitory computer readable storage medium of claim 11, wherein said selecting is based on flow rates of frames.

13. The non-transitory computer readable storage medium of claim 10, wherein said first set has same number of hardware counters associated with it for counting frames as there are frame flows in said first set.

14. The non-transitory computer readable storage medium of claim 13, wherein a content-addressable memory associates each frame flow having an associated hardware counter to the associated hardware counter.

15. The non-transitory computer readable storage medium of claim 10, wherein said second set has a smaller number of hardware counters associated with it for counting frames than there are frame flows in said second set.

16. The non-transitory computer readable storage medium of claim 10, wherein selecting flows from said plurality of flows for inclusion in said first set comprises selecting frame flows with the highest count values for said first set.

17. The non-transitory computer readable storage medium of claim 16, wherein the instructions when executed further cause the processor to select the remaining flows for inclusion in said second set.

18. The non-transitory computer readable storage medium of claim 10, wherein every frame of the first set of the plurality of flows is counted more frequently than the portion of the second set.

19. A network device comprising:

a processor;

memory operatively connected to said processor to store software programs and data;

detection logic configured to detect selected values in portions of each frame in each of a plurality of frame flows;

a plurality of hardware counters operatively coupled to said processor and operatively connected to said detection logic and configured to count every frame of selected frame flows; and

a software program stored in said memory to be executed by said processor to;

configure said plurality of hardware counters to count every frame of a first set of said plurality of flows and of a portion of a second set of said plurality of flows over a first time period;

select flows from said plurality of flows for inclusion in said first set and said second set; and

configure said plurality of hardware counters with said portion of said second set counted every frame so that each flow in said second set is periodically counted every frame over a second time period.

20. The network device of claim 19, wherein said first set of flows has higher flow rates than said second set of flows.

21. The network device of claim 20, wherein said selecting is based on flow rates of frames.

22. The network device of claim 19, wherein every frame of the first set of the plurality of flows is counted more frequently than the portion of the second set.