Abstract: The apparatus and method of the present invention provides even loadsharing of round-robin querying of replicated databases in a network architecture which responds to network conditions. The network architecture utilizes a round-robin routing table that includes correlated index numbers, point codes and addresses of the replicated databases. The network architecture responds to incoming queries with searching of the round-robin routing table by incrementing to a successor index number and an associated point code. The network architecture may further determine whether the database at the address pointed by the point code is accessible. If not, the network architecture increments to another successor index number to locate an accessible database. When an accessible database is found, the point code is set to the address of the accessible database and the query is forwarded to that address.

Abstract: The apparatus and method of the present invention provides even loadsharing of round-robin querying of replicated databases in a network architecture which responds to network conditions. The network architecture utilizes a round-robin routing table that includes correlated index numbers, point codes and addresses of the replicated databases. The network architecture responds to incoming queries with searching of the round-robin routing table by incrementing to a successor index number and an associated point code. The network architecture may further determine whether the database at the address pointed by the point code is accessible. If not, the network architecture increments to another successor index number to locate an accessible database. When an accessible database is found, the point code is set to the address of the accessible database and the query is forwarded to that address.

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.

Abstract: A method and system for processing a call in a telecommunications network comprising a signalling system interconnecting a switch, a segmentation directory and at least one service processor for processing a call associated with a particular service or feature provided by the telecommunications network. The switch receives the call and information associated with the call and transmits a first query message to the segmentation directory. The segmentation directory determines whether the call requires processing by a service processor, and if so, identifies a service processor capable of processing the call.

Abstract: A system and method for estimating the traffic rates of large traffic sources is provided. A class of a most recently selected address is compared to the contents of a register. If the class is the same as the contents of the register, a first counter is incremented; otherwise, the class is loaded into the register and the first counter is initialized. A class of a new most recently selected address is then obtained and the above process repeated. If the count of the first counter reaches a predetermined threshold, a threshold counter associated with the class is incremented and the first counter and register are reset. A different threshold counter is associated with each different class. After a predetermined time period, the traffic rate for a class may be computed from the count of the threshold counter associated with the class.