Method for monitoring data flow at a node on a network facilitating data transfer on at least one link having at least one class of service

• US 6,578,083 B2
• Filed: 03/04/2002
• Issued: 06/10/2003
• Est. Priority Date: 02/05/1999
• Status: Expired due to Term

• Current Assignee: Parity Networks LLC
• Original Assignee: Pluris, Inc
• Inventors: Tuck, III, Russell R.
• Primary Examiner(s): Lim, Krisna
• Application Number:
  US10/092,273
• Publication Number:
  US 20020152306A1
• Time in Patent Office: 463 Days
• Field of Search: 709/235, 709/224, 709/232, 709/223, 370/230, 370/232, 370/233, 370/235
• US Class Current: 709/235
• CPC Class Codes: H04L 12/5602 Bandwidth control in ATM Networks, e.g. leaky bucket
• CPC Class Codes: H04L 2012/5637 Leaky Buckets
• CPC Class Codes: H04L 43/00 Arrangements for monitoring or testing data switching networks
• CPC Class Codes: H04L 43/026 using flow identification
• CPC Class Codes: H04L 43/16 Threshold monitoring
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/20 Traffic policing
• CPC Class Codes: H04L 47/21 using leaky-bucket
• CPC Class Codes: H04L 47/215 using token-bucket
• CPC Class Codes: H04L 47/24 Traffic characterised by specific attributes, e.g. priority or QoS
• CPC Class Codes: H04L 47/2433 Allocation of priorities to traffic types
• CPC Class Codes: H04L 47/30 in combination with information about buffer occupancy at either end or at transit nodes
• CPC Class Codes: H04L 47/31 by tagging of packets, e.g. using discard eligibility [DE] bits
• CPC Class Codes: H04L 47/32 by discarding or delaying data units, e.g. packets or frames
• CPC Class Codes: H04L 47/43 Assembling or disassembling of packets, e.g. segmentation and reassembly [SAR]
• CPC Class Codes: H04Q 2213/13103 Memory
• CPC Class Codes: H04Q 2213/13106 Microprocessor, CPU
• CPC Class Codes: H04Q 2213/1325 Priority service
• CPC Class Codes: H04Q 2213/13251 Restricted service, class of service
• CPC Class Codes: H04Q 2213/13296 Packet switching, X.25, frame relay
• CPC Class Codes: H04Q 2213/13389 : LAN, internet

Abstract

An apparatus and method for monitoring data flow at a node on a network are disclosed. A memory location or “bucket” is allocated to each of a plurality of links and classes of service at the node. A free-running counter is incremented at a rate determined by the maximum allowable data rates on the various links and classes of service. When a data packet is received at a particular link and class of service, the corresponding memory location or bucket is adjusted or “leaked” by subtracting the present counter value from the present bucket contents. That difference is then added to the number of units of data, i.e., bytes or groups of bytes of data, contained in the incoming packet. That sum is then compared with a predetermined threshold determined by the allowable data rate associated with the link and class of service. If the threshold is exceeded, then the incoming data packet is marked accordingly. The system can include multiple stages of monitoring such that multiple thresholds can be used to assign one of multiple discard eligibility values to the incoming packet.

Claims

1. A method of monitoring data traffic at a node on a network, the node facilitating data transfer on at least one link having at least one class of service, the data being transferred in data packets and each data packet including at least one unit of data, said method comprising:

for each of at least one selected link and class of service, storing an updatable value in a storing device;

incrementing a counter value in a counter at a rate determined by an allowable data rate associated with the selected link and class of service;

receiving a data packet;

counting a number of units of data in the data packet;

computing an adjusted updatable value by adjusting the updatable value according to the counter value when the data packet was received and the number of units of data in the data packet;

comparing the adjusted updatable value to individual ones of a set of predetermined thresholds associated with the selected link and class of service; and

assigning a discard eligibility to the data packet according to which threshold is exceeded, if any.

2. A method of monitoring data traffic at a node on a network, the node facilitating data transfer on at least one link having at least one class of service, the data being transferred in data packets and each data packet including at least one unit of data, said method comprising:

for each of at least one selected link and class of service, storing an updatable value in a storing device;

incrementing a counter value in a counter at a rate determined by an allowable data rate associated with the selected link and class of service;

receiving a data packet;

counting a number of units of data in the data packet;

computing an adjusted updatable value by adjusting the updatable value according to the counter value when the data packet was received and the number of units of data in the data packet;

comparing the adjusted updatable value to individual ones of a set of predetermined thresholds associated with the selected link and class of service;

associating a discard priority with each threshold; and

computing a single discard priority for the data packet according to which thresholds are exceeded and the priorities associated with the thresholds.