CA2260821A1 - Dynamic load limiting - Google Patents
Dynamic load limiting Download PDFInfo
- Publication number
- CA2260821A1 CA2260821A1 CA002260821A CA2260821A CA2260821A1 CA 2260821 A1 CA2260821 A1 CA 2260821A1 CA 002260821 A CA002260821 A CA 002260821A CA 2260821 A CA2260821 A CA 2260821A CA 2260821 A1 CA2260821 A1 CA 2260821A1
- Authority
- CA
- Canada
- Prior art keywords
- queries
- control point
- threshold value
- pending
- point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
- 230000004044 response Effects 0.000 claims abstract description 10
- 238000000034 method Methods 0.000 claims description 8
- 230000003247 decreasing effect Effects 0.000 claims 3
- 230000007246 mechanism Effects 0.000 description 9
- 230000008569 process Effects 0.000 description 3
- 230000001934 delay Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000008278 dynamic mechanism Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
- H04Q3/0029—Provisions for intelligent networking
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/22—Arrangements for supervision, monitoring or testing
- H04M3/36—Statistical metering, e.g. recording occasions when traffic exceeds capacity of trunks
- H04M3/365—Load metering of control unit
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13561—Indexing scheme relating to selecting arrangements in general and for multiplex systems congestion - inc. overflow
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13562—Indexing scheme relating to selecting arrangements in general and for multiplex systems blocking
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
DYlN~J~IC LO ~ 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 other existing Intelligent Networks, the SSP has a dynamic mechanism for ,~ S~t 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. Such systems are disclosed in:
1. "On load control of an SCP in the Intelligent Network", NYBERG et al, proceedings of the Australian Telecommunication Networks and Applications conference, vol. 2, 1st January 1994, pages 751-756.
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 other existing Intelligent Networks, the SSP has a dynamic mechanism for ,~ S~t 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. Such systems are disclosed in:
1. "On load control of an SCP in the Intelligent Network", NYBERG et al, proceedings of the Australian Telecommunication Networks and Applications conference, vol. 2, 1st January 1994, pages 751-756.
2. "A study of methods for protecting an SCP
from overload", KIHL et al, IEE conference on Telecommunications, 26th March 1995, pages 125-129.
from overload", KIHL et al, IEE conference on Telecommunications, 26th March 1995, pages 125-129.
3. "Congestion control for Intelligent Networks", PHAM et al, International Zurich seminar on Digital Communications Intelligent Networks and their applications, 16th March 1992, pages 375-389.
4~ "Performance and overload considerations when introducing IN into an existing network", TSOLAS et al, International Zurich seminar on Digital Communications Intelligent Networks and their applications, 1st January 1992, pages 407-414.
These have the advantage that 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.
However, these systems suffer from the disadvantage that the ceiling (or threshold) is only reduced after the system has entered the overload condition. The present invention overcomes this disadvantage by taking corrective action before the overload condition is entered, as will be described below.
For a better understanding of the present invention, reference will now be made, by way of ~G~oS~
, . ~ .
example, to the accompanying drawings, in which:-Figure l is a block schematic diagram of a networkarchitecture 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 l comprises a Service Control Point (SCP) 2, to which are connected a number of Service Switching Points (SSPs) 4, 6, 8, lO. 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 '~s 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 A~E~I~E~ S~EET
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 t~ ,iEE' to a centralised database or control point, for example in mobile telecommunication networks, credit card databases, or computer networks.
,,, , ~
These have the advantage that 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.
However, these systems suffer from the disadvantage that the ceiling (or threshold) is only reduced after the system has entered the overload condition. The present invention overcomes this disadvantage by taking corrective action before the overload condition is entered, as will be described below.
For a better understanding of the present invention, reference will now be made, by way of ~G~oS~
, . ~ .
example, to the accompanying drawings, in which:-Figure l is a block schematic diagram of a networkarchitecture 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 l comprises a Service Control Point (SCP) 2, to which are connected a number of Service Switching Points (SSPs) 4, 6, 8, lO. 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 '~s 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 A~E~I~E~ S~EET
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 t~ ,iEE' to a centralised database or control point, for example in mobile telecommunication networks, credit card databases, or computer networks.
,,, , ~
Claims (9)
1. A switching point, for use in a network architecture having a central control point and a plurality of switching points connected thereto, the switching point comprising:
means for sending queries to the control point, and receiving responses therefrom;
means for counting the number of pending queries sent to the control point and awaiting a response; and means for preventing further queries from being sent to the control point when the number of pending queries reaches a threshold value, characterized in that the threshold value is decreased when the number of pending queries reaches the threshold value.
means for sending queries to the control point, and receiving responses therefrom;
means for counting the number of pending queries sent to the control point and awaiting a response; and means for preventing further queries from being sent to the control point when the number of pending queries reaches a threshold value, characterized in that the threshold value is decreased when the number of pending queries reaches the threshold value.
2. A switching point as claimed in claim 1, having means for increasing the threshold value when a predetermined number of consecutive queries receive successful responses.
3. A switching point as claimed in claim 1, having means for counting a plurality of numbers of pending queries of different categories.
4. 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 point;
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, characterized in that the threshold value is decreased when the number of pending queries reaches the threshold value.
receiving a call attempt;
incrementing a counter value, which is decremented whenever a query receives a response from the control point;
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, characterized in that the threshold value is decreased when the number of pending queries reaches the threshold value.
5. A method as claimed in claim 4, 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.
6. A method as claimed in claim 5, wherein each counter value, associated with a respective predetermined criterion, has a respective predetermined threshold.
7. A network architecture, comprising a central control point and a plurality of switching points connected thereto, each switching point comprising:
means for sending queries to the control point, and receiving responses therefrom;
means for counting the number of pending queries sent to the control point and awaiting a response; and means for preventing further queries from being sent to the control point when the number of pending queries reaches a threshold value, characterized in that the threshold value is decreased when the number of pending queries reaches the threshold value.
means for sending queries to the control point, and receiving responses therefrom;
means for counting the number of pending queries sent to the control point and awaiting a response; and means for preventing further queries from being sent to the control point when the number of pending queries reaches a threshold value, characterized in that the threshold value is decreased when the number of pending queries reaches the threshold value.
8. An architecture as claimed in claim 7, having means for increasing the threshold value when a predetermined number of consecutive queries receive successful responses from the control point.
9. An architecture as claimed in claim 7, having means for counting a plurality of numbers of pending queries of different categories.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| GB9615149A GB2315635B (en) | 1996-07-19 | 1996-07-19 | Dynamic load limiting |
| GB9615149.3 | 1996-07-19 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2260821A1 true CA2260821A1 (en) | 1998-01-29 |
Family
ID=10797152
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002260821A Abandoned CA2260821A1 (en) | 1996-07-19 | 1997-07-16 | Dynamic load limiting |
Country Status (14)
| Country | Link |
|---|---|
| US (1) | US6707900B1 (en) |
| EP (1) | EP0913045B1 (en) |
| JP (1) | JP4391591B2 (en) |
| KR (1) | KR20000067863A (en) |
| CN (2) | CN1242601C (en) |
| AU (1) | AU720630B2 (en) |
| BR (1) | BR9710491B1 (en) |
| CA (1) | CA2260821A1 (en) |
| DE (1) | DE69732967T2 (en) |
| DK (1) | DK0913045T3 (en) |
| ES (1) | ES2236825T3 (en) |
| GB (1) | GB2315635B (en) |
| MY (1) | MY125755A (en) |
| WO (1) | WO1998004078A2 (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| ATE308861T1 (en) * | 1999-07-03 | 2005-11-15 | ARRANGEMENT AND METHOD FOR LOAD CONTROL IN A TELECOMMUNICATIONS NETWORK | |
| KR100651997B1 (en) * | 1999-07-19 | 2006-11-30 | 엘지전자 주식회사 | Dynamic Load Balancing Method in Multiple Network Adapters |
| US6647259B1 (en) * | 2000-08-30 | 2003-11-11 | Lucent Technologies Inc. | Method for limiting the number of simultaneous call forwarding attempts in a cellular communication system |
| US6996225B1 (en) * | 2002-01-31 | 2006-02-07 | Cisco Technology, Inc. | Arrangement for controlling congestion in an SS7 signaling node based on packet classification |
| JP4133156B2 (en) * | 2002-09-19 | 2008-08-13 | 株式会社エヌ・ティ・ティ・ドコモ | Mobile communication system, mobile station, and radio control apparatus |
| JP2004165712A (en) * | 2002-09-19 | 2004-06-10 | Ntt Docomo Inc | Mobile communication system, base station, mobile station and radio network controller |
| JP4008843B2 (en) * | 2002-09-19 | 2007-11-14 | 株式会社エヌ・ティ・ティ・ドコモ | Mobile communication system, mobile station, base station, and radio control apparatus |
| CN1625170B (en) * | 2003-12-03 | 2010-04-28 | 华为技术有限公司 | Method for realizing large number of user on-line simultaneously of universal group radio operation |
| JP2006121667A (en) * | 2004-09-27 | 2006-05-11 | Matsushita Electric Ind Co Ltd | Packet reception control device and method |
| CN109032790B (en) * | 2018-06-29 | 2020-09-01 | 优刻得科技股份有限公司 | Overload protection method, overload protection device, medium, and apparatus |
Family Cites Families (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4608685A (en) * | 1984-04-30 | 1986-08-26 | Northern Telecom Limited | Packet and circuit switched communications network |
| IL94519A (en) * | 1989-06-13 | 1993-07-08 | Tv Answer Int Inc | Satellite television communication system for audience polling and processing answers |
| US5042064A (en) * | 1990-05-03 | 1991-08-20 | At&T Bell Laboratories | Call control strategy for high capacity telecommunication services |
| US5212727A (en) | 1990-09-26 | 1993-05-18 | At&T Bell Laboratories | Queuing trigger in call processing |
| US5249223A (en) * | 1991-01-03 | 1993-09-28 | At&T Bell Laboratories | Call-load-control arrangement for an emergency-call-answering center |
| US5425086A (en) | 1991-09-18 | 1995-06-13 | Fujitsu Limited | Load control system for controlling a plurality of processes and exchange system having load control system |
| US5359649A (en) | 1991-10-02 | 1994-10-25 | Telefonaktiebolaget L M Ericsson | Congestion tuning of telecommunications networks |
| CA2165568C (en) | 1993-06-28 | 2000-04-25 | Frank J. Weisser, Jr. | Mediation of open advanced intelligent network interface for public switched telephone network |
| CA2171937C (en) * | 1993-09-17 | 2006-08-15 | Danny Ramot | Apparatus and method for dynamic inbound/outbound call management and for scheduling appointments |
| US5450483A (en) * | 1993-11-18 | 1995-09-12 | British Telecommunications P.L.C. | Method of controlling overloads in a telecommunications network |
| AU3615095A (en) * | 1994-10-10 | 1996-05-02 | British Telecommunications Public Limited Company | Communications traffic management arrangement |
| US5581610A (en) * | 1994-10-19 | 1996-12-03 | Bellsouth Corporation | Method for network traffic regulation and management at a mediated access service control point in an open advanced intelligent network environment |
| ZA966403B (en) * | 1995-07-28 | 1997-02-19 | Alcatel Nv | Method and telecommunications network for control of mass calling. |
| US5828729A (en) * | 1995-11-22 | 1998-10-27 | Stentor Resource Centre Inc. | Automated mass calling detection using CCS7 message parameters |
| US5878224A (en) * | 1996-05-24 | 1999-03-02 | Bell Communications Research, Inc. | System for preventing server overload by adaptively modifying gap interval that is used by source to limit number of transactions transmitted by source to server |
| US5923742A (en) * | 1997-02-14 | 1999-07-13 | At&T Grp. | System and method for detecting mass addressing events |
-
1996
- 1996-07-19 GB GB9615149A patent/GB2315635B/en not_active Expired - Lifetime
-
1997
- 1997-07-16 KR KR1019997000223A patent/KR20000067863A/en not_active Application Discontinuation
- 1997-07-16 EP EP97939999A patent/EP0913045B1/en not_active Expired - Lifetime
- 1997-07-16 US US09/214,898 patent/US6707900B1/en not_active Expired - Lifetime
- 1997-07-16 DE DE69732967T patent/DE69732967T2/en not_active Expired - Lifetime
- 1997-07-16 ES ES97939999T patent/ES2236825T3/en not_active Expired - Lifetime
- 1997-07-16 DK DK97939999T patent/DK0913045T3/en active
- 1997-07-16 WO PCT/EP1997/003788 patent/WO1998004078A2/en active IP Right Grant
- 1997-07-16 CA CA002260821A patent/CA2260821A1/en not_active Abandoned
- 1997-07-16 AU AU42013/97A patent/AU720630B2/en not_active Expired
- 1997-07-16 CN CNB971964092A patent/CN1242601C/en not_active Expired - Lifetime
- 1997-07-16 JP JP50652998A patent/JP4391591B2/en not_active Expired - Lifetime
- 1997-07-16 BR BRPI9710491-4A patent/BR9710491B1/en not_active IP Right Cessation
- 1997-07-16 CN CN2003101245262A patent/CN1536899B/en not_active Expired - Lifetime
- 1997-07-19 MY MYPI97003280A patent/MY125755A/en unknown
Also Published As
| Publication number | Publication date |
|---|---|
| JP4391591B2 (en) | 2009-12-24 |
| WO1998004078A3 (en) | 1998-05-07 |
| BR9710491A (en) | 1999-08-17 |
| DE69732967D1 (en) | 2005-05-12 |
| MY125755A (en) | 2006-08-30 |
| WO1998004078A2 (en) | 1998-01-29 |
| GB2315635B (en) | 2000-10-11 |
| CN1536899A (en) | 2004-10-13 |
| GB9615149D0 (en) | 1996-09-04 |
| EP0913045A2 (en) | 1999-05-06 |
| US6707900B1 (en) | 2004-03-16 |
| AU4201397A (en) | 1998-02-10 |
| BR9710491B1 (en) | 2009-05-05 |
| AU720630B2 (en) | 2000-06-08 |
| GB2315635A (en) | 1998-02-04 |
| ES2236825T3 (en) | 2005-07-16 |
| DE69732967T2 (en) | 2006-04-27 |
| CN1242601C (en) | 2006-02-15 |
| DK0913045T3 (en) | 2005-08-01 |
| CN1225216A (en) | 1999-08-04 |
| KR20000067863A (en) | 2000-11-25 |
| EP0913045B1 (en) | 2005-04-06 |
| CN1536899B (en) | 2010-12-29 |
| JP2000515695A (en) | 2000-11-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2024305C (en) | Control of overload in communications networks | |
| EP0791261B1 (en) | Overload prevention in a telecommunications network node | |
| US5592672A (en) | System for load balancing between message processors by routing all queued messages to a particular processor selected by a deterministic rule | |
| JP3720356B2 (en) | Method for controlling overload in a telecommunications network | |
| EP0340665B1 (en) | Exchange system having originating call restriction function | |
| US5778057A (en) | Service control point congestion control method | |
| EP0872103B1 (en) | Controlling traffic congestion in intelligent electronic networks | |
| EP0913045B1 (en) | Dynamic load limiting in a network architecture | |
| CA2257631A1 (en) | Call transfer operation | |
| NZ336657A (en) | Preventing overloading in call centre, calls rejected if number of simultaneous calls exceeds predetermined capacity | |
| KR100352342B1 (en) | method for call gapping in intelligent network | |
| Rumsewicz | On the efficacy of using the transfer-controlled procedure during periods of STP processor overload in SS7 networks | |
| US6041115A (en) | User interaction procedure | |
| JPH06113009A (en) | Imtelligent network traffic restriction control method | |
| CA2340003C (en) | Intelligent network services | |
| KR950023191A (en) | Overload Control Method in Intelligent Network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |