Congestion control system for telecommunications

Claim 2

In a telecommunications network having a plurality of switching offices interconnected by trunks and connected to a central processor for periodically exchanging data, with the central processor during an update cycle, to effect dynamic call routing, a method of congestion control comprising the steps of: at the beginning of an update cycle, receiving data, from the switching offices, indicative of occupancy of network resources for updating data of the central processor; determining from the data whether there are destinations within the network to which access is to be restricted; establishing an alert status for each of the restricted destinations; calculating, for each of the restricted destinations, an interval of time to be left between calls entering the network that are directed thereto and referred to as a call interarrival time; and the central processor, during the update cycle, sending, to the switching offices, an identification for each of the restricted destinations, together with the alert status and the call interarrival time therefor for updating data of the switching offices for dynamic call routing and congestion control.

Claim 3

A method as claimed in claim 1 wherein the step of establishing the alert status includes the steps of computing an average occupancy, O av , for the current update cycle and comparing the average occupancy to a predetermined threshold, ρ 0 .

Claim 4

A method as claimed in claim 2 wherein the step of computing an average occupancy, O av , is in accordance with the formula: O.sub.av ←(1-β)*O.sub.m +β*O.sub.av where, O m is a measured occupancy for the current update cycle, β is a weighting factor, and O av is the average occupancy of all previous update cycles.

Claim 5

A method as claimed in claim 3 wherein the step of computing the average occupancy, O av , uses a weighting factor, β of between 0 to 1.

Claim 6

A method as claimed in claim 1 wherein the step of calculating the call interarrival time is in accordance with the formula: ##EQU5## for data of a direct occupancy measurement type, where ρ is a current occupancy measurement, ρ t , is a target occupancy, RECOM is a previously recommended call interarrival time and R min is a predetermined floor value.

Claim 7

A method as claimed in claim 5 wherein the step of calculating the call interarrival time uses a value of R min of about 0.1 R 0 where R 0 =1/(λ exp /number of switching offices) where λ exp is an expected call flow at a subscriber.

Claim 8

A method as claimed in claim 1 wherein the step of calculating the call interarrival time is in accordance with the formula: ##EQU6## for data representing a rate of calls overflowing, where O m is a current overflow measurement, O t is a target overflow, RECOM is a previously recommended call interarrival time, T U is the data exchanging period, z is the number of switching offices in the network and R min is a predetermined floor value.

Claim 9

A method as claimed in claim 1 further comprising the steps of, for each of the plurality of switching offices, receiving the identification for each of the restricted destinations, together with the alert status and the call interarrival time therefor, from the central processor, and staggering application of the call interarrival time for each destination having an alert status.

Claim 10

A method as claimed in claim 8 wherein the step of staggering application of the call interarrival time for each destination having an alert status includes, if a previous call release time exists, generating a release time in accordance with the formula: T.sub.0i ←T+(T.sub.0i -T)*(RECOM.sub.i /PREV--RECOM) where T is the present time, T 0i is the previous release time at switch i, RECOM is the current call interarrival time recommendation and PREV--RECOM is the recommendation of the previous update cycle; otherwise, generating a release time in accordance with the formula: T 0i ←T+RECOM*random[0,1], where random [0,1] is a random number generator which picks a number between 0 and 1.

Claim 11

In a telecommunications network having a plurality of switching offices interconnected by trunks and connected to a central processor for periodically exchanging data, with the central processor during an update cycle, to effect dynamic call routing, a method of congestion control comprising the steps of: at the beginning of an update cycle, receiving data, from the switching offices, indicative of occupancy of network resources for updating data of the central processor; for each origin-destination pair of the plurality of switching offices, recommending a tandem switching office in dependence upon occupancy of trunks to the switching office and CPU occupancy of the switching office; determining from the data whether there are destinations within the network to which access is to be restricted; establishing an alert status for each of the restricted destinations; calculating, for each of the restricted destinations an interval of time to be left between calls entering the network that are directed thereto and referred to as a call interarrival time; and the central processor, during the update cycle, sending, to the switching offices, an identification for each of the restricted destinations, together with the alert status and the call interarrival time therefor for updating data of the switching offices for dynamic call routing and congestion control.

Claim 12

In a telecommunications network having a plurality of switching offices interconnected by trunks and connected to a central processor for periodically exchanging data, with the central processor during an update cycle, to effect dynamic call routing, a method of congestion control comprising the steps of: at the beginning of an update cycle, receiving data, from the switching offices, indicative of occupancy of network resources for updating data of the central processor; for each origin-destination pair of the plurality of switching offices, recommending a tandem switching office in dependence upon occupancy of trunks to the switching office and CPU occupancy of the switching office; determining from the data whether there are destinations within the network to which access is to be restricted; establishing an alert status for each of the restricted destinations; calculating, for each of the restricted destinations an interval of time to be left between calls entering the network that are directed thereto and referred to as a call interarrival time; and the central processor, during the update cycle, sending, to the switching offices, an identification for each of the restricted destinations, together with the alert status and the call interarrival time therefor for updating data of the switching offices for dynamic call routing and congestion control.

Claim 13

A method as claimed in claim 10 wherein the step of recommending a tandem switching office TSO, for an origin-destination pair od, is in accordance with the following: TSO=max{min[C n (l.sub.[0]on -P.sub.[0]on),C n (l nd -P nd )]} for n=1, 2, 3 , . . . ,z where C n is a call compression factor (CCF) of switching office n, z is the number of switching offices in the network, l ij is the number of idle trunks between switching offices i and j, and P ij is a predetermined protective allowance on the trunks between switching offices i and j.

Claim 14

A method as claimed in claim 11 wherein in the step of recommending a tandem switching office, for each update cycle, for each switching office n, C n is updated with the following: C.sub.n ←min {C.sub.n (ρ.sub.t /ρ.sub.n),1} where ρ t is a predetermined CPU occupancy and ρ n is the CPU occupancy received from switching office n.