CA2228591C - System and method for detecting mass addressing events - Google Patents
System and method for detecting mass addressing events Download PDFInfo
- Publication number
- CA2228591C CA2228591C CA002228591A CA2228591A CA2228591C CA 2228591 C CA2228591 C CA 2228591C CA 002228591 A CA002228591 A CA 002228591A CA 2228591 A CA2228591 A CA 2228591A CA 2228591 C CA2228591 C CA 2228591C
- Authority
- CA
- Canada
- Prior art keywords
- register
- counter
- contents
- warning signal
- resetting
- 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.)
- Expired - Lifetime
Links
Classifications
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M2201/00—Electronic components, circuits, software, systems or apparatus used in telephone systems
- H04M2201/12—Counting circuits
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M2203/00—Aspects of automatic or semi-automatic exchanges
- H04M2203/10—Aspects of automatic or semi-automatic exchanges related to the purpose or context of the telephonic communication
- H04M2203/1041—Televoting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/08—Indicating faults in circuits or apparatus
- H04M3/10—Providing fault- or trouble-signals
Abstract
A system and method for detecting mass addressing events comprising a first register, a second register, a first counter, and a second counter is disclosed.
Potential mass addressing events are detected by comparing a most recently selected address to the contents of the first register and incrementing the first counter if they are equal, or loading the most recently selected address into the first register and initializing the first counter if they are unequal. If the first counter's count reaches a first count threshold, the contents of the first register are compared to the contents of the second register and the second counter is incremented if they are equal, or, if they are unequal, the contents of the first register are loaded into the second register and the second counter is initialized.
If the second counter's count reaches a second count threshold, an alarm is issued. In an alternative preferred embodiment, the first and second registers and the first and second counters are periodically reset to reduce false mass addressing event alarms.
Potential mass addressing events are detected by comparing a most recently selected address to the contents of the first register and incrementing the first counter if they are equal, or loading the most recently selected address into the first register and initializing the first counter if they are unequal. If the first counter's count reaches a first count threshold, the contents of the first register are compared to the contents of the second register and the second counter is incremented if they are equal, or, if they are unequal, the contents of the first register are loaded into the second register and the second counter is initialized.
If the second counter's count reaches a second count threshold, an alarm is issued. In an alternative preferred embodiment, the first and second registers and the first and second counters are periodically reset to reduce false mass addressing event alarms.
Description
SYSTEM AND METHOD FOR DETECTING
MASS ADDRESSING EVENTS
Background of the Invention This invention relates to detecting mass addressing events. Examples of systems that can make use of this invention are telephone networks, addressable memory devices, data bus systems, and the like.
The detecting aspect of the invention relates to alerting a monitoring 1o station of potential mass addressing events before such events happen. Such an aspect is particularly well suited for telephone networks wherein mass addre ssing events (within the telephone industry an "addressing event" being the dialing of a telephone number) can result in an enormous amount of non-revenue generating work for telephone service providers. Further, such overloads cause 15 network instability by not only reducing throughput at a specific network elem~:nt, but by also stressing the signaling network, databases, switches, and trunking network all at the same time.
The terms "mass addressing event" and "mass calling event" or the like are u;~ed herein to refer to addressing or calling events of sufficient magnitude to 20 overload, overwhelm, shutdown, or damage conventional address routing circuitry. Telephone switching equipment, for example, often contains overload protection circuitry which will disable (e.g., shut down) individual switching devices if call volume exceeds a certain threshold rather than allowing switches to be damaged.
25 A mass calling event may be alternatively defined as a calling volume in exce;>s of customer answering capability. Only very large telephone service customers are capable of answering more than 15 to 20 calls per second, most customers having substantially reduced capabilities. As such, call volumes in excess of 15-20 calls per second, while usually insufficient to overwhelm 3o network switching circuitry, may nonetheless far exceed customer capability.
Any calls in excess of customer capability go unanswered and cannot therefore be billed by telephone service providers (i.e., are non-revenue generating calls which reduce network throughput) and may be considered a form of mass calling event.
A classic example of a mass addressing event occurred during an episode of the television series Melrose Place when the viewing audience was invited to call a displayed telephone number to qualify for a chance to appear on a future episode. Switching networks received an estimated 20,000 calls per second in response to this promotion. Because of this calling volume, most attempted calls were uncompleted (as calling volume far exceeded customer answering 1 o capability), causing telephone service providers lost revenues. In general, during mass calling events of this nature, most attempted calls are uncompleted, necessarily reducing telephone service provider profits. Furthermore, such mass calling events may~rompt switching network protection circuitry to shut down switching devices (to prevent the devices from being damaged), resulting in substantially reduced network capacity for all network customers (further reducing revenues to telephone service providers and engendering customer ill will). Clearly, from both a customer satisfaction viewpoint and a telephone service provider revenue viewpoint, mass addressing events are undesirable.
Conventional techniques for monitoring telephone networks and 2o rerouting high calling volumes are not well suited for handling mass calling events. For example, U.S. Patent No. 5,537,611 to Rajagopal et al.
(hereinafter "the ''611 patent") discloses using a database to collect and process traffic and routing statistics for special call processing services such as 800, 900, EVS, or VNE,T. Calling volumes can be monitored and alarms issued if calling volume exceeds preset thresholds within a one minute time interval. While the database disclosed in the '611 patent is well suited for dedicated networks with small calling volumes (calling volumes in the 4,000 to 5,000 calls per hour range are discussed, though the '611 patent indicates that an alarm threshold can be set between 1 and 65,000 calls per minute), such database systems are impractical 3o for handling the calling volume (up to 20,000 calls per second or 1,200,000 calls per minute) experienced by a large telephone network during a mass calling event. The processing power and memory requirements needed to keep statistics on, to search through, and to update a database with so many telephone numbers makf;s use of the '611 patent's database impracticable during mass calling events.
One technique which can be adapted for handling mass calling events is disclosed in U.S. Patent No. 5,450,483 to Williams (hereinafter "the '483 patent"). The '483 patent teaches a method of controlling overloads in a telephone network by monitoring the number of failed calls to a node and restricting calling volume to that node once a threshold level of failed calls is to reached. However, the system disclosed in the '483 patent detects network overloads which have already occurred. As such, a telephone monitoring station (e.g., a Network Operations Center which monitors and controls network operations) employing the '483 system cannot take measures which will prevent a network from overloading. By the time the '483 system detects an overload, 15 customers are already dissatisfied, revenues are already lost, and switching components may have already shutdown.
A need therefore exists for a system and method which allows potential mass addressing events to be identified so that preventive measures (which will reduce or eliminate the number of failed addressing attempts) may be 2o undertaken. Within the telephone industry, such a system will substantially increase customer satisfaction by reducing failed calling volume and increase telephone service provider profitability by decreasing non-revenue generating calls (e.g., uncompleted, non-billable telephone calls).
It is therefore an object of this invention to provide an improved method 25 of detecting mass addressing events.
It is a more particular object of this invention to detect potential mass addressing events and to alert a monitoring station of such potential events so that corrective measures may be taken prior to address routing circuitry (e.g., telephone network switches) overloading.
MASS ADDRESSING EVENTS
Background of the Invention This invention relates to detecting mass addressing events. Examples of systems that can make use of this invention are telephone networks, addressable memory devices, data bus systems, and the like.
The detecting aspect of the invention relates to alerting a monitoring 1o station of potential mass addressing events before such events happen. Such an aspect is particularly well suited for telephone networks wherein mass addre ssing events (within the telephone industry an "addressing event" being the dialing of a telephone number) can result in an enormous amount of non-revenue generating work for telephone service providers. Further, such overloads cause 15 network instability by not only reducing throughput at a specific network elem~:nt, but by also stressing the signaling network, databases, switches, and trunking network all at the same time.
The terms "mass addressing event" and "mass calling event" or the like are u;~ed herein to refer to addressing or calling events of sufficient magnitude to 20 overload, overwhelm, shutdown, or damage conventional address routing circuitry. Telephone switching equipment, for example, often contains overload protection circuitry which will disable (e.g., shut down) individual switching devices if call volume exceeds a certain threshold rather than allowing switches to be damaged.
25 A mass calling event may be alternatively defined as a calling volume in exce;>s of customer answering capability. Only very large telephone service customers are capable of answering more than 15 to 20 calls per second, most customers having substantially reduced capabilities. As such, call volumes in excess of 15-20 calls per second, while usually insufficient to overwhelm 3o network switching circuitry, may nonetheless far exceed customer capability.
Any calls in excess of customer capability go unanswered and cannot therefore be billed by telephone service providers (i.e., are non-revenue generating calls which reduce network throughput) and may be considered a form of mass calling event.
A classic example of a mass addressing event occurred during an episode of the television series Melrose Place when the viewing audience was invited to call a displayed telephone number to qualify for a chance to appear on a future episode. Switching networks received an estimated 20,000 calls per second in response to this promotion. Because of this calling volume, most attempted calls were uncompleted (as calling volume far exceeded customer answering 1 o capability), causing telephone service providers lost revenues. In general, during mass calling events of this nature, most attempted calls are uncompleted, necessarily reducing telephone service provider profits. Furthermore, such mass calling events may~rompt switching network protection circuitry to shut down switching devices (to prevent the devices from being damaged), resulting in substantially reduced network capacity for all network customers (further reducing revenues to telephone service providers and engendering customer ill will). Clearly, from both a customer satisfaction viewpoint and a telephone service provider revenue viewpoint, mass addressing events are undesirable.
Conventional techniques for monitoring telephone networks and 2o rerouting high calling volumes are not well suited for handling mass calling events. For example, U.S. Patent No. 5,537,611 to Rajagopal et al.
(hereinafter "the ''611 patent") discloses using a database to collect and process traffic and routing statistics for special call processing services such as 800, 900, EVS, or VNE,T. Calling volumes can be monitored and alarms issued if calling volume exceeds preset thresholds within a one minute time interval. While the database disclosed in the '611 patent is well suited for dedicated networks with small calling volumes (calling volumes in the 4,000 to 5,000 calls per hour range are discussed, though the '611 patent indicates that an alarm threshold can be set between 1 and 65,000 calls per minute), such database systems are impractical 3o for handling the calling volume (up to 20,000 calls per second or 1,200,000 calls per minute) experienced by a large telephone network during a mass calling event. The processing power and memory requirements needed to keep statistics on, to search through, and to update a database with so many telephone numbers makf;s use of the '611 patent's database impracticable during mass calling events.
One technique which can be adapted for handling mass calling events is disclosed in U.S. Patent No. 5,450,483 to Williams (hereinafter "the '483 patent"). The '483 patent teaches a method of controlling overloads in a telephone network by monitoring the number of failed calls to a node and restricting calling volume to that node once a threshold level of failed calls is to reached. However, the system disclosed in the '483 patent detects network overloads which have already occurred. As such, a telephone monitoring station (e.g., a Network Operations Center which monitors and controls network operations) employing the '483 system cannot take measures which will prevent a network from overloading. By the time the '483 system detects an overload, 15 customers are already dissatisfied, revenues are already lost, and switching components may have already shutdown.
A need therefore exists for a system and method which allows potential mass addressing events to be identified so that preventive measures (which will reduce or eliminate the number of failed addressing attempts) may be 2o undertaken. Within the telephone industry, such a system will substantially increase customer satisfaction by reducing failed calling volume and increase telephone service provider profitability by decreasing non-revenue generating calls (e.g., uncompleted, non-billable telephone calls).
It is therefore an object of this invention to provide an improved method 25 of detecting mass addressing events.
It is a more particular object of this invention to detect potential mass addressing events and to alert a monitoring station of such potential events so that corrective measures may be taken prior to address routing circuitry (e.g., telephone network switches) overloading.
Summary of the Invention These and other objects of the invention are accomplished in accordance with the principles of the invention by providing a system and method for detecting potential mass addressing events. A most recently selected address (such as a most recently dialed telephone number) is compared to the contents of a first register. If the most recently selected address is the same as the address stored in the first register, a first counter is incremented. However, if the most recently selected address is not the same as the address stored in the first register, the most recently selected address is loaded into the first register and the first counter is initialized (e.g., set to one). A new most recently selected address (e.g., the next telephone number dialed) is then obtained and the above process is repeated. In this manner, the first counter counts the number of times the same address is consecutively selected. If this number reaches a predetermined first count threshold K1 (i.e., if the first counter's count equals or exceeds the first count threshold K1) then a first warning signal is generated to indicate that the first threshold value has been reached (i.e., an address has been consecutively selected K1 times) and the first register and the first counter are reset (e.g., set to zero). Accordingly, a first warning signal is generated each time any address is 2o consecutively selected at least K1 times. This first warning signal may be used to alert a monitoring station of a potential mass addressing event and may include the identity of the consecutively selected address responsible for the generation of the first warning signal. The monitoring station may respond manually or automatically to the first warning signal, and the first count threshold K1 may remain constant or vary dynamically.
In another aspect of the present invention, the first register and the first counter are not reset immediately after the first warning signal is issued.
Instead, the first warning signal causes the contents of the first register to be compared to the contents of a second register. If the contents of the first register are the same as the contents of the second register, a second counter is incremented and the first register and the first counter are reset. However, if the contents of the first register are not the same as the contents of the second register, then the contents of the first register are loaded into the contents of the second register, the first register and the first counter are reset, and the second counter is initialized. In this manner, the second counter counts the number of consecutive times the first warning signal has been generated for the same selected address. If this number reaches a predetermined second count threshold K2 (i.e., if the second counter's count equals or exceeds the second count threshold K2) then a second warning signal is generated. The second register and the second counter are then reset.
Accordingly, a second warning signal is generated each time any address is selected Kl times in a row on K2 separate occasions. That is, a second warning signal is generated after K2 consecutive "bursts" of~ the same address have occurred, each "burst"
consisting of the same address being consecutively selected K1 times. As with the first warning signal, the second warning signal may be used to alert a monitoring station of a potential mass addressing event.
By having two independently controllable threshold values (e.g., the count threshold K1 and K2 may be software programmable), the likelihood of false mass addressing event warnings is substantially reduced. Any number of register/counter stages (i.e., re,gister/counter stages similar to the second register and second counter discussed above) can be used to further reduce false mass addressing event warnings.
In another aspect ofthe present invention, the first register, the first counter, the second register, and the second counter are periodically reset to further reduce the likelihood of false mass addressing event warnings. Each may be reset at a unique time (asynchronously), or all may be reset simultaneously (synchronously).
In accordance with one aspect of the present invention, there is provided a method for detecting a potential mass addressing events comprising: (a) obtaining a -Sa-most recently selected address; (b) comparing said selected address to contents of a first storage element; (c) incrementing a first counting element if said selected address is equal to said contents of said first storage element, otherwise initializing said first counting element and loading said first storage element with said selected address;
and (d) generating a first warning signal if said first counting element equals a first predetermined value.
In accordance with another aspect of the present invention, there is provided an apparatus for detecting a mass calling events comprising: a first counter;
a first register; means for determining whether contents of said first register are equal to a most recently selected address, and if so, incrementing said first counter, otherwise initializing said first counter and storing said selected address in said first register;
and means for determining whether said first counter has reached a first predetermined value, and if so, generating a first warning signal.
Further features of the invention, its nature and various advantages, will be more apparent from the accompanying drawings and the following detailed description of the preferred embodiments.
In another aspect of the present invention, the first register and the first counter are not reset immediately after the first warning signal is issued.
Instead, the first warning signal causes the contents of the first register to be compared to the contents of a second register. If the contents of the first register are the same as the contents of the second register, a second counter is incremented and the first register and the first counter are reset. However, if the contents of the first register are not the same as the contents of the second register, then the contents of the first register are loaded into the contents of the second register, the first register and the first counter are reset, and the second counter is initialized. In this manner, the second counter counts the number of consecutive times the first warning signal has been generated for the same selected address. If this number reaches a predetermined second count threshold K2 (i.e., if the second counter's count equals or exceeds the second count threshold K2) then a second warning signal is generated. The second register and the second counter are then reset.
Accordingly, a second warning signal is generated each time any address is selected Kl times in a row on K2 separate occasions. That is, a second warning signal is generated after K2 consecutive "bursts" of~ the same address have occurred, each "burst"
consisting of the same address being consecutively selected K1 times. As with the first warning signal, the second warning signal may be used to alert a monitoring station of a potential mass addressing event.
By having two independently controllable threshold values (e.g., the count threshold K1 and K2 may be software programmable), the likelihood of false mass addressing event warnings is substantially reduced. Any number of register/counter stages (i.e., re,gister/counter stages similar to the second register and second counter discussed above) can be used to further reduce false mass addressing event warnings.
In another aspect ofthe present invention, the first register, the first counter, the second register, and the second counter are periodically reset to further reduce the likelihood of false mass addressing event warnings. Each may be reset at a unique time (asynchronously), or all may be reset simultaneously (synchronously).
In accordance with one aspect of the present invention, there is provided a method for detecting a potential mass addressing events comprising: (a) obtaining a -Sa-most recently selected address; (b) comparing said selected address to contents of a first storage element; (c) incrementing a first counting element if said selected address is equal to said contents of said first storage element, otherwise initializing said first counting element and loading said first storage element with said selected address;
and (d) generating a first warning signal if said first counting element equals a first predetermined value.
In accordance with another aspect of the present invention, there is provided an apparatus for detecting a mass calling events comprising: a first counter;
a first register; means for determining whether contents of said first register are equal to a most recently selected address, and if so, incrementing said first counter, otherwise initializing said first counter and storing said selected address in said first register;
and means for determining whether said first counter has reached a first predetermined value, and if so, generating a first warning signal.
Further features of the invention, its nature and various advantages, will be more apparent from the accompanying drawings and the following detailed description of the preferred embodiments.
Brief Description of the Drawings FIG. 1 is a block diagram of an illustrative apparatus which can operate in accordance with this invention;
FIG. 2 is a flow chart useful in describing the operation of an illustrative embodiment of the invention; and FIG. 3 is a block diagram of a telephone network employing an embodiment of the present invention.
Detailed Description of the Preferred Embodiments In the illustrative embodiment shown in FIG. 1 a plurality of routing lines 11 are operatively coupled to a telephone network node 13. Routing lines 11 may, for example, comprise coaxial cables, optical fiber bundles, or microwave links, and network node 13 may comprise a trunk exchange switch node, a local exchange switch node, a special service switch node, some form of mobile telecommunications network, or the like. Further contained within network node 13 is hardware used in a preferred embodiment of the present invention;
namely, a mass calling event control unit 15 (hereinafter "MCE control unit 15") operatively coupled to routing lines 11 via a plurality of query bus lines 17 (hereinafter query bus 17) and further operatively coupled to a first register (regi ster R 1 ), a first counter 21 (counter C 1 ), a second register 23 (register R2), and a second counter 25 (counter C2) via a control bus 27. MCE control unit 15 is also operatively coupled to a Network Operations Center 29 through a warning bus 31. It will be understood that these examples are only illustrative, and that many other configurations for routing lines 11, network node 13, and the MCE
hardware (i.e., MCE control unit 15, first register 19, first counter 21, second register 23, and second counter 25) are possible.
In operation, to initiate mass calling event detection, MCE control unit 15 3o resets first register 19, first counter 21, second register 23, and second counter 25 to zero (though any initial values may be used). Subsequently, by means of query bus 17, MCE control unit 15 queries routing lines 11 to obtain, among other things, the most recently dialed telephone number (hereinafter "MRDTN") which is present at network node 13. If the MRDTN is equal to the contents of first register 19, first counter 21 is incremented; otherwise, the MRDTN is loaded into first register 19 and first counter 21 is initialized (e.g., set to one).
These steps are repeated continuously: MCE control unit 15 queries routing lines 11 to get a MRDTN, compares this MRDTN to the contents of first register 19 and increments first counter 21 if they are equal, or loads first register 19 with the MRDTN and initializes first counter 21 if they are unequal. In this manner, first counter 21 counts the number of consecutive times (i.e., the number of times in a row) the same telephone number is dialed to network node 13.
In addition, MCE control unit 15 monitors first counter 21's count and determines if it equals or exceeds a first count threshold K1. Once first counter 21's count equals or exceeds threshold K1, MCE control unit 15 either issues a first alarm signal to Network Operations Center 29 via warning bus 31 (alerting Network Operations Center 29 of a potential mass calling event and preferably containing the telephone number responsible for the alarm condition), or in a preferred embodiment, compares the contents of second register 23 to the contents of first register 19. If the contents of second register 23 are the same as the contents of first register 19, MCE control unit 15 increments second counter 25. If the contents of second register 23 and first register 19 are not the same, MCE control unit 15 loads the contents of first register 19 into second register 23, resets first register 19 and first counter 21 to zero, and initializes second counter 25. MCE control unit 15 then returns to querying routing lines 11 for the new MRDTNs. While registers and counters are reset to zero and initialized to one in a preferred embodiment, other reset and initial values may be used.
In addition to monitoring first counter 21, MCE control unit 15 also monitors second counter 25. If second counter 25's count reaches a second count threshold K2, MCE control unit 15 issues a second alarm signal (which _g_ preferably contains the telephone number responsible for the alarm condition) to Network Operations Center 29 via warning bus 31, resets second register 23 and second counter 25 to zero and then continues querying routing lines 11 for new MRDTNs.
In the preferred embodiment therefore, a two stage mass calling event detection circuit is provided which warns a Network Operations Center of potential mass calling events. By adjusting threshold values K1 and K2, false mass calling event alarms can be minimized while still maintaining sufficient mass calling event protection. For example, if the mass calling event detection 1o circuit is required to detect a telephone number that is responsible for 50% of the calling traffic during a mass calling event, K1 and K2 are set high to avoid false mass calling event alarms. If, on the other hand, the mass calling event detection circuit is required to detect a telephone number that is responsible for 10%
of the calling traffic during a mass calling event, K1 and K2 are set low to ensure that 15 mass calling events do not go undetected.
In another aspect of a preferred embodiment, MCE control unit 15 automatically resets first register 19, first counter 21, first register 23, and first register 25 to zero at a periodic reset time KO (though each could be reset at different times, or not at all). As with count thresholds K1 and K2, periodic reset 2o time KO helps reduce false mass calling events alarms. For example, if first count threshold K1 is set to 4 and second count threshold K2 is set to 2, a mass calling event alarm will be issued if the same telephone number is detected 4 times in a row on 2 separate occasions (assuming second counter 25 is not reset prior to the 2 separate occasions because of a different telephone number being 25 dialed 4 times in a row). Without more information, Network Operations Center 29 will be unaware of the time period during which the calls responsible for the MCE alarm occurred (e.g., per second, per hour, per day, per week, etc.). A
mass calling event alarm could be issued even though the calls occurred at a rate well within normal network traffic rates. By periodically resetting first register 30 19, first counter 21, first register 23, and first register 25, Network Operations Center 29 will know, at a minimum, that the calls responsible for the MCE
alarm occurred within one periodic reset time KO (be it a minute, an hour, a day, etc.).
As such, periodic resetting reduces false mass calling event alarms, whether used independently of or in cooperation with count thresholds K1 and K2.
With regard to the selection of count thresholds K1 and K2 and periodic reset time KO for mass calling event detection, factors such as the fraction of traffic from a given telephone number, p, and the total traffic rate, ~, (e.g., the number of telephone calls per second), must be considered. For example, the time to detection td (e.g., time required for a mass calling event alarm to be 1o generated) is approximately related to detection probability E, by:
- K2!~ logs td KO K2-1 , ~K2 , pKl K2 (Note that this formula is only an approximation. A more accurate measure of td requires computer simulation.) From the above formula it is clear that time to detection td can be optimized by making periodic reset time KO
large while keeping count thresholds K1 and K2 small. However, increasing periodic reset time KO and decreasing count thresholds K1 and K2 also increases the probability of a false mass calling event alarm being issued. The desire for 2o fast mass calling event detection must therefore be balanced with the need for accurate mass calling event detection.
FIG. 2 shows an illustrative sequence of steps in accordance with the invention for operating the apparatus of FIG. 1 as described above or, more generally, for use in a software embodiment of the present invention. To some extent these steps have already been mentioned and the discussion of them here can be somewhat abbreviated.
In step 200 registers R1 and R2 and counters C1 and C2 are reset.
Registers R1 and R2 may, for example, be equivalent to first register 19 and second register 23 of FIG. 1, respectively, while counters C1 and C2 may be equivalent to first counter 21 and second counter 25 of FIG. 1, respectively.
Normally R1, R2, C 1, and C2 are reset to zero, though other starting values may be used.
In step 202 a query is made to determine the MRDTN present at the network node.
In step 204 the contents of register R1 are compared to the MRDTN. If the MRDTN is the same as the contents of register R1, then control passes to step 208 (described below); otherwise control passes to step 206 wherein the MRDTN is stored in register R1, counter C1 is initialized (e.g., set to one), and 1o control passes back to step 202 wherein a new MRDTN is obtained and the above mentioned steps are repeated.
In step 208 (recalling that control passed to step 208 when, in step 204, the MRDTN was found to be the same as the contents of register R1 ) counter C
is incremented (e.g., increased by one), indicating that the MRDTN is the same telephone number as is contained in register R1. Control then passes to step 210.
In step 210, counter C1 is compared to a first count threshold K1. If counter C1's count is not equal to or greater than count threshold K1, control passes to step 202; otherwise, control passes to step 212.
In step 212, the contents of register R1 are compared to the contents of 2o register R2. If the contents of register R1 are the same as the contents of register R2, control passes to step 216 (described below); otherwise, control passes to step 214.
In step 214, the contents of register R1 are loaded into register R2 and register R1 and counter C1 are reset (e.g., set to zero). Counter C2 is also initialized (e.g., set to 1). Control then passes to step 202.
In step 216 (recalling that control passed to step 216 when, in step 212, the contents of register R1 were determined to be the same as the contents of register R2) counter C2 is incremented (e.g., increased by one). Control then passes to step 218.
3o In step 218 counter C2 is compared to a second count threshold K2. If counter C2's count is not equal to count threshold K2, control passes to step 202;
otherwise, control passes to step 220.
In step 220 an alarm is issued, which in the preferred embodiment contains the contents of register R2 (i.e., the MRDTN responsible for the alarm), to a monitoring station (e.g., Network Operations Center 29). Register R2 and counter C2 are then reset (e.g., set to zero) and control is passed to step 202.
As described with regard to FIG. 1, registers R1 and R2 and counters C1 and C2 are preferably periodically reset (e.g., set to zero) every KO seconds to reduce false MCE alarms. In one preferred embodiment, the resetting of registers R1 and R2 and counter C1 and C2 is achieved by adding a timer T1 which is started in step 206 of FIG. 2 and stopped (and reset to zero) in step 200.
An additional step 203 is added which determines if timer T1 has counted KO
seconds, and if so, passes control to step 200 wherein register Rl and R2 and counters C1 and C2 are reset to zero and wherein timer T1 is stopped and reset to zero, otherwise step 203 passes control to step 202 wherein a new MRDTN is obtained. Furthermore, steps 210, 214, 218, and 220 are configured to pass control to step 203 rather than step 202 as previously described.
The system and method of the present invention is particularly well suited for use in the segmentation directories being introduced to AT&T's long 2o distance network. FIG. 3 shows a plurality of local switches 31 a - 31 n coupled to a segmentation directory 33. Although FIG. 3 shows only 14 local switches (switches 31 a - 31 n), it is understood that any number may be used. The local switches 31 represent local AT&T switching nodes scattered throughout the United States and provide access/egress for calls entering/leaving AT&T's long distance network. For example, if a caller picks up a telephone in Manhattan and dials a San Francisco telephone number, the local telephone service provider (e.g., NYNEX) determines what long distance carrier (e.g., AT&T, MCI, Sprint, etc.) is being used. If AT&T is the long distance carrier, the dialed telephone number is routed to local switch 31 m in Manhattan (assuming local switch 31 m 3o is located in Manhattan) where its addressing information is interpreted.
Every telephone number entering the AT&T's long distance network (through local switches 31 a - 31 n) is fed to segmentation directory 33.
Although FIG. 3 shows only one segmentation directory, it is understood that any number may be used. Segmentation directory 33 serves as a location at which every telephone call entering AT&T's long distance network may be examined.
Because segmentation directory 33 examines every call entering AT&T's long distance network, it is an ideal location for monitoring mass calling events.
As such, in a preferred embodiment, registers Rl and R2 and counters Cl and C2 of FIG. 2 are located within segmentation directory 33. If a mass calling event is detected at segmentation directing 33, calling volume at local switches 31 a -31 n may be automatically controlled or manually controlled by a Network Operations Center. Calling volume rnay be reduced or blocked by techniques well known in the art.
It will be understood that the foregoing is only illustrative of the ~ 5 principles of the invention and that various modifications can be made by those skilled in the art without departing from the scope and spirit of the invention.
For example, the invention can be used at any type of network switching node and can detect small scale mass calling events, such as the calling volume to a local switching network in response to a local radio station promotion.
2o Furthermore, the present invention is well suited for detecting mass addressing events which may occur on the INTERNET or the WORLD WIDE
WEB, during requests for access to data or a data bus, or during any similar addressing event.
The invention may be used with many different types of registers R1 and 25 R2 and counters C 1 and C2 and may be embodied in hardware, software, or any combination thereof.
FIG. 2 is a flow chart useful in describing the operation of an illustrative embodiment of the invention; and FIG. 3 is a block diagram of a telephone network employing an embodiment of the present invention.
Detailed Description of the Preferred Embodiments In the illustrative embodiment shown in FIG. 1 a plurality of routing lines 11 are operatively coupled to a telephone network node 13. Routing lines 11 may, for example, comprise coaxial cables, optical fiber bundles, or microwave links, and network node 13 may comprise a trunk exchange switch node, a local exchange switch node, a special service switch node, some form of mobile telecommunications network, or the like. Further contained within network node 13 is hardware used in a preferred embodiment of the present invention;
namely, a mass calling event control unit 15 (hereinafter "MCE control unit 15") operatively coupled to routing lines 11 via a plurality of query bus lines 17 (hereinafter query bus 17) and further operatively coupled to a first register (regi ster R 1 ), a first counter 21 (counter C 1 ), a second register 23 (register R2), and a second counter 25 (counter C2) via a control bus 27. MCE control unit 15 is also operatively coupled to a Network Operations Center 29 through a warning bus 31. It will be understood that these examples are only illustrative, and that many other configurations for routing lines 11, network node 13, and the MCE
hardware (i.e., MCE control unit 15, first register 19, first counter 21, second register 23, and second counter 25) are possible.
In operation, to initiate mass calling event detection, MCE control unit 15 3o resets first register 19, first counter 21, second register 23, and second counter 25 to zero (though any initial values may be used). Subsequently, by means of query bus 17, MCE control unit 15 queries routing lines 11 to obtain, among other things, the most recently dialed telephone number (hereinafter "MRDTN") which is present at network node 13. If the MRDTN is equal to the contents of first register 19, first counter 21 is incremented; otherwise, the MRDTN is loaded into first register 19 and first counter 21 is initialized (e.g., set to one).
These steps are repeated continuously: MCE control unit 15 queries routing lines 11 to get a MRDTN, compares this MRDTN to the contents of first register 19 and increments first counter 21 if they are equal, or loads first register 19 with the MRDTN and initializes first counter 21 if they are unequal. In this manner, first counter 21 counts the number of consecutive times (i.e., the number of times in a row) the same telephone number is dialed to network node 13.
In addition, MCE control unit 15 monitors first counter 21's count and determines if it equals or exceeds a first count threshold K1. Once first counter 21's count equals or exceeds threshold K1, MCE control unit 15 either issues a first alarm signal to Network Operations Center 29 via warning bus 31 (alerting Network Operations Center 29 of a potential mass calling event and preferably containing the telephone number responsible for the alarm condition), or in a preferred embodiment, compares the contents of second register 23 to the contents of first register 19. If the contents of second register 23 are the same as the contents of first register 19, MCE control unit 15 increments second counter 25. If the contents of second register 23 and first register 19 are not the same, MCE control unit 15 loads the contents of first register 19 into second register 23, resets first register 19 and first counter 21 to zero, and initializes second counter 25. MCE control unit 15 then returns to querying routing lines 11 for the new MRDTNs. While registers and counters are reset to zero and initialized to one in a preferred embodiment, other reset and initial values may be used.
In addition to monitoring first counter 21, MCE control unit 15 also monitors second counter 25. If second counter 25's count reaches a second count threshold K2, MCE control unit 15 issues a second alarm signal (which _g_ preferably contains the telephone number responsible for the alarm condition) to Network Operations Center 29 via warning bus 31, resets second register 23 and second counter 25 to zero and then continues querying routing lines 11 for new MRDTNs.
In the preferred embodiment therefore, a two stage mass calling event detection circuit is provided which warns a Network Operations Center of potential mass calling events. By adjusting threshold values K1 and K2, false mass calling event alarms can be minimized while still maintaining sufficient mass calling event protection. For example, if the mass calling event detection 1o circuit is required to detect a telephone number that is responsible for 50% of the calling traffic during a mass calling event, K1 and K2 are set high to avoid false mass calling event alarms. If, on the other hand, the mass calling event detection circuit is required to detect a telephone number that is responsible for 10%
of the calling traffic during a mass calling event, K1 and K2 are set low to ensure that 15 mass calling events do not go undetected.
In another aspect of a preferred embodiment, MCE control unit 15 automatically resets first register 19, first counter 21, first register 23, and first register 25 to zero at a periodic reset time KO (though each could be reset at different times, or not at all). As with count thresholds K1 and K2, periodic reset 2o time KO helps reduce false mass calling events alarms. For example, if first count threshold K1 is set to 4 and second count threshold K2 is set to 2, a mass calling event alarm will be issued if the same telephone number is detected 4 times in a row on 2 separate occasions (assuming second counter 25 is not reset prior to the 2 separate occasions because of a different telephone number being 25 dialed 4 times in a row). Without more information, Network Operations Center 29 will be unaware of the time period during which the calls responsible for the MCE alarm occurred (e.g., per second, per hour, per day, per week, etc.). A
mass calling event alarm could be issued even though the calls occurred at a rate well within normal network traffic rates. By periodically resetting first register 30 19, first counter 21, first register 23, and first register 25, Network Operations Center 29 will know, at a minimum, that the calls responsible for the MCE
alarm occurred within one periodic reset time KO (be it a minute, an hour, a day, etc.).
As such, periodic resetting reduces false mass calling event alarms, whether used independently of or in cooperation with count thresholds K1 and K2.
With regard to the selection of count thresholds K1 and K2 and periodic reset time KO for mass calling event detection, factors such as the fraction of traffic from a given telephone number, p, and the total traffic rate, ~, (e.g., the number of telephone calls per second), must be considered. For example, the time to detection td (e.g., time required for a mass calling event alarm to be 1o generated) is approximately related to detection probability E, by:
- K2!~ logs td KO K2-1 , ~K2 , pKl K2 (Note that this formula is only an approximation. A more accurate measure of td requires computer simulation.) From the above formula it is clear that time to detection td can be optimized by making periodic reset time KO
large while keeping count thresholds K1 and K2 small. However, increasing periodic reset time KO and decreasing count thresholds K1 and K2 also increases the probability of a false mass calling event alarm being issued. The desire for 2o fast mass calling event detection must therefore be balanced with the need for accurate mass calling event detection.
FIG. 2 shows an illustrative sequence of steps in accordance with the invention for operating the apparatus of FIG. 1 as described above or, more generally, for use in a software embodiment of the present invention. To some extent these steps have already been mentioned and the discussion of them here can be somewhat abbreviated.
In step 200 registers R1 and R2 and counters C1 and C2 are reset.
Registers R1 and R2 may, for example, be equivalent to first register 19 and second register 23 of FIG. 1, respectively, while counters C1 and C2 may be equivalent to first counter 21 and second counter 25 of FIG. 1, respectively.
Normally R1, R2, C 1, and C2 are reset to zero, though other starting values may be used.
In step 202 a query is made to determine the MRDTN present at the network node.
In step 204 the contents of register R1 are compared to the MRDTN. If the MRDTN is the same as the contents of register R1, then control passes to step 208 (described below); otherwise control passes to step 206 wherein the MRDTN is stored in register R1, counter C1 is initialized (e.g., set to one), and 1o control passes back to step 202 wherein a new MRDTN is obtained and the above mentioned steps are repeated.
In step 208 (recalling that control passed to step 208 when, in step 204, the MRDTN was found to be the same as the contents of register R1 ) counter C
is incremented (e.g., increased by one), indicating that the MRDTN is the same telephone number as is contained in register R1. Control then passes to step 210.
In step 210, counter C1 is compared to a first count threshold K1. If counter C1's count is not equal to or greater than count threshold K1, control passes to step 202; otherwise, control passes to step 212.
In step 212, the contents of register R1 are compared to the contents of 2o register R2. If the contents of register R1 are the same as the contents of register R2, control passes to step 216 (described below); otherwise, control passes to step 214.
In step 214, the contents of register R1 are loaded into register R2 and register R1 and counter C1 are reset (e.g., set to zero). Counter C2 is also initialized (e.g., set to 1). Control then passes to step 202.
In step 216 (recalling that control passed to step 216 when, in step 212, the contents of register R1 were determined to be the same as the contents of register R2) counter C2 is incremented (e.g., increased by one). Control then passes to step 218.
3o In step 218 counter C2 is compared to a second count threshold K2. If counter C2's count is not equal to count threshold K2, control passes to step 202;
otherwise, control passes to step 220.
In step 220 an alarm is issued, which in the preferred embodiment contains the contents of register R2 (i.e., the MRDTN responsible for the alarm), to a monitoring station (e.g., Network Operations Center 29). Register R2 and counter C2 are then reset (e.g., set to zero) and control is passed to step 202.
As described with regard to FIG. 1, registers R1 and R2 and counters C1 and C2 are preferably periodically reset (e.g., set to zero) every KO seconds to reduce false MCE alarms. In one preferred embodiment, the resetting of registers R1 and R2 and counter C1 and C2 is achieved by adding a timer T1 which is started in step 206 of FIG. 2 and stopped (and reset to zero) in step 200.
An additional step 203 is added which determines if timer T1 has counted KO
seconds, and if so, passes control to step 200 wherein register Rl and R2 and counters C1 and C2 are reset to zero and wherein timer T1 is stopped and reset to zero, otherwise step 203 passes control to step 202 wherein a new MRDTN is obtained. Furthermore, steps 210, 214, 218, and 220 are configured to pass control to step 203 rather than step 202 as previously described.
The system and method of the present invention is particularly well suited for use in the segmentation directories being introduced to AT&T's long 2o distance network. FIG. 3 shows a plurality of local switches 31 a - 31 n coupled to a segmentation directory 33. Although FIG. 3 shows only 14 local switches (switches 31 a - 31 n), it is understood that any number may be used. The local switches 31 represent local AT&T switching nodes scattered throughout the United States and provide access/egress for calls entering/leaving AT&T's long distance network. For example, if a caller picks up a telephone in Manhattan and dials a San Francisco telephone number, the local telephone service provider (e.g., NYNEX) determines what long distance carrier (e.g., AT&T, MCI, Sprint, etc.) is being used. If AT&T is the long distance carrier, the dialed telephone number is routed to local switch 31 m in Manhattan (assuming local switch 31 m 3o is located in Manhattan) where its addressing information is interpreted.
Every telephone number entering the AT&T's long distance network (through local switches 31 a - 31 n) is fed to segmentation directory 33.
Although FIG. 3 shows only one segmentation directory, it is understood that any number may be used. Segmentation directory 33 serves as a location at which every telephone call entering AT&T's long distance network may be examined.
Because segmentation directory 33 examines every call entering AT&T's long distance network, it is an ideal location for monitoring mass calling events.
As such, in a preferred embodiment, registers Rl and R2 and counters Cl and C2 of FIG. 2 are located within segmentation directory 33. If a mass calling event is detected at segmentation directing 33, calling volume at local switches 31 a -31 n may be automatically controlled or manually controlled by a Network Operations Center. Calling volume rnay be reduced or blocked by techniques well known in the art.
It will be understood that the foregoing is only illustrative of the ~ 5 principles of the invention and that various modifications can be made by those skilled in the art without departing from the scope and spirit of the invention.
For example, the invention can be used at any type of network switching node and can detect small scale mass calling events, such as the calling volume to a local switching network in response to a local radio station promotion.
2o Furthermore, the present invention is well suited for detecting mass addressing events which may occur on the INTERNET or the WORLD WIDE
WEB, during requests for access to data or a data bus, or during any similar addressing event.
The invention may be used with many different types of registers R1 and 25 R2 and counters C 1 and C2 and may be embodied in hardware, software, or any combination thereof.
Claims (43)
1. A method for detecting a potential mass addressing events comprising:
(a) obtaining a most recently selected address;
(b) comparing said selected address to contents of a first storage element;
(c) incrementing a first counting element if said selected address is equal to said contents of said first storage element, otherwise initializing said first counting element and loading said first storage element with said selected address; and (d) generating a first warning signal if said first counting element equals a first predetermined value.
(a) obtaining a most recently selected address;
(b) comparing said selected address to contents of a first storage element;
(c) incrementing a first counting element if said selected address is equal to said contents of said first storage element, otherwise initializing said first counting element and loading said first storage element with said selected address; and (d) generating a first warning signal if said first counting element equals a first predetermined value.
2. The method defined in claim 1, wherein said selected address is a dialed telephone number.
3. The method defined in claim 1, further comprising:
resetting said first counting element after generating said first warning signal.
resetting said first counting element after generating said first warning signal.
4. The method defined in claim 1, further comprising:
resetting said first storage element after generating said first warning signal.
resetting said first storage element after generating said first warning signal.
5. The method defined in claim 1, further comprising:
resetting said first storage element and said first counting element prior to obtaining said selected address.
resetting said first storage element and said first counting element prior to obtaining said selected address.
6. The method defined in claim 1, wherein said first warning signal includes an identity of said selected address.
7. The method defined in claim 1, further comprising:
alerting a monitoring station of said first warning signal.
alerting a monitoring station of said first warning signal.
8. The method defined in claim 7, wherein said monitoring station is a Network Operations Center.
9. The method defined in claim 1, wherein said first counting element is reset after a predetermined time.
10. The method defined in claim 1, wherein said first storage element is reset after a predetermined time.
11. The method defined in claim 1, wherein said first counting element and said first storage element are both reset after a predetermined time.
12. The method defined in claim 11, further comprising:
repeating steps (a)-(d).
repeating steps (a)-(d).
13. The method defined in claim 1, further comprising:
(e) comparing the contents of said first storage element to contents of a second storage element in response to said first warning signal;
(f) incrementing a second counting element if said contents of said first storage element are equal to said contents of said second storage element, otherwise initializing said second counting element and loading said second storage element with said contents of said first storage element; and (g) generating a second warning signal if said second counting element equals a second predetermined value.
(e) comparing the contents of said first storage element to contents of a second storage element in response to said first warning signal;
(f) incrementing a second counting element if said contents of said first storage element are equal to said contents of said second storage element, otherwise initializing said second counting element and loading said second storage element with said contents of said first storage element; and (g) generating a second warning signal if said second counting element equals a second predetermined value.
14. The method defined in claim 13, further comprising:
resetting said second counting element after generating said second warning signal.
resetting said second counting element after generating said second warning signal.
15. The method defined in claim 13, further comprising:
resetting said second storage element after generating said second warning signal.
resetting said second storage element after generating said second warning signal.
16. The method defined in claim 13, wherein said second warning signal includes an identity of said selected address.
17. The method defined in claim 13, further comprising:
alerting a monitoring station of said second warning signal.
alerting a monitoring station of said second warning signal.
18. The method defined in claim 17, wherein said monitoring station is a Network Operations Center.
19. The method defined in claim 13, further comprising:
repeating steps (a)-(g).
repeating steps (a)-(g).
20. The method defined in claim 13, wherein said first counting element is reset after a predetermined time.
21. The method defined in claim 13, wherein said first storage element is reset after a predetermined time.
22. The method defined in claim 13, wherein said second counting element is reset after a predetermined time.
23. The method defined in claim 13, wherein said second storage element is reset after a predetermined time.
24. The method defined in claim 13, wherein said first counting element, said first storage element, said second counting element, and said second storage element are reset after a predetermined time.
25. An apparatus for detecting a mass calling events comprising:
a first counter;
a first register;
means for determining whether contents of said first register are equal to a most recently selected address, and if so, incrementing said first counter, otherwise initializing said first counter and storing said selected address in said first register;
and means for determining whether said first counter has reached a first predetermined value, and if so, generating a first warning signal.
a first counter;
a first register;
means for determining whether contents of said first register are equal to a most recently selected address, and if so, incrementing said first counter, otherwise initializing said first counter and storing said selected address in said first register;
and means for determining whether said first counter has reached a first predetermined value, and if so, generating a first warning signal.
26. The apparatus defined in claim 25, wherein said selected address is a dialed telephone number.
27. The apparatus defined in claim 25, further comprising:
means for resetting said first counter following said first warning signal being generated.
means for resetting said first counter following said first warning signal being generated.
28. The apparatus defined in claim 25, further comprising:
means for resetting said first register following said first warning signal being generated.
means for resetting said first register following said first warning signal being generated.
29. The apparatus defined in claim 25, further comprising:
means for alerting a monitoring station of said first warning signal.
means for alerting a monitoring station of said first warning signal.
30. The apparatus defined in claim 29, wherein said monitoring station is a Network Operations Center.
31. The apparatus defined in claim 25, further comprising:
means for resetting said first counter after a predetermined time.
means for resetting said first counter after a predetermined time.
32. The apparatus defined in claim 25, further comprising:
means for resetting said first register after a predetermined time.
means for resetting said first register after a predetermined time.
33. The apparatus defined in claim 25, further comprising:
means for resetting said first counter and said first register after a predetermined time.
means for resetting said first counter and said first register after a predetermined time.
34. The apparatus defined in claim 25, further comprising:
a second counter;
a second register;
means for comparing the contents of said first register to contents of said second register in response to said first warning signal;
means for incrementing said second counter if said contents of said first register are equal to said contents of said second register, otherwise initializing said second counter and storing the contents of said first register in said second register;
and means for determining if said second counter equals a second predetermined value, and if so, generating a second warning signal.
a second counter;
a second register;
means for comparing the contents of said first register to contents of said second register in response to said first warning signal;
means for incrementing said second counter if said contents of said first register are equal to said contents of said second register, otherwise initializing said second counter and storing the contents of said first register in said second register;
and means for determining if said second counter equals a second predetermined value, and if so, generating a second warning signal.
35. The apparatus defined in claim 34, further comprising:
means for resetting said. second counter following said second warning signal being generated.
means for resetting said. second counter following said second warning signal being generated.
36. The apparatus defined in claim 34, further comprising:
means for resetting said second register following said second warning signal being generated.
means for resetting said second register following said second warning signal being generated.
37. The apparatus defined in claim 34, further comprising:
means for alerting a monitoring station of said second warning signal.
means for alerting a monitoring station of said second warning signal.
38. The apparatus defined in claim 37, wherein said monitoring station is a Network Operations Center.
39. The apparatus defined in claim 34, further comprising:
means for resetting said first counter after a predetermined time.
means for resetting said first counter after a predetermined time.
40. The apparatus defined in claim 34, further comprising:
means for resetting said first register after a predetermined time.
means for resetting said first register after a predetermined time.
41. The apparatus defined in claim 34, further comprising:
means for resetting said second counter after a predetermined time.
means for resetting said second counter after a predetermined time.
42. The apparatus defined in claim 34, further comprising:
means for resetting said second register after a predetermined time.
means for resetting said second register after a predetermined time.
43. The apparatus defined in claim 34, further comprising:
means for resetting said first counter, said first register, said second counter, and said second register after a predetermined time.
means for resetting said first counter, said first register, said second counter, and said second register after a predetermined time.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/800,796 US5923742A (en) | 1997-02-14 | 1997-02-14 | System and method for detecting mass addressing events |
| US08/800,796 | 1997-02-14 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2228591A1 CA2228591A1 (en) | 1998-08-14 |
| CA2228591C true CA2228591C (en) | 2001-08-07 |
Family
ID=25179382
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002228591A Expired - Lifetime CA2228591C (en) | 1997-02-14 | 1998-02-04 | System and method for detecting mass addressing events |
Country Status (2)
| Country | Link |
|---|---|
| US (1) | US5923742A (en) |
| CA (1) | CA2228591C (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2315635B (en) * | 1996-07-19 | 2000-10-11 | Ericsson Telefon Ab L M | Dynamic load limiting |
| US6047052A (en) * | 1997-07-30 | 2000-04-04 | Nippon Telegraph And Telephone Corporation | Data collection method and system with shorter control interval |
| US6243449B1 (en) * | 1998-03-20 | 2001-06-05 | Nortel Networks Limited | Mass calling event detection and control |
| US7002915B1 (en) * | 1999-11-22 | 2006-02-21 | Alcatel Canada Inc. | Automated mass calling control for public switched telephone networks employing a packet based virtual tandem |
| NO20003682L (en) * | 2000-07-18 | 2002-01-21 | Ericsson Telefon Ab L M | Measurement of holding time in communication networks |
| US7130397B2 (en) * | 2002-08-05 | 2006-10-31 | Alcatel | Apparatus, and an associated method, for detecting a mass call event and for ameliorating the effects thereof |
| US7206307B1 (en) | 2002-11-18 | 2007-04-17 | At&T Corp. | Method and system for providing multi-media services incorporating a segmentation directory adapted to direct requests for multi-media services to one or more processors |
| US7366163B1 (en) | 2003-04-25 | 2008-04-29 | At&T Corp. | Method for providing local and toll services with LNP, and toll-free services to a calling party which originates the call from an IP location connected to a sip-enabled IP network |
| US7817789B2 (en) * | 2003-07-18 | 2010-10-19 | Alcatel Lucent | Mass call defense |
| US7567555B1 (en) | 2004-03-22 | 2009-07-28 | At&T Corp. | Post answer call redirection via voice over IP |
| US7995725B1 (en) * | 2006-05-11 | 2011-08-09 | West Corporation | Compilation, analysis, and graphic representation of call data |
| US8059799B1 (en) * | 2007-08-16 | 2011-11-15 | Sprint Communications Company L.P. | Algorithm to make optimal use of network resources during a mass calling event |
| CN101634939B (en) * | 2008-07-24 | 2012-07-04 | 中兴通讯股份有限公司 | Fast addressing device and method thereof |
| US9271253B2 (en) * | 2013-11-26 | 2016-02-23 | Motorola Solutions, Inc. | Method and system for managing mass registration scenario in two-way radio system |
| US9277428B2 (en) * | 2014-04-29 | 2016-03-01 | Motorola Solutions, Inc. | Method and apparatus for responding to a potential mass random access event |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3560658A (en) * | 1968-10-18 | 1971-02-02 | Bell Telephone Labor Inc | Trunk usage recording and call charging equipment |
| US5042064A (en) * | 1990-05-03 | 1991-08-20 | At&T Bell Laboratories | Call control strategy for high capacity telecommunication services |
| US5295183A (en) * | 1991-11-21 | 1994-03-15 | Northern Telecom Limited | Congestion control system for telecommunications |
| US5537611A (en) * | 1992-04-14 | 1996-07-16 | Mci Communications Corporation | Network management of special service calls |
| US5450483A (en) * | 1993-11-18 | 1995-09-12 | British Telecommunications P.L.C. | Method of controlling overloads in a telecommunications network |
| US5825769A (en) * | 1995-03-17 | 1998-10-20 | Mci Corporation | System and method therefor of viewing in real time call traffic of a telecommunications network |
| US5828729A (en) * | 1995-11-22 | 1998-10-27 | Stentor Resource Centre Inc. | Automated mass calling detection using CCS7 message parameters |
| US5778057A (en) * | 1996-02-09 | 1998-07-07 | Bell Communications Research, Inc. | Service control point congestion control method |
-
1997
- 1997-02-14 US US08/800,796 patent/US5923742A/en not_active Expired - Lifetime
-
1998
- 1998-02-04 CA CA002228591A patent/CA2228591C/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| US5923742A (en) | 1999-07-13 |
| CA2228591A1 (en) | 1998-08-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2228591C (en) | System and method for detecting mass addressing events | |
| EP1065827B1 (en) | Method and apparatus for detecting service anomalies in transaction-oriented networks | |
| US5488715A (en) | Process for integrated traffic data management and network surveillance in communications networks | |
| US5295183A (en) | Congestion control system for telecommunications | |
| US7853005B2 (en) | Web-based network monitoring tool | |
| CA2231188C (en) | Controlling traffic congestion in intelligent electronic networks | |
| NZ297844A (en) | Fault monitoring and recording ignores isolated transient faults | |
| US5809491A (en) | Call traffic based exception generating system | |
| US4484030A (en) | Method and apparatus for identifying faulty communications circuits | |
| US20070274459A1 (en) | Method, system, and article for informing a telecommunication customer of a future performance estimate for a telecommunication feature | |
| US5450468A (en) | Method of rapidly assessing damage to outside loop plant | |
| CA1102422A (en) | Arrangement for supervision of the seizure condition quality for a device belonging to a group of devices | |
| US20050138463A1 (en) | System and method for identifying extreme behavior in elements of a network | |
| US5930334A (en) | Method and apparatus for monitoring the operation of telecommunications equipment | |
| CA2323562C (en) | Call distribution system utilizing global or local counter | |
| US5852649A (en) | Alarm notification system and method for a telephone switch | |
| CA2237600C (en) | Call traffic based exception generating system | |
| JP3317978B2 (en) | Outgoing trunk group dispersion ratio setting method | |
| JPH04117045A (en) | Control system for active line number | |
| JPH0155619B2 (en) | ||
| JPH0851426A (en) | Pulse generation rate monitoring circuit | |
| JPS61214855A (en) | Subscriber communication monitor system | |
| JPH06334736A (en) | Automatic selective calling type fault notice device | |
| KR950023191A (en) | Overload Control Method in Intelligent Network | |
| MXPA97004636A (en) | Ave inspection |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20180205 |