Abstract: A computer-implemented method for triggering a software rejuvenation system and/or method includes receiving a request for resources, determining an estimated response time to the request for resources, determining that the estimated response time is greater than a first threshold, determining that a number of estimated response times greater than the first threshold is greater than or equal to a dynamic second threshold, and triggering the software rejuvenation system and/or method.

Abstract: A method for analyzing load run test results of a computer system includes providing a plurality of performance measure sets derived from a first series of load run tests performed over a same time period. Each set comprises a plurality of records and each record has a timestamp and a value. Performance measure records are sorted by value in ascending order, for each performance measure set. Plateau regions are identified in the sorted performance measure sets, for each performance measure. Performance measure records are sorted within each plateau region by time stamp in ascending order, for each performance measure. Overlapping time intervals covered by the plateau regions are identified for the plurality of performance measure sets, and averages of performance measures are computed over the overlapping time intervals.

Abstract: A system for servicing a telecommunications conversation comprising one or more messages includes a sequence recognition engine for processing an incoming message, a queue for storing a sequence of messages of said conversation, a length indicator for a message subsequence eligible for processing, a state indicator of said message sequence, and an indicator of a most recently transmitted message of said message sequence. When a new message arrives the sequence recognition engine is invoked to place the message in a correct position in the queue and to determine a next state for the message sequence.

Abstract: A computer-implemented method for triggering a software rejuvenation system or method in a computer-system including a plurality of replicates includes receiving a request for resources at a first replicate, determining an estimated response time to the request for resources, and determining that the estimated response time is greater than a first threshold. The method further includes determining that a number of estimated response times greater than the first threshold is greater than or equal to a second threshold, wherein the second threshold of the first replicate is different than a second threshold of a second replicate of the computer-system, and triggering the software rejuvenation system or method for the first replicate.

Abstract: A computer-implemented method for triggering a software rejuvenation system and/or method includes receiving a plurality of requests for resources, determining to take a sample of the requests with a probability, determining an estimated average response time to the sample of the requests for resources, determining that the estimated average response time is greater than a first threshold, wherein the first threshold is a mean of an assumed value, determining that a number of estimated average response times greater than the first threshold is greater than or equal to a second threshold, and triggering the software rejuvenation system and/or method.

Abstract: A method for analyzing load run test results of a computer system includes providing a plurality of performance measure sets derived from a first series of load run tests performed over a same time period, each the set comprising a plurality of records, each record having a timestamp and a value, sorting performance measure records by value in ascending order, for each performance measure set, identifying plateau regions in the sorted performance measure sets, for each performance measure, sorting performance measure records within each plateau region by time stamp in ascending order, for each performance measure, identifying overlapping time intervals covered by the plateau regions for the plurality of performance measure sets, and computing averages of performance measures over the overlapping time intervals.

Abstract: A system for servicing a telecommunications conversation comprising one or more messages includes a sequence recognition engine for processing an incoming message, a queue for storing a sequence of messages of said conversation, a length indicator for a message subsequence eligible for processing, a state indicator of said message sequence, and an indicator of a most recently transmitted message of said message sequence. When a new message arrives the sequence recognition engine is invoked to place the message in a correct position in the queue and to determine a next state for the message sequence.

Abstract: An apparatus and method control the effects of loading due to retries and backlogged status inquiry polling, by reducing the number of message retry attempts and hence the number of queued messages and/or pending retries that are permitted to be directed to a specified target address on a network, during perceived unresponsiveness of the targeted address node. This selectively throttles messages directed to the targeted address node, while reducing the extent to which the unresponsiveness of the targeted address node can produce congestion in proximate switches attempting to direct messages to the targeted address from other points in the network.

Abstract: An apparatus and method for routing calls to communication processing centers based on an optimal destination plan. Calls are allocated on the basis of area codes, regions, or other predetermined categories to particular communication processing centers. Each communication processing center's free capacity is calculated for all time intervals and this result is used to ascertain the smallest free capacity of any time interval for each communication processing center. The calls are then reallocated through linear programming methods such that the amount of smallest free capacity is maximized in order to determine the optimal call allocation scheme.

Abstract: A method and system for monitoring nodes in a network having at least one network management station and a plurality of nodes is provided. Initially, polling messages are sent from the network management station to the plurality of nodes. Preferably, the polling messages are sent in a sequence whose emission is regulated at a predetermined rate. As the polling messages are sent, an unacknowledged poll table is updated with the appropriate information indicating that a set of nodes have been sent a polling message. The unacknowledged poll table is preferably indexed by an IP address of each node and is indexed by the time of the next scheduled timeout associated with each node. This method allows an arbitrary number of unacknowledged polls to be outstanding at any instant. Once the polling messages are sent and the queue is updated, the network management station then determines if a node has failed.