DYNAMIC LOAD LIMITING

Abstract: A service switching point counts the number of pending queries sent to a service control point and awaiting a response. When the counted number reaches a threshold, further call attempts are rejected. This prevents the load on the service control point from becoming excessive.

Description: DYNAMIC LOAD LIMITING This invention relates to a mechanism for limiting the load on a central point in a network architecture. In particular, the illustrated embodiment of the invention relates to a mechanism for limiting the load on a Service Control Point in an Intelligent Networks architecture . An Intelligent Networks architecture includes a Service Control Point (SCP) , which typically has a large number of Service Switching Points (SSP) connected to it. Each SSP is a switching system that can intercept telephone calls, and query the SCP. The SCP contains service specific logic and data, that allows it to return instructions to the SSP on how to deal with the intercepted call. Clearly, if the SCP receives an excessive number of simultaneous queries from different SSPs, congestion may arise in the network's signalling links, the processing capability of the SCP may be overloaded, and unacceptable delays in processing the calls may result. In an existing Intelligent Network specification, ETS 300 374-1, at pages 136-139, call gapping is provided as the only means to reduce signalling traffic sent towards SCPs . When a SCP detects a high load condition, it sends instructions back to some or all SSPs to begin call gapping, meaning that those SSPs reduce the rate at which they are allowed to send queries to the SCP. However, this mechanism is rather inefficient, because of the delays which exist between the detection of the high load condition by the SCP and the time at which call gapping is initiated by the SSP. The result is that an unexpected peak in the number of SCP queries can still cause the SCP to be overloaded. In accordance with the present invention, the SSP has a dynamic mechanism for monitoring the load condition of the SCP, and preventing overload. This is achieved by defining a ceiling for the number of SCP queries awaiting a response, and rejecting call attempts which would take the number of pending queries above that ceiling. This has the advantage the SSP can automatically react to a change in the load condition of the SCP, without requiring any message to be sent from the SCP, allowing faster reaction to an unexpected burst of call attempts. For a better understanding of the present invention, reference will now be made, by way of example, to the accompanying drawings, in which :- Figure 1 is a block schematic diagram of a network architecture implementing the present invention; and Figure 2 is a flow diagram illustrating a part of the operation of a SSP in accordance with the present invention. The network architecture illustrated in Figure 1 comprises a Service Control Point (SCP) 2, to which are connected a number of Service Switching Points (SSPs) 4, 6, 8, 10. It will be appreciated, that, in practice, the number of SSPs connected to a SCP will be large. In the Intelligent Networks architecture, the SSP intercepts telephone calls, and sends queries to the SCP. The SCP returns instructions to the SSP on how further to treat the intercepted call . Figure 2 is a flow chart which shows how a SSP may implement the call limiting mechanism in accordance with the invention. Within the SSP, a counter may be allocated to a given set of call criteria, such as a particular dialled number. For each counter, a predetermined maximum value, i.e. a ceiling, is set. In the process shown in Figure 2, in step 22, a call attempt is received at the SSP matching one of the criteria. In step 24, the corresponding counter value is incremented. In step 26, it is determined whether the counter value has reached its predetermined maximum value. If it has not, the query is sent to the SCP in step 28. As soon as a reply is received from the SCP on a pending query, in step 36, the corresponding counter value is decremented in step 38. A success counter, representing the number of consecutive queries which have been successfully responded to, is incremented in step 40. It is then determined in step 42 whether the success counter has reached a predefined number. If so, the defined maximum counter value is automatically raised by a predefined increment in step 44. The process then returns to the start. If it is determined in step 26 that the counter value has reached its predetermined maximum value, it is an indication that the SCP is in a high load condition, with a correspondingly increased response time to queries. In order to deal with this problem, in step 30 the determined maximum counter value is reduced by a predefined decremental step. Then, in step 32, the received call is rejected, and no further call attempts are accepted. The success counter is also reset to zero in step 33. While in this state, as shown in step 34, the counter value is monitored, until it reaches a lower value, which is a certain percentage below the present determined maximum counter value. When this lower value is reached, i.e. the answer YES is obtained in step 34, the SSP is again able to answer call attempts, and the process returns to the start. This mechanism can retain in place permanently, or may be activated either manually at the SSP, or by means of an instruction sent to the SSP from the SCP. Moreover, the setting of the initial maximum value for the counter can similarly be set either manually at the SSP, or by means of instruction from the SCP. There is thus provided a mechanism which allows an SSP to adjust automatically to the load on the SCP, without requiring messages to be sent from the SCP. The fact that there always exists a maximum value for the counter means that the mechanism is always able to deal with sudden bursts of call attempts. Although the invention has been described above in terms of an Intelligent Networks telecommunications architecture, with the SSP containing the mechanism for limiting the queries sent to a SCP, it will be appreciated that a similar mechanism can be used in any network architecture which requires queries to be sent to a centralised database or control point, for example in mobile telecommunication networks, credit card databases, or computer networks.

Claims: CLAIMS 1. A switching point, for use in a network architecture having a central control point and a plurality of switching points connected thereto, wherein the switching point : sends queries to the control point, and receives responses therefrom; counts the number of pending queries sent to the control point and awaiting a response; and prevents further queries from being sent to the control point when the number of pending queries reaches a threshold value. 2. A switching point as claimed in claim 1, wherein the threshold value is decreased when the number of pending queries reaches the threshold value. 3. A switching point as claimed in claim 1 or 2 , wherein the threshold value is increased when a predetermined number of consecutive queries receives successful responses. 4. A switching point as claimed in claim 1, which counts a plurality of numbers of pending queries of different categories. 5. A method of handling a telephone call in a switching point forming part of a network architecture having a central control point and a plurality of switching points connected thereto, the control point handling queries sent from the switching points, and the method comprising: receiving a call attempt; incrementing a counter value, which is decremented whenever a query receives a response from the control poin ; comparing the counter value with a predetermined threshold; and if the counter value is lower than the threshold value, sending a query to the control point, and, if the counter value is equal to or higher than the threshold value, rejecting the call attempt. 6. A method as claimed in claim 5, comprising a step of determining whether a call attempt meets one of a plurality of predetermined criteria, and, if so, incrementing a counter value associated therewith. 7. A method as claimed in claim 6, wherein each counter value, associated with a respective predetermined criterion, has a respective predetermined threshold. 8. A network architecture, comprising a central control point and a plurality of switching points connected thereto, each switching point sending queries to the control point, and receiving responses therefrom, wherein each switching point counts the number of pending queries sent to the control point and awaiting a response, and prevents further queries from being sent when the number of pending queries reaches a threshold value. 9. An architecture as claimed in claim 8, wherein the threshold value is reduced when the counted value reaches the threshold. 10. An architecture as claimed in claim 8 or 9 , wherein the threshold value is increased when a predetermined number of consecutive queries receives successful responses from the control point.

Inventors: ABEN FREEK, CROUGHAN LOUISE, JELLEMA BART, PEEREN RENE, ABEN, FREEK, CROUGHAN, LOUISE, JELLEMA, BART, PEEREN, RENE
Applicants: ABEN FREEK, CROUGHAN LOUISE, ERICSSON TELEFON AB L M, JELLEMA BART, PEEREN RENE, ABEN, FREEK, CROUGHAN, LOUISE, JELLEMA, BART, PEEREN, RENE, TELEFONAKTIEBOLAGET LM ERICSSON
Application year: 1997
Main classification: H04M3
IPC codes: H04M3, H04Q3