Call setup pacing in computer networks

• US 7,751,435 B2
• Filed: 08/13/2003
• Issued: 07/06/2010
• Est. Priority Date: 08/28/1998
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Damon, Philippe, Basso, Claude, Putois, Bernard, Hernandez, Jason J.
• Primary Examiner(s): Hoang; Thai D
• Application Number:
  US10/639,825
• Publication Number:
  US 20040047288A1
• Time in Patent Office: 2,519 Days
• Field of Search: 370229-237, 3703951-39543, 370/468
• US Class Current: 370/468
• CPC Class Codes: H04L 12/4608 LAN interconnection over ATM networks
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/745 Reaction in network
• CPC Class Codes: H04L 47/821 Prioritising resource allocation or reservation requests
• CPC Class Codes: H04L 47/826 Involving periods of time
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/14 Session management for real-time applications in data packet communications networks H04L65/1066
• CPC Class Codes: H04L 67/61 taking into account QoS or priority requirements
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A node in a computer network predefines a threshold number (Max) as the maximum number of allowed call set up messages (CSMs) to be processed from a plurality of sources by the network node, and predefines a time frame window as the time within which no more than the threshold number (Max) CSMs are accepted for processing by the network node. The node detects each new incoming CSM in the network node. The node rejects each new incoming CSM if the number of CSMs accepted for processing during the current time frame window equals the threshold number (Max). Otherwise, the node accepts each new incoming CSM that is not rejected. Also the node rejects each new incoming CSM if the number of CSMs currently being processed by the network node equals the threshold number (Max).

Claims

1. A method, comprising:

defining a threshold number (Max) as the maximum number of allowed call set up messages (CSMs) to be processed from a plurality of sources by a node in a computer network;

defining a time frame window as the time within which no more than the threshold number (Max) CSMs are accepted for processing by the node;

detecting, by the node, each new incoming CSM in the node;

rejecting, by the node, each new incoming CSM if the number of CSMs actually being processed by the node at a given instant in time equals the threshold number (Max);

if the number of CSMs actually being processed by the node at the given instant in time does not equal the threshold number (Max), comparing the number of CSMs accepted for processing during the current time frame window to the threshold number (Max) and rejecting, by the node, each new incoming CSM if the number of CSMs accepted for processing during the current time frame window equals the threshold number (Max);

accepting, by the node, each new incoming CSM that is not rejected and flagging the CSM in a memory table; and

subsequently, determining the CSM flagged in the memory table has been processed and, in response thereto, decrementing the number of CSMs accepted for processing during the current time frame window.

2. The method according to claim 1, further comprising:

incrementing a counter (CNT) each time an incoming CSM is received;

decrementing said counter (CNT) each time a CSM is processed; and

comparing the current value of said counter (CNT) to said threshold number (Max) to determine whether said incoming CSM should be rejected or processed further.

3. The method according to claim 1, further comprising:

incrementing a counter (CNT) each time an incoming CSM is received;

determining the value of the counter reached during the current time window; and

comparing the value of the counter reached during the current time window to said threshold number (Max) to determine whether said incoming CSM should be rejected or processed further.

4. The method according to claim 1, further comprising:

employing the node as a network switching device.

5. The method according to claim 1, further comprising:

employing the node as a database server.

6. The method, according to claim 1, further comprising:

filtering each new incoming CSM to determine whether said CSM satisfies at least one predefined filtering criterion, and accepting said incoming CSM if it does not satisfy any of said at least one predefined filtering criterion.

7. The method according to claim 6 wherein the at least one predefined filtering criterion comprises:

a network address.

8. An apparatus comprising:

means for defining a threshold number (Max) as the maximum number of allowed call set up messages (CSMs) to be processed from a plurality of sources by a node in a computer network;

means for defining a time frame window as the time within which no more than the threshold number (Max) CSMs are accepted for processing by the node;

means for detecting, at the node, each new incoming CSM in the node;

means for rejecting, at the node, each new incoming CSM if the number of CSMs actually being processed by the node at a given instant in time equals the threshold number (Max);

means for comparing the number of CSMs accepted for processing during the current time frame window to the threshold number (Max) if the number of CSMs actually being processed by the node at the given instant in time does not equal the threshold number (Max), and rejecting, each new incoming CSM if the number of CSMs accepted for processing during the current time frame window equals the threshold number (Max); and

means for accepting, at the node, each new incoming CSM that is not rejected and flagging the CSM in a memory table; and

means for determining the CSM flagged in the memory table has been processed and, in response thereto, decrementing the number of CSMs accepted for processing during the current time frame window.

9. The apparatus according to claim 8, further comprising:

means for filtering each new incoming CSM to determine whether said CSM satisfies at least one predefined filtering criterion, and accepting said incoming CSM if it does not satisfy any of said at least one predefined filtering criterion.

10. The apparatus according to claim 9, further comprising:

the at least one predefined filtering criterion is a network address.

11. The apparatus according to claim 8, further comprising:

a counter (CNT) which is incremented each time an incoming CSM is received, and the counter (CNT) is decremented each time a CSM is processed; and

means for comparing the current value of said counter (CNT) to said threshold number (Max) to determine whether said incoming CSM should be rejected or processed further.

12. The apparatus according to claim 8, further comprising:

a counter (CNT) which is incremented each time an incoming CSM is received;

means for determining the value of the counter reached during the current time window; and

means for comparing the value of the counter reached during the current time window to said threshold number (Max) to determine whether said incoming CSM should be rejected or processed further.

13. The apparatus according to claim 8, further comprising:

the node is a network switching device.

14. The apparatus according to claim 8, further comprising:

the node is a database server.