Call traffic control

Abstract: There are disclosed a method of call control (gapping) and a communications switching system in which such method is implemented, the system incorporating a call gapping arrangement for limiting the recurrence rate of successive call attempts for a particular type of call, for example to a national phone-in number, the arrangement comprising a clock (10) for determining a succession of call gapping intervals; a first up/down counter (18) having a limit N; a signal generator (11) responsive to the clock and coupled to the counter (18) to increment it by a value m each interval; a second up/down counter (21) having a limit M less than N, the counters (18,21) being responsive to call processing circuitry (14) to be decremented for each call attempt effected by the system; a comparator (15) responsive to the content of counter (21) becoming zero to inhibit the call processing circuitry (14) from allowing call attempts. The performance of the call gapping method is nearly ideal, and it can be left permanently operational.

Description: This invention relates to call traffic control in a communications switching system and particularly but not exclusively to controling call traffic to a particular called customer code. It is known to limit the rate at which successive attempts may be made to complete all or a part of a call to a particular called customer, and a method is disclosed in US Patent No. 4,224,479 (Kenneth E Crawford) in which a subsequent attempt is prohibited within a predetermined time interval (gapping interval) from the last earlier allowed attempt. Crawford's method results in a carried rate approaching one call per gapping interval only for very high offered calling rate of the order of 20 calls per gapping interval. Moreover, at offered calling rates of the order of one call per gapping interval, Crawford's method results in a significantly reduced carried rate even though the switching system can handle calls at such offered rates. Consequently, to avoid significant loss of revenue it is necessary to remove the call control or change the gapping interval when the offered calling rate drops, and such a decision is usually taken by a traffic control manager. It is also known from a presentation by Jonathan S Turner "New Directions in Communications (or Which Way to the Information Age?)" held in "1986 International Zurich Seminar on Digital Communications", March 11-13, 1986, Zurich, Switzerland, to control congestion in a packet switching network by use of a leaky bucket mechanism by which a user specifies bandwidth needs and transmission burstiness. A respective counter is incremented whenever a user sends a packet to the network for transmission, and is decremented periodically. If the counter exceeds a threshold upon being incremented, the network discards the packet. For long term control, the value of the counter threshold is reduced in response to heavy loads. The present invention seeks to provide a method of controlling call traffic which is closer to ideal performance and a communications switching system in which call traffic is controlled in accordance with such method. In accordance with a first aspect of the present invention there is provided a method of controlling a focussed overload in a circuit-switched communications network as claimed in claim 1. In accordance with a second aspect of the present invention there is provided a call traffic focussed overload control subsystem as claimed in claim 2. In accordance with a third aspect of the present invention there is provided a circuit-switched communications switching system as claimed in claim 3. The present invention will now be described by way of example with reference to the drawings in which:- Figure 1 is a schematic representation of call gapping in accordance with a prior art method; Figure 2 is a graph of carried call rate against offered calling rate for the prior art method and for a method of the present invention; Figure 3 is a block diagram of part of a communications switching system embodying a basic call traffic control arrangement; Figure 4 is a block diagram of an alternative arrangement to that of Figure 3: Figure 5 is a block diagram of a preferred modification of the arrangement of Figure 4; and Figure 6 is a block diagram of an alternative arrangement to that of Figure 5. Figure 1 represents call control or call gapping in accordance with the method (also known as algorithm) disclosed in the aforementioned US patent (Crawford). Upon acceptance of a first call 1 to a particular called customer for example a phone-in number such as used for Telethons, the system prevents further call attempts will be accepted, and a second call 2 is shown a little after the first interval T, and a third call 3 is shown some time after the second interval T. A detailed description of Crawford's method will not be given here and the reader is referred to the US patent. For the purposes of the present invention it is sufficient to state that comparison is made of current time and the value of the time of last call acceptance increased by the predetermined time T. On the assumption that call arrivals form a Poisson Process then the mean time to the next arrival from any time instant is equal to the mean interarrival time. Letting λ be the offered calling rate (in calls per second) T be the gapping interval (in seconds) R be the resulting calling rate (in calls per second) then the mean resulting interarrival time = T + 1/λ This is equivalent to a mean resulting calling rate of R = 1 T + 1/λ = λ λT + 1 calls per second This is shown as the prior art algorithm in Figure 2, where it can be seen that the resulting calling rate (carried rate) is close to one call per gapping interval only at quite high calling rates in excess of ten calls per gapping interval. It would not be suitable to use such an algorithm at low calling rates because of the significant reduction in carried traffic. Ideally a switching system should be allowed to carry all offered traffic up to a preset value of say one call per gapping interval and be limited to a carried rate of this value for all offered traffic above this. An advantage of such an algorithm is that there is no unnecessary reduction in carried traffic, and consequently the algorithm can be left operative at all times. Figure 3 shows part of a communications switching system. A clock pulse generator 10 is arranged to provide pulses at a repetition rate in accordance with the selected gapping interval. These pulses are received by a setting circuit 11 (constituting a presettable signal generating means of the present invention) which in turn is coupled to an accumulator 12 (constituting a first accumulating means of the present invention). The setting circuit 11 increments the accumulator 12 by a presettable value, m, at the start of each gapping interval. A similar accumulator 13 (constituting a second accumulating means is coupled to call processing circuitry 14 of the system, and to a comparator 15 (constituting a decision means) which is coupled to both accumulators 12 and 13 and to the call processing circuitry 14. A call attempt will be permitted provided that value of the contents of accumulator 13 is less than the value of the contents of accumulator 12. When sufficient call attempts have been made so that the contents of accumulator 13 become equal to the current value of the contents of the accumulator 12, then the comparator 15 changes the signal supplied to the call processing circuitry 14 to inhibit any further call attempts being processed (until the start of the next interval whereupon accumulator 12 will be incremented by m and the comparator will change back again). An overload correction circuit 16 is coupled to both accumulators 12, 13 and to the setting circuit 11. Circuit 16 senses when accumulator 12 has reached the limit of its capacity and subtracts from both accumulators 12, 13 the value of the contents of accumulator 13. Additionally or alternatively, circuit 16 performs this subtraction at the end of each interval or of a number of intervals whereby accumulator 12 gradually accumulates the value of underused allowance. If the amount of underused allowance reaches the limit of accumulator 12, the number stored will remain at the maximum value ie accumulator 12 does not overflow and go back to zero contents. In such a system, the size of accumulator 12 determines the maximum number of call attempts that can be made. To change this maximum, either accumulators 12, 13 can be replaced by different sized accumulators, or they can have a large capacity and be controlled by means (not shown) to define a count limit. Figure 4 shows a variation of Figure 3 in which accumulators 12 and 13 are replaced by an up/down counter 18 (constituting a single accumulating means) which is incremented by m at the start of each interval as determined by the setting circuit 11, and decremented by one for each call attempt permitted by the call processing circuitry 14. The comparator 15 is arranged to inhibit further call attempts while the content of counter 18 is zero. As in the Figure 3 system, the size of counter 18 (inherent or imposed) determines the maximum number of call attempts that can be made in an interval. Figure 5 shows a modification of Figure 4 in accordance with a preferred form of the present invention in which a store 19 is connected to counter 18 and to the setting circuit 11 and arranged to load the current value of the counter 18 at the start of each interval. An accumulator 20 (constituting a third accumulating means of the present invention) accumulates the number of call attempts that are effected by the system and is coupled to the setting circuit 11 and arranged to be reset at the start of each interval. The comparator 15 is responsive to the contents of store 19 and accumulator 20 and is arranged to allow further call attempts only while the count in accumulator 20 is less than the value in store 19. Counter 18 is incremented and decremented in the same manner as in the system of Figure 4. Figure 6 shows an alternative arrangement to the modification of Figure 5 in which a second up/down counter 21 (constituting another single accumulating means of the present invention) is also coupled to the call processing means 14 to be decremented by one for each call attempt permitted, and the comparator 15 is responsive to the content of counter 21 becoming zero to inhibit further call attempts by the call processing circuitry 14. Counter 21 is coupled to counter 18 to receive a signal representative of the value of the contents (count) of counter 18; and it is also coupled to setting circuit 11 to receive a signal representative of the start of an interval, in response to which counter 21 loads the value of counter 18 up to a limit M which is less than the limit N of counter 18. Setting circuit 11 will command counter 18 to increment by m before commanding counter 21 to load the current value of counter 18. It will be appreciated that the call gapping control arrangements shown in Figures 3 to 6 may be embodied in a stored program control (SPC) exchange wherein the functions, eg clock generation, counting, decision, are provided by suitable software. As has been described above one form of basic algorithm comprises (Figure 4) establishing by means of a clock or suitable timing device, consecutive, equal gapping intervals; incrementing counter 18 by value m (one in the simplest case) at the end of each interval up to a limit of N; decrementing the counter by one for each call attempt allowed unless the counter contains zero whereupon call attempts are prevented. Thus any underuse in one gapping interval is carried forward to the next interval and so on. To prevent an unacceptably high number of calls being accepted in one gapping interval after a number of intervals of no traffic the counter has a preset limit of N, so that there cannot possibly be more than N accepted calls in a gapping interval. The preset limit of N may be achieved by the natural counting limit of the counter, or by any suitable means of limiting the counting capacity of the counter. In a preferred algorithm of the invention, embodied in the system of Figure 6, it is desired to avoid a peak of N accepted calls in one gapping interval yet still to obtain the same mean rate of carried calls. Thus the counter 18 with a limit of N is retained, and a further counter 21 is provided having a limit of M where m < M < N. So instead of a single burst of N calls there would for example be two intervals of M calls, for M = N/2. In this preferred algorithm a call is prevented (lost) if the second counter 21 is zero, but carried if it is greater than zero, in which case both counters are decremented by one. At the beginning of each gapping interval the following assignments are made counter 18 = counter 18 + m counter 18 = Min (counter 18, N) counter 21 = Min (counter 18, M) In other words counter 18 is limited to N, and counter 21 follows counter 18 but is itself limited to M. A mathematical analysis of the basic algorithm will now be given Let, m Size of counter increment. N Maximum size for the counter. R Offered calling rate per interval. R' Resulting calling rate per interval C n Probability that counter contains the number n at the start of an interval (after incrementation). P n Probability of n arrivals in an interval. Q n Probability of n or more arrivals in an interval. Thus Note also that C 0 = O. It can be assumed that arrivals form a Poisson Process with rate R above. This gives P n = R n * e -R / n! Assuming that the system is in equilibrium then the following equations can be derived for the case m = 1. for n = 2,3,........, N-1 C N = C N-1 * P 0 + (P 0 + P 1 ) * C N and the normalising equation, Since [2] is a set of n linear equations in the n values C with no constant terms there is a redundant equation. For programming purposes it is convenient to rearrange the equations in [2a] as follows, or for n = 2, 3, ..........N-1 and hence, C N-1 = C N * e R * (1 - P 1 - P 0 ) The above set of equations is triangular and linear in C n . If the above equations [5a & b] and [3] are solved for C n the carried calling rate R' is given by, For general m equations [2a, 2b & 2c] must be replaced with the equations below. Note also that now C i = O for i < m. For n = m+1,........N-1 Expression 6 for R' is unchanged. It is useful to investigate the time dependent behaviour of this algorithm. For instance, if the counter contains 1 at the beginning of the first period what are the counter state probabilities after 100 time intervals? Furthermore, it would be of interest to calculate the expected calling rate over these time intervals. The first of these problems can be solved by multiplying the original counter state vector by the appropriate power of the transition matrix. The second problem can be solved by introducing a correction term for each time period as described below. For the sake of clarity assume that m = 1. In addition to the definitions above let, C n (T) The probability that the counter contains n at time T. C(T) The vector [ C 1 (T), C 2 (T),...C M (T) ] M ij The probability of a transition from state i in one time period to j in the next. M The transition matrix with elements M ij A(T) The probability that the counter contains N at time T-1 and there is no arrival in time period T. R'(T) Mean carried calling rate for the first T periods. Then, C(T+1) = C(T) * M, C(n) = C(O) * M n and A(T+1) = C N (T) * P 0 for all T. For the sake of simplicity the following assumes that C(O) = 1 and C (O) = O for all other values of i. The counter ensures that up to the end of time T at most T calls will be carried. If the counter were allowed to grow without limit then the shortfall in calls carried in any realisation lie Shortfall = T Calls_Carried) would be given by COUNTER - 1. One is subtracted to take account of the incrementation at the end of time period T. In the limiting case the expected shortfall would be given by, Where C' n (T) is the appropriate counter state probability. In the finite case the probability of a shortfall of a single call being unaccounted for by the counter in the time interval T is A(T). Hence in the finite case If the counter is started at a value of i (l < i ≦ N) then the initial value of C(O) is given by C (O) = 1 and C j (O) = O for i ≠ j Equation [11] then generalises to, Then the following expression gives the expected calling rate, R'(T) = (T - EXPECTED SHORTFALL) T It is a simple matter to extend this for general m by calculating a more complex correction term A(T). When call restriction becomes implemented in the PSTN it will be possible to restrict on a Route or Destination NNG (national numbering group) basis. With the previous restriction methods this would be of doubtful utility because of the danger of blocking a significant number of potentially successful calls. The above analysis has been used to calculate performance of the algorithm and the results are now given for the simplest version of this algorithm with m = 1. It can be expected that the results will be better for suitable values of m. As can be seen in Figure 2 the algorithm comes very close to the perfect behaviour which can be characterised by, R' = R for R < 1 and R' = 1 for R = 1 or R > 1. The algorithm performs worst at R = 1 where R' = .985. For the prior art algorithm the value at R = 1 is R' = .5 Outside the range R = .95 to 1.05 the present algorithm deviates from perfect behaviour by less than one call in a thousand. The exact performance of the algorithm depends on the maximum counter size. This is shown in table 1. Table entries give the carried rates R'. MAXIMUM COUNTER SIZE OFFERED RATES .90 .95 1.0 1.05 1.1 10 .887 .923 .952 .972 .984 20 .898 .943 .975 .992 .999 30 .900 .948 .984 .997 1.000 40 .900 .949 .988 .999 1.000 This suggests the use of a value of at least 30 for the counter maximum. Tables 2 and 3 show how the initial value in the counter effects the performance of the algorithm in the short term. The counter maximum is fixed at 32. Table entries are the corresponding carried rates. COUNTER INITIALISED TO 0 OFFERED RATES .90 .95 1.0 1.05 1.1 Steady state .8999 .9481 .9845 .9978 .9998 First 100 periods .8659 .8995 .9266 .9471 .9618 First 500 periods .8919 .9340 .9655 .9831 .9907 Periods 200 - 500 .8984 .9426 .9752 .9921 .9979 COUNTER INITIALISED TO 16 OFFERED RATES .90 .95 1.0 1.05 1.1 Steady state .8999 .9481 .9845 .9978 .9998 First 100 periods .8995 .9481 .9944 1.0360 1.0709 First 500 periods .8996 .9472 .9866 1.0103 1.0202 Periods 200 - 500 .8996 .9470 .9847 1.0039 1.0073 It will be appreciated that the above described algorithm should be simple to implement on a modern software controlled digital switching system such as System X and add little to processing overheads. The performance of the algorithm is nearly ideal thus ensuring its effectiveness in practice and simplicity in use. It can be used to control an overload focussed on individual numbers without the need for careful monitoring. Indeed its performance is good enough that it can be left on permanently.

Claims: A method of controlling a focused overload in a circuit-switched communications network of interconnected digital switching systems, the focused overload being in relation to a particular type of call, the method comprising performing, at each said switching system, the method characterised by steps of: setting, for each of a succession of equal time intervals, a predetermined allowance, m, of call attempts of said particular type of call that can be made by the respective switching system; accumulating the allowance in each respective time interval with any unused allowance carried forward from the respective immediately preceding time interval; setting a predetermined value, N, for the maximum amount of accumulated allowance to be permitted; setting a predetermined value, M, for the maximum number of call attempts that can be made by the respective switching system in each time interval, M being greater than m but less than N; counting for each time interval call attempts of said particular type of call made by the respective switching system; and permitting a call attempt when the current count of call attempts in the corresponding time interval is less than M and there is unused allowance. A call traffic focused overload control subsystem where the call traffic is circuit-switched for use in circuit-switched switching systems of a communications network of interconnected digital switching systems for controlling call attempts of a particular type of call to be made by respective call processing means of said switching systems, the subsystem characterised by: clock means (10) for providing clock pulses establishing a succession of equal time intervals; presettable signal generating means (11) responsive to the clock pulses and arranged to provide for each time interval a preset signal representative of a predetermined allowance, m, of call attempts of said particular type of call that can be made, in use, by the switching system; accumulating means (12, 13; 18) responsive to said preset signals for accumulating the allowance in each respective time interval with any unused allowance carried forward from the respective immediately preceding time interval; means (18; not shown) for setting a predetermined value, N, for the maximum amount of accumulated allowance to be permitted; means (19, 20; 21) for counting for each time interval call attempts of said particular type of call made, in use, by the switching system; means (21; not shown) for setting a predetermined value, M, for the maximum number of call attempts that can be made in each time interval, M being greater than m but less than N; and means (15) for permitting, in use, the call processing means to make a call attempt when the current count of, call attempts in the corresponding time interval is less than M and there is unused allowance. A circuit-switched communications switching system for use in a communications network of interconnected circuit-switched switching systems and comprising call processing means (14) and a call traffic focused overload control subsystem for controlling call attempts to be made by said call processing means, the call attempts being in relation to a particular type of call and wherein said focused overload control subsystem is characterised by clock means (10) for providing clock pulses establishing a succession of equal time intervals; presettable signal generating means (11) responsive to the clock pulses and arranged to provide for each time interval a preset signal representative of a predetermined allowance, m, of call attempts of said particular type of call that can be made, in use, by the switching system; accumulating means (12, 13; 18) responsive to said preset signals for accumulating the allowance in each respective time interval with any unused allowance carried forward from the respective immediately preceding time interval; means (18; not shown) for setting a predetermined value, N, for the maximum amount of accumulated allowance to be permitted; means (19, 20; 21) for counting for each time interval call attempts of said particular type of call made, in use, by the switching system; means (21; not shown) for setting a predetermined value, M, for the maximum number of call attempts that can be made in each time interval, M being greater than m but less than N; and means (15) for permitting, in use, the call processing means to make a call attempt, when the current count of call attempts in the corresponding time interval is less than M and there is unused allowance.

Inventors: TURNER PETER MICHAEL DRAYER, TURNER, PETER MICHAEL DRAYER
Applicants: BRITISH TELECOMM, BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY
Application year: 1989
Main classification: H04M3
IPC codes: H04Q3, H04M3