Multivariate rate-based overload control for multiple-class communications traffic

• US 6,327,361 B1
• Filed: 07/13/1998
• Issued: 12/04/2001
• Est. Priority Date: 07/13/1998
• Status: Expired due to Term

• Current Assignee: WSOU Investments, LLC (WSOU Holdings, LLC)
• Original Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Inventors: Sohraby, Kazem Anaraky, Malek, Manu, Harshavardhana, Paramasiviah
• Primary Examiner(s): Tsang, Fan
• Assistant Examiner(s): Foster, Roland G.
• Application Number:
  US09/114,645
• Time in Patent Office: 1,240 Days
• Field of Search: 379/111, 379/112, 379/114, 379/115, 379/133, 379/134, 379/137, 379/207, 379/219, 379/229, 379/230, 379/258, 379/268, 379/279, 370/231, 370/410, 370/426
• US Class Current: 379/230
• CPC Class Codes: H04M 3/36 Statistical metering, e.g. recording occasions when traffic exceeds capacity of trunks
• CPC Class Codes: H04Q 2213/13097 Numbering, addressing
• CPC Class Codes: H04Q 2213/13103 Memory
• CPC Class Codes: H04Q 2213/13106 Microprocessor, CPU
• CPC Class Codes: H04Q 2213/13164 Traffic (registration, measurement,...)
• CPC Class Codes: H04Q 2213/13166 Fault prevention
• CPC Class Codes: H04Q 2213/13176 Common channel signaling, CCS7
• CPC Class Codes: H04Q 2213/13213 Counting, timing circuits
• CPC Class Codes: H04Q 2213/13335 Simulation, emulation
• CPC Class Codes: H04Q 2213/13345 Intelligent networks, SCP
• CPC Class Codes: H04Q 2213/13349 Network management
• CPC Class Codes: H04Q 2213/13387 Call gapping
• CPC Class Codes: H04Q 3/0091 Congestion or overload control

Abstract

A method and system for controlling overload at a network processor in a communications system. Messages relating to a plurality of types of calls, functions or processes (collectively, “calls”) received at a processor seeking access to processor resources are granted normal access when the delay in processing such messages does not exceed threshold values. When such delay exceeds a threshold, messages are blocked in numbers relating to, among other things, the number of messages allowed in a reference interval, message delay, the total number of blocked calls, the number of blocked calls of each type, the number of calls allowed in one or more preceding intervals and preferences between types of calls.

Claims

1. At a first network node, a method for controlling the delivery of a plurality M of different types of messages, each type of said message pertaining to a request for a corresponding quality of processor resources, said method comprising the step of

determining the delay encountered by said messages in gaining access to said processor resources,

when said delay exceeds a predetermined threshold,

determining a total number of messages, Nⁿ, to be delivered to said processor in an nth l-second interval, said total number of messages comprising a number of messages N_iⁿ corresponding to the ith type of messages, for i=1, 2, . . . , M,

for each type of message, i, blocking delivery of messages in excess of said N_iⁿ, which messages become available for presentation to said processor during said nth interval.

2. The method of claim 1 further comprising the steps of determining NB_iⁿ, the number of messages of type i that are blocked during the nth time interval, and adjusting N_iⁿ for the (n+1)th interval based on said number of blocked messages and said delay encountered by said messages.

3. The method of claim 1 wherein said determining delay encountered by said messages comprises determining a function of delay for messages received over a plurality of said l-second intervals.

4. The method of claim 3 wherein said determining delay encountered by said messages comprises determining an average of delay for messages received over a plurality of said l-second intervals.

5. The method of claim 1 wherein said determining a total number of messages, Nⁿ, to be delivered to said processor in an nth l-second interval, comprises determining a function of Nⁿ over a plurality of said l-second intervals.

6. The method of claim 1 wherein said determining a total number of messages, Nⁿ, to be delivered to said processor in an nth l-second interval, comprises determining an average of Nⁿ over plurality of said l-second intervals.

7. The method of claim 6 wherein said determining a number of messages of type i, N_iⁿ, to be delivered to said processor in an nth l-second interval, comprises determining a function of N_iⁿ over a plurality of said l-second intervals.

8. The method of claim 7 wherein said determining a number of messages of type i, N_iⁿ, to be delivered to said processor in an nth l-second interval, comprises determining an average of N_iⁿ over a plurality of said l-second intervals.

9. The method of claim 1 further comprising the step of sending messages from said first node to other nodes in a network, said messages indicating that messages sent to said first node have not been granted access to said processor resources.

10. The method of claim 1 further comprising the step of sending at least one message from said first node to a network management node for use by said network management node in imposing call control measures on a network including said first node.

11. The method of claim 1 further comprising the step of sending at least one message from said first node to a network management node in a network, said message(s) indicating that messages sent to said first node have not been granted access to said processor resources.

12. The method of claim 10 further comprising the step of sending a message from said network management node to one or more nodes in a network other than said first node, said message imposing a restriction on messages sent by said one or more nodes.

13. The method of claim 12 wherein said one or more message(s) sent by said network management node imposes restriction on sending messages to said first node.

14. The method of claim 1 wherein said total number of messages for the (n+1)th l-second interval is decreased relative to Nⁿ when the delay for the nth interval exceeds said predetermined threshold.

15. The method of claim 1 wherein said total number of messages for the (n+1)th l-second interval is increased relative to Nⁿ when the delay for the nth interval is less than said predetermined threshold.

16. The method of claim 1 wherein said total number of messages for the (n+1)th l-second interval is equal to Nⁿ when the delay for the nth interval is equal to said predetermined threshold.

17. The method of claim 11 further comprising the step of receiving one or more control messages at said first node, said control messages indicating the number of messages intended for said first node that have been blocked at one or more network nodes.

18. The method of claim 17 wherein said receiving of one or more control messages comprises receiving at least one message from said network management node.

19. The method of claim 17 wherein said receiving of one or more control messages comprises receiving at least one message from nodes other than said network management node.

20. The method of claim 1 wherein said determining of said delay encountered by said messages comprises determining a function of delay for each type of message, i, for a respective time interval, l.

21. The method of claim 20 wherein said determining delay encountered by said messages of type i comprises determining an average of delay for messages of type i received over a plurality of said l-second intervals.

22. The method of claim 20 further comprising the step of determining N_iⁿ based on said number of blocked messages and said delay for messages of type i.