Method and apparatus for improved call control scheduling in a distributed system with dissimilar call processors

Abstract: Prior scheduling and assignment methods stress equal utilization of each of the processors in a system. These methods tacitly assume that each of the processors of each of these systems are equal in capabilities, an assumption that neglects the fact that as newer processors are added to a system to increase capabilities, the newer processors often are faster and have greater throughput than the system's existing processors. On such a system that has diverse processors, a equal utilization scheduling and assignment method protects the slower processors from overload while under utilizing the increased capabilities of the system's newer processors. Systems with diverse processors can utilize the increased capabilities of the faster processors by a method of calculating and assigning a request for service to the fastest processor that is able to respond.

Description: Technical Field The invention relates to apparatus and method for controlling communications in a telecommunication switching system and more particularly to an apparatus and method for distributed processing control of such systems having dissimilar call processors. Description of the Prior Art A common network has application processors (APs) in which not all of the processors have the same performance characteristics and yet each of the processors processing an independent application is required to respond within a definite maximum time limit. One problem of significant interest in these systems is that of deciding which AP must be assigned to process a next call requesting service. Such situations arise in the computer and communication arena where the network owners expand their system cost effectively by adding newer, higher performance APs to meet the ever increasing customer needs for digital processing and call processing (CP) while protecting their investments in existing systems. In order to meet the growing customer CP needs cost effectively, cheaper APs featuring faster hardware, newer software, newer middleware and newest standards have historically been provided by progressing technology. For example, CP is a central function in the next generation call control systems such as system 100 and system 200 shown respectively in figures 1 and 2. In the system 100 shown in figure 1, APs 102 l -102 n are interconnected by a fast token ring 104. In the system 200 shown in figure 2 the APs 202 l -202 k are connected by ATMs 204 l -204 m . Further, each of the APs 102 l -102 n or 202 l -202 m have replicated data bases, and are functionally equipped to handle any call. The APs must respond to a CP request within a specified period to prevent the following problems: calls will not be setup or torn down as expected by the customers leading to customer dissatisfaction and some calls during busy hour may not be completed leading to loss of revenue for the service provider. The problem may also arise in automatic call distribution in a distributed call center application where the next call needs to be assigned to one of the diverse call processors that share a database (replicated or networked). Prior attempts to solve this problem were based on heuristics. For example, in the method by Warty et.al, U. S. Patent No. 4,827,499, the fraction of new load allocated to each processor was determined first by initialization parameters that were subject to modification when an AP became overloaded. System overload was recognized when the fraction of individual overloaded processors exceeded a threshold. Then the percentage of new calls rejected were gradually increased until system was no longer in overload and decreased in the same way otherwise. Cyr et al, U. S. Patent No. 4,974,256, indicate that the response time to system overload was less than optimum in this method and proposed an improvement. In this method, the fraction of new calls allocated to each AP during the next period is adjusted heuristically with a view to equalize the occupancy of all APs during that period by measuring the average utilization of each AP periodically. The scheduler reduces that fraction for APs whose occupancy exceeds the average and increases the fraction for APs whose occupancy is below the average. It uses either the average utilization of all APs or system wide loss of calls in a period to recognize system overload and prescribes a fixed percentage of calls to be shed, i.e. canceled, for a future period by all APs to get out of the perceived overload. Depending upon the chosen parameter values, the method can be either pessimistic (support less than optimal system through put) or result in potentially avoidable loss of calls during busy hours. However, these methods do not address each call request on a real time basis or deal with the response time performance capabilities of diverse APs, and have limited predictive capability to prevent disruption to existing calls. Thus, a slow AP may get overloaded, trigger shedding of a percentage of calls from all APs of the system in the next period. During busy hours, calls will be lost by such a method. Thus, there is a need in the art for a method that utilizes each AP of a system having dissimilar APs to its fullest. An article by Kyoo Jeong Lee entitled "Database Query Scheduling In Common Channel Signaling Networks" published in IEEE INFOCOM '88 Proceedings on pages 977 to 985 discusses query scheduling policies for multiple Service Control Points. This article discusses workload scheduling for Service Control Points (SCPs) with databases that are queried. US-A-5 416 833 describes an administration system for a switched telephone network which includes an attendant station for receiving service requests, a Service Order Processing system for creating and distributing for processing by downstream processing systems, and an Adjunct Processor. The Adjunct Processor processes service requests and handles as many as possible itself. If the Adjunct Processor handles the service request itself, it further dispatches updates to other parts of the network and updates its own information. An article of Koerner and Nyberg, published December 1991 in the Conference Record of IEEE Global telecommunications Conference on pages 1332-1335, entitled "Overload Control In Communications Networks", sets forth a problem of overload in a network. The article then discusses how individual processors can have overload handling algorithms and states the problem of loading of multiprocessor systems. DE-A-4 444 156 describes a method for controlling overload of distributed processors of a full electronic switching system. Each processor determines for itself whether it is overloaded during an interval and if it is overloaded then it determines to drop subsequent call attempts for a time interval. The processor determination of overload is based partially on processor utilization, queue length and delay times. Summary of the Invention A method and apparatus according to the invention are as set out in the independent claims. Preferred forms are set out in the dependent claims. Summary of the Invention The new method certainly helps processing more calls during busy hour than the AP utilization equalization method for systems with APs with different performance characteristics. Such APs are realities that our customers will be living with in order to protect their investments. With the existing methods that focus on processor occupancy equalization, faster processors will be underutilized and system capacity will suffer since it allows for the possibility of the handicap of the lowest speed AP dictate the under utilization of faster APs and forced load shed by high speed APs. In accordance with one aspect of the invention there is provided a method for directed call control scheduling in a distributed system with a plurality of application call processors which includes the steps of: determining if a call request is present and if there is not a call request present repeating this call request determining step after a short delay, otherwise continuing; determining if an application processor of the plurality of application processors has been assigned to the call request and if an application processor has been assigned to the call request then terminating the call request, updating data table entries and returning to the call request determining step otherwise continuing. The next step is using a computed response time data T(i) with data of S(i) and U(i) finding one application processor of said plurality of application processors that has a least response time T(j) to fulfill the determined call request. Then the subsequent step is determining if the least response time of the application processor T(j) is greater than τ and if T(j) is greater than τ shedding said call request and returning to the call request determining step, otherwise continuing. The next step is updating expected utilization of U(j) and assigning said call request to j-th application processor for call processing and returning to the call request determining step with the expected utilization updated. Brief Description of the Drawing FIG. 1 is a block diagram of a known system having a token ring with a number of non-homogeneous APs. FIG. 2 is a block diagram of a known system having a set of call processing APs connected by an ATM network. FIG. 3 is a block diagram of a system according to the present invention having a token ring with a number of non-homogeneous APs. FIG. 4 is a block diagram of a known system having a set of call processing APs connected by an ATM network. FIG. 5 is a flow chart for the QR method for call control scheduling. FIG. 6 is a bar chart of a comparison of utilization equalization and QR method on a simple system. Detailed Description Referring now to FIG. 3, a ring system 300, which has a number of APs 302 l -302 n , is shown in block diagram form. System 300 depicted in FIG. 3 is essentially the same as system 100 depicted in FIG. 1 except that a method QR for CP is different. QR is a an abbreviation of quick response, the reason quick response is of interest will become apparent later. A program which when executed provides the method QR for CP is stored in a memory 310 that is connected to an administrative application processor (AAP) 308. AAP 308 then executes the program to provide method QR for CP for the system 300. An alternative embodiment has a program which when executed provides the method QR that is stored in a set of memories 311 l -311 n for CP. Each of the memories 311 l -311 n is connected to a respective one of the application processors AP l -AP n . This alternative embodiment uses distributed processing among the application processors AP l -AP n to provide the method QR. The memories 311 l -311 n are shown as blocks with dashed lines around their perimeters as an indication that they represent an alternative embodiment of the system 300. Either of these embodiments will provide system 300 with the advantages of method QR for CP over the equal utilization method for CP used in the ring system 100 shown in FIG. 1. Similarly, with reference now to FIG. 4, an ATM connected system, which has a number of APs 402 l - 402 m that are used for CP for the system 400, is shown in block diagram form. System 400 depicted in FIG. 4 is essentially the same as system 200 depicted in FIG. 2 except that uses method QR for CP. A program which when executed provides the method QR for CP is stored in a set of memories 411 l -411 m for CP. Each of the memories 411 l -411 m is connected to a respective one of the application processors AP l -AP m . This embodiment uses distributed processing among the application processors AP l -AP m to provide the method QR. for system 400. This embodiment will provide system 400 with the advantages of method QR for CP over the equal utilization method for CP used in the ATM system 200 shown in FIG. 2. The method QR itself gains its advantage by using a quick response to each call processing request to either of the system 300 or 400. As an explanation of the operation of method QR, consider that {P i | i = 1, 2, 3, .. q} is a set of q APs that constitute a distributed processing system where P i denotes the i-th AP. P i has a total processing service time S i (in seconds) for a specific CP request R. The parameter q is equal to n for system 300 and m for system 400, The utilization (or occupancy) of P i is directly proportional to the number of concurrent CP control tasks it handles in a second. Associated with the request R, there is a response time cut off T r (in seconds) imposed by external considerations including customer preference. If P i fails to complete processing the request within Tq , the call is assumed to fail. Let p seconds be the mean length of a call. Typically, under normal operation, a call control assigned to a particular AP is processed by it for the entire life of p seconds of the call. Should the AP fail, the system assigns the responsibility to another AP. The purpose of method QR is to assign a call processing request as it arrives to an AP that has the highest promise of completing the task in least delay (when feasible). If U i denotes the current utilization of P i while processing C i calls per second. Note that the AP P i is a stored program computer and its response time or latency L i (in seconds) is modeled by a M/M/1 queuing model as follows. L i = S i (1 - U i ) Where, U i = C i × S i Response time of an AP is better if it is smaller, that is a given in this technology. Note that the service time for a call on an AP is a good indicator of the performance potential of the AP. The response time of an AP is a true indicator of actual performance of the AP on the job. Response time depends upon both service time and utilization as given in the latency expression above. Other things remaining the same, it must be noted that the faster the clock rate of an AP, the lesser will be the service time for a request and the smaller will be the response time for the call request (assuming same processor utilization). What is not a given in this technology is the following. Other conditions remaining the same, the AP with a faster processor with utilization U f has better response time than the AP with a slower processor with the utilization U l , U l < U f if S l (1- U l ) > S f (1- U f ) , or S l S f > (1 - U l ) (1 - U f ) Now if S l /S f were 10 (because the clock rate of the high speed processor is 10 times that of the lower speed one), even if the lower speed processor is utilized only 10% as compared to the 90% utilized high speed AP, the high speed AP gives better request response time than the lower speed one. Restated, this means that the known call distribution method that attempts to equalize utilization of all APs may provide slower response to some call requests processed by the slower AP. In the worst case, it can lead to intolerable delays at the lower speed APs during busy hours and loss of calls. In the method QR a new call request is assigned to the AP (or one of equivalent APs if there are more than one that can perform identically) that has the performance capability to respond quicker than other APs of the system 300 or 400 and completes the tasks within the deadline even if the assigned AP with the faster processor is highly utilized. Some of the advantages of method QR over the previously known methods are: 1. During low and medium load (not-busy hours), it responds predictably faster than the previously known methods. 2. During busy hours, the method QR handles more calls than the methods based on utilization equalization method. The extra number of calls that may be supported because of the method according to the present invention depends upon the system parameters. The method QR according to one embodiment of the present invention runs on AAP 308 that maintains a data structure that has relevant performance information on each AP 302 l - 302 n within the system 300. The information on each AP include its current utilization and its service time (seconds) for processing a typical CP request. The former is either monitored and collected periodically from all APs or predicted based on a performance model. The service time for a CP request on a specific AP i is a constant that includes a sum of all its time used for processing messages, accessing databases and other tasks such as call set up, tear down and other functions. The average CP service time on a specific AP i is predetermined by a one time laboratory measurement on a lightly loaded AP and it is initialized at boot-up time of the system. From these and the CP performance model, the AAP 308 predicts the response time of each of the APs 302 l -302 n as if it were to process the request and identifies the AP that promises the lowest response time for the CP request. If in the event the response time of the selected AP were beyond the acceptable threshold T seconds, the call is shed, i.e. canceled, as none of the remaining APs of the system 300 can do any better. Otherwise, the call is assigned to the selected AP and its predicted utilization is updated. The AAP 308 also maintains Lst, a list of all current assignments given by the ordered pair (call_id, AP assigned to process the call defined by call_id) being processed by the entire system 300. AAP 308 uses this list to test if a request is from a new call_id or from existing one. The other embodiment of system 300 and the system 400 operate in the same way as the embodiment of system 300 having the AAP 308, except that the call processing management and assignment functions of the AAP 308 are included and distributed among the APs 302 l -302 n for the other embodiment of system 300 and among APs 402 l -402 m for system 400. The following is a formal statement of method QR 500 (method QR is also depicted in a flowchart of figure 5) where i, j, k ,and N are all integers, T(i), U(i), S(i) are i -th entry in the respective N vectors maintained by AAP. The Method QR 500 works correctly and efficiently. The method QR 500 updates and keeps track of the utilization of each processors in vector U and the service time for all processors in vector S . Note that the expected reduction in k -th AP utilization U(k) by a completion of a call is S(k)/p where p is the mean call length in seconds. Similarly, the expected increase in j -th AP utilization U(j) by a new a call request is S(i)/p where p is the mean call length in seconds. When a new call request arrives (or a call gets completed), the number of calls per second increases (or decreases exactly by l/p. Thus method QR correctly implements the model given in the expressions for latency L i and the utilization U i presented previously dynamically on a call by call basis. Once these information are available, predicting the response time requires only a division of the service time, a known constant initialized at the boot time by (l-the utilization). All that is needed is a couple of vectors of dimension N, one for utilization and the other for service time. The list Lst needs to be of the order of the number of calls per second. Testing if a call is new will require a scan of the list Lst which can be done in constant time. The complexity of our method is O(N) and is linear in terms of the number of APs, and the method is efficient. For further advantages of the method QR, consider the following notations and definitions. The set of processors within the system are assumed to be partitioned so that each class has the same processor speed and performance characteristics. Further the classes are assumed to be ordered from 1 to k where processors in the first class are the slowest and the processors in the k-th class are the fastest and for all 0<i<k, the processors in class i+1 are faster than those in class i. The major notations used are as given in Table 1. Notations used Notation Description n i Number of processor in class i c i Call capacity of an AP in class i in number of calls per second s i Speed (performance) of a processor in class i U i Utilization of an AP in class i as a fraction. t Call service time in seconds for a fastest AP τ Response time in seconds for a fastest AP in the QR method T Response time for the slowest AP in utilization equalization method V Utilization of an AP in equalization method before loss of a call The purpose of APs in both the utilization equalization method and the method QR is to provide call processing. For analysis, it is assumed that all calls have more or less the same call control procedures. On that basis, the call distribution tree can be used to modify the model and method QR to further improve results. If an AP does other processing functions also, its performance can be de-rated to account for processing those functions. A CP scheduling method is said to fail when an AP fails to complete processing within a given dead line or time period. Note that if a processor that does call control at any time fails to respond with the right information/signals within a reasonable amount of time (that is predetermined) calls being processed by it may not be set up or torn down in time or may not be accounted for and could be dropped. In view of this, the following conclusions can be made: 1 . The utilization equalization method fails when all the utilization of all processors is V and the response time of the slowest processor exceeds T. 2 . The method QR fails when the response time of any processor exceeds τ. (and the utilization of a faster processor will always be larger than a slower one). The call capacity of an AP is given by the maximum number of calls per second the AP can concurrently handle without dropping any calls. Thus an AP that is processing number of calls per second that is less than its call capacity, can guarantee that its response time will be within the acceptable cut-off. Number of calls processed per second in Utilization Equalization Method With the utilization equalization method, the processor utilization is the same as V and it will process maximum number of calls C l in an AP that is slowest when the following is true. T l = t × s k s l 1 - C l × t × s k s l where U = C l × t × s k / s l and t is the service time for processing the call on the fastest processor. Thus C l = s l t × s k - 1 T l Since utilization of all APs in this method is U , it can be shown that for l ≤ i ≤ k the following is true: C i = s i t × s k - 1 T i Thus the total number of calls processed by the known method before any failure of a call is given by: Number of calls processed per second by the Method QR The number of calls processed by an AP in class k is determined by the following: τ = t 1 - C ' k × t and C ' k = 1 t - 1 τ . The number of calls processed by an AP in class i is given by the following equation. C ' i = s i t × s k - 1 τ . Thus the total number of calls processed by the method QR before a call failure occurs is given by: The extra number of calls per second the same system can process without failing using the method QR is given by: Note that T l = τ, because at this delay, lowest speed AP has the highest allowable delay possible in the AP utilization equalization method. However for the same utilization, in the utilization equalization method becomes: T i = T l × s l / s i = τ ×s l /s i for l≤i≤k . Thus: Clearly, C x is always a positive number whenever there are more that one classes of APs. Next, consider the following examples in view of the expressions immediately above. Example 1. Consider a situation where there are 4 APs each with 8 MIPS, and another AP with 32 MIPS. Assume 17 KBHCA (or thousands of busy hour call attempts) per 8 MIPS AP at 80% processor utilization (which is a reasonable number) and a cut off time of 0.85 seconds. In this case, C x would be 3/0.85 = 3.53 calls/second or 12.71 KBHCA. This number as a percentage of the overall capacity of (4×17 + 4×17) = 85 KBHCA is about 15%. Example 2. Consider a situation where there are 2 APs with 8 MIPS and another AP with 16 MIPS. Assume 17 KBHCA per 8 MIPS APS at 80% processor utilization and cut off time is about 1 seconds. In this case, C x would be 1×1/1 =1 calls/second or 3.6 KBHCA. As percentage this would be about 360/68= 5.3%. Note that in this case, the faster CPU belongs to the same generation as the slower one, never the less demonstrates the utility of the method QR. Example 3. Consider a situation where there are 1 AP with 8 MIPS and another with 32 MIPS. With 17K BHCA per 8 MIPS AP at 80% processor utilization and a cut off time of 1 second, C x would be 3/1=3 calls/second or 10.8 KBHCA. As percentage this would be about 1080/85= 13%. Example 4. Consider a situation where there are 1 AP with 8 MIPS and another with 80 MIPS. With 17 KBHCA per 8 MIPS AP at 80% processor utilization and a cut off time of 1 second , C x would be 9/1=9 calls/second or 32.4 KBHCA. As percentage this would be about 3240/187= 17%. It can be observed that the percentage of calls method QR can process beyond what can be achieved by the utilization equalization method depends upon the response time cut off. The smaller the response time cut off, the larger will be the percentage of extra calls the method QR will let the system 300 with diverse performance APs 310-320 handle. The extra calls successfully processed comes from faster processors that can provide acceptable response at much higher utilization than the slower processors. Figure 6 shows a comparison of the two methods on a system consisting of 2 APs one with 8 MIPS and another with 80 MIPS. The X-axis here is the delay cutoff in seconds and Y-AXIS represents the number of calls processed by the two methods. As one can see, the new method has significant advantage over the utilization equalization method particularly when the delays required are smaller which is what the customers would prefer. In summary, the method QR definitely provides greater call processing during busy hour than the AP utilization equalization method for systems with APs with different performance characteristics. Further, systems with diverse APs are realities that modern networks because such networks to protect prior equipment investments. With the existing known methods that focus on processor occupancy equalization, faster processors will be underutilized and system capacity will suffer since it allows for the possibility of the handicap of the lowest speed AP dictate the under utilization of faster APs and forced load shed by high speed APs. An implementation of the method QR is straightforward. Instead of computing the utilization of all APs, expected response time for APs needs to be computed when a new call arrives. The method QR assigns the call to an AP that has the least expected response time. The method QR will also lead to slightly faster response to CP at light and medium loads as faster APs share bulk of the calls. Method QR focuses on each call request in real time, seeks a fastest responding AP to work on it if it has a promise of completing the call successfully and turns it down if the fastest responding AP can not respond to it within the response time needed. At this instant, the system 300 or 400 is truly in an overload situation and turning the call down is unavoidable. Thus, it will now be understood that there has been disclosed a new apparatus and method for assigning one of multiple diverse application processors to process a call request. Those skilled in the art will recognize that other modifications and variations of the present invention are possible, for example, periodic updates to the CPU utilization vector by actual measured numbers from the APs could be used instead of statistical calculated utilization. Another variation would require the response time updating to be done by each AP independently and periodically share the same with the AAP. These updates can then be used to constantly validate and update the model and also in the call assignment. This approach however will incur additional communication and processing overheads at AAP and APs. With APs with high speed interconnects that have broadcasting capability, as in an OC-3 ATM interconnect or high speed token ring, this can be achieved.

Claims: A method for directed call control scheduling in a distributed system with a plurality of diverse application call processors comprising the steps of: a. determining if a call request is present and if there is not a call request present repeating step a, otherwise continuing to step b; b. determining if one of said application call processors has been assigned to the call request and if an application call processor has been assigned to the call request then continuing to step c, otherwise jumping to step d; c. terminating the call request, updating application call processor utilization data table entries and returning to step a; d. using a computed response time data T(i) for i = 1 to N for each of the 1 to N application call processors of class i with performance data of S(i) for i = 1 to N of each of the 1 to N application call processors in class i and utilization data U(i) for i = 1 to N to find one application call processor that has a minimum response time T (j) of the j-th application call processor of the plurality of application processors to fulfill the call request. e. determining if the minimum response time T(j) is greater than maximum allowable response time τ and if the minimum response time T(j) is greater than maximum allowable response time τ continuing to step f, otherwise jumping to step g; f. shedding said call request and returning to step a; and g. updating expected utilization of U(j) of the j-th application processor for call processing and assigning said call request to the j-th application processor for call processing. The method of claim 1 further comprising the step of h. returning to step a. The method of claim 1 or 2, wherein said updating of application call processor utilization table entries comprises updating entries for U(j) = U(j) - S(j)/p ; where the U(j) on the left of the equal sign is the updated utilization of the j-th application processor, the U(j) on the right of the equal sign is the utilization previous to the update. S(j) is the performance of the j-th application call processor, and p is the mean length of each call. The method of claim 1,2 or 3, wherein said computed response time T(i) for each of the N application call processors is computed by the following steps: set j equal to one; For all integer values of index i from 1 to N calculate T(i)=S(i)/(l-U(i)-S(i)/p; and If T(i)<T(j) then set j equal to 1 that value of i that makes the inequality true. The method of claim 3 wherein the updating of utilization U(j) upon call completion and call failure is according to the expression U(j)=U(j)+S(j)/p; where the U(j) on the left of the equal sign is the updated utilization of the j-th application processor, the U(j) on the right of the equal sign is the utilization previous to the update, S(j) is the performance of the j-th application call processor, and p is the mean length of each call. Apparatus for directed call control scheduling in an automatic call distribution system (300) having a plurality of diverse application call processors (302 1 - 302 n ) ; means for determining if a call request is present (302 1 - 302 n ); means for determining if one of said application call processors has been assigned to the call request and if an application processor has not been assigned to the call request (302 l - 302 n ) then using a computed response time data T(i) for i = 1 to N of N application call processors with performance data of S(i) for i = 1 to N and utilization data U(i) for i = 1 to N finding one application call processor that has a minimum response time T(j) of the j-th application call processor of the plurality of application call processors to fulfill the call request; and means for determining if the response time T(j) is greater than maximum allowable response time τ (302 l - 302 n and 311 l - 311 n ) and if the response time T(j) is greater than maximum allowable response time τ shedding said call request and if the response time T(j) is not greater than maximum allowable response time τ updating an expected utilization of U(j) of the j-th application processor for call processing and assigning said call request to the j-th application processor for call processing. The apparatus of claim 6, wherein all of the means are provided by an administrative application processor (308) executing a program that includes a method for assigning an application processor of the plurality of diverse processors that is able to respond to a call request in the fastest time. The apparatus of claim 7, wherein the administrative application processor is provided by a portion of each application processor (302 1 - 302 n ).

Inventors: BHAT KABEKODE VENKATA, BHAT, KABEKODE VENKATA
Applicants: LUCENT TECHNOLOGIES INC, LUCENT TECHNOLOGIES INC.
Application year: 1998
Main classification: H04Q3
IPC codes: G06F15, H04L12, H04M3, H04Q3