Abstract: A Call Server in a network is able to monitor an offered rate of incoming calls per Access Gateway (AGW). A calculated GlobalLeakRate can be distributed between the AGWs in proportion to the traffic rate they offer. A leak rate calculation method is used to calculate the GlobalLeakRate control parameter of the ETSI NR restrictor at an overloaded Control Server The leak rate calculation is based on the POTS call rejection rate. In one particular embodiment of the present invention, the calculation is based on bringing the call reject rate close to a configurable low target reject level. An MGC is able to identify the end of an overload event with a greater degree of confidence and an AGW is able respond appropriately if the AGW is prematurely instructed to stop the control.

Abstract: A Call Server in a network is able to monitor an offered rate of incoming calls per Access Gateway (AGW). A calculated GlobalLeakRate can be distributed between the AGWs in proportion to the traffic rate they offer. A leak rate calculation method is used to calculate the GlobalLeakRate control parameter of the ETSI NR restrictor at an overloaded Control Server The leak rate calculation is based on the POTS call rejection rate. In one particular embodiment of the present invention, the calculation is based on bringing the call reject rate close to a configurable low target reject level. An MGC is able to identify the end of an overload event with a greater degree of confidence and an AGW is able respond appropriately if the AGW is prematurely instructed to stop the control.

Abstract: A Call Server in a network is able to monitor an offered rate of incoming calls per Access Gateway (AGW). A calculated GlobalLeakRate can be distributed between the AGWs in proportion to the traffic rate they offer. A leak rate calculation method is used to calculate the GlobalLeakRate control parameter of the ETSI_NR restrictor at an overloaded Control Server The leak rate calculation is based on the POTS call rejection rate. In one particular embodiment of the present invention, the calculation is based on bringing the call reject rate close to a configurable low target reject level. An MGC is able to identify the end of an overload event with a greater degree of confidence and an AGW is able respond appropriately if the AGW is prematurely instructed to stop the control.

Abstract: A Call Server in a network is able to monitor an offered rate of incoming calls per Access Gateway (AGW). A calculated GlobalLeakRate can be distributed between the AGWs in proportion to the traffic rate they offer. A leak rate calculation method is used to calculate the GlobalLeakRate control parameter of the ETSI NR restrictor at an overloaded Control Server The leak rate calculation is based on the POTS call rejection rate. In one particular embodiment of the present invention, the calculation is based on bringing the call reject rate close to a configurable low target reject level. An MGC is able to identify the end of an overload event with a greater degree of confidence and an AGW is able respond appropriately if the AGW is prematurely instructed to stop the control.

Abstract: The present invention provides a method for optimization of the configuration of a hierarchical network having a first hierarchy level (LEVEL(j?1)), a second hierarchy level (LEVEL(j)) next below the first level, and a third hierarchy level (LEVEL(j+1)) next below the second level, each level comprising nodes (RNC's, HUB's, RBS's) each of which, in level other than the lowest, receives traffic from a cluster of nodes (HUB's, RBS's) of the level next below. The method comprises first determining an initial arrangement of nods (RNC's, HUB's, RBS's) in each of the levels other than the highest, allocating respective initial clusters of nodes (HUB's, RBS's) of that level to the nodes (RNC's, HUB's) of the next higher level, and performing optimizing iterations until they result in no changes in number, disposition and allocation of nodes (RNC's, HUB's, RBS's) over predetermined number of iterations.

Abstract: A path through a data network is calculated that accounts for priority levels of already-established paths. Potential new paths are determined taking into account priority level information associated with data network links. Of the determined paths, the path selected is preferably one having the least pre-emptive effect on lower priority traffic. The bandwidth reservation information for each data network link is determined along with the maximum bandwidth of each link and the available bandwidth at each priority level. Links with insufficient resources are eliminated from consideration. For the remaining candidate paths, determination for each link are make: which lower priority levels will be affected by the setup of the new path, how much reserved bandwidth will be pre-empted at each priority level, and how much free bandwidth is available at the lowers priority level. A path is selected that reduces or preferably minimizes some aspect of pre-emption.

Abstract: The present invention provides a method for optimization of the configuration of a hierarchical network having a first hierarchy level (LEVEL(j−1)), a second hierarchy level (LEVEL(j)) next below the first level, and a third hierarchy level (LEVEL(j+1)) next below the second level, each level comprising nodes (RNC's, HUB's, RBS's) each of which, in level other than the lowest, receives traffic from a cluster of nodes (HUB's, RBS's) of the level next below. The method comprises first determining an initial arrangement of nods (RNC's, HUB's, RBS's) in each of the levels other than the highest, allocating respective initial clusters of nodes (HUB's, RBS's) of that level to the nodes (RNC's, HUB's) of the next higher level, and performing optimizing iterations until they result in no changes in number, disposition and allocation of nodes (RNC's, HUB's, RBS's) over predetermined number of iterations.

Abstract: A path through a data network is calculated that accounts for priority levels of already-established paths. For example, when a request is received to calculate a path from a source node to a destination node through a data network to support a connection designating a particular priority level and a particular resource amount/type, e.g., a bandwidth requirement, traffic engineering information including priority level information of links in the data network is reviewed. Potential new paths are determined taking into account priority level information associated with data network links. Of the determined paths, the path selected is preferably one having the least pre-emptive effect on lower priority traffic. The bandwidth reservation information for each data network link is determined along with the maximum bandwidth of each link and the available bandwidth at each priority level. Links with insufficient resources are eliminated from consideration. Other “costly” paths, e.g.

Abstract: A fast and efficient system and method for network management under traffic overload conditions is described. The technique uses an algorithm to automatically generate a close approximation of the optimum working state of a telecommunications network when the actual traffic is found to be greater than network capacity. The algorithm uses traffic blockage measurements obtained from distributed network switches and generates code blocking parameters that can be applied to the distributed network switches to enhance total revenue. The described technique provides additional revenue gains over that obtainable by partially rerouting traffic away from congested network links. The use of the described code blocking technique may be discontinued when the conditions causing the network overload are determined to have disappeared.