Method for More Efficient Service Request Processing

This invention relates generally to trunking communication systems and in particular to a method that allows a communication resource allocator to process substantially all the service requests received.

Trunking communication systems are known to comprise a plurality of communication units, a limited number of communication resources that are transceived via a predetermined number of repeaters, or base stations, and a communication resource allocator that allocates a limited number of communication resources among the plurality of communication units. The communication resources may comprise a TDM bus, a carrier frequency, a pair of carrier frequencies, or any RF transmission means. Of the communication resources, one is selected as the control channel to transceive operational data between the communication resource allocator and the communication units. The communication units, which may be portable radios and/or mobile radios, are arranged into talk groups by commonality of use. For example, a talk group may comprise communications that are operated by a police department while another talk group comprises communication units operated by a fire department.

In a typically trunking communication system, the communication units transmit service request to the communication resource allocator. The service request may comprise requesting allocation of a communication resource, a change in the communication units parameters, etc. The communication allocator receives these service requests and responds to them typically in a first in first out fashion. As each service request is received, it is either processed or placed in a service request waiting queue within the communication resource allocator. When the trunking communication system is very busy, the communication resource allocator may be processing service requests at a maximum rate and yet the service request queue becomes full. Under these circumstances, service requests that are transmitted after the service request queue is full are ignored. Therefore, a need exists for a method that will allow the communication resource allocator to substantially respond to all service requests.

This need and others are substantially met by the method for more efficient service request processing disclosed herein. In a trunking communication system that comprises a plurality of communication units a limited number of communication resources that are transceived via a predetermined number of repeaters, and a communication resource allocator that allocates the limited number of communication resources among the plurality of communication units based upon service requests by the communication units and wherein the communication resource allocator receives more service requests than it can process such that at least some of the service requests are not being processed, the following describes a method that allows the communication resource allocator to process substantially all the service requests received. As a communication resource allocator receives service request, it determines whether the service requests received can be processed within a predetermined period of time. If the service request cannot be processed within the predetermined period time, the communication resource allocator generates a global system busy signal that indicates that it cannot individually process or acknowledge the service request received and will temporarily not process non-priority service requests. The communication resource allocator then transmits the global system busy to the communication units. The communication units process the system busy signal such that they will not transmit non-priority service requests for the duration of the global system busy signal. While the global system busy signal is active, the communication resource allocator processes the service requests that have been received and processes any service request having a priority level. The communication resource allocator will transmit a global system non-busy signal when the processing time is below at least a portion of the predetermined period of time.

FIG. 1 illustrates a trunked communication system that may incorporate the present invention.

FIG. 2 illustrates a logic diagram of an implementation of the present invention.

FIG. 1 illustrates a trunking communication system comprising a communication resource allocator 101, a plurality of communication units (four shown) 102-105, a limited number of communication resources 106, and a limited number of repeaters 107. Each of the communication units 102-105, comprise at least one microprocessor 108 and a digital storage memory device 109 which may be RAM, ROM or any other type of means for storing digital information. The communication resource allocator 101 comprises at least one microprocessor 110 and digital memory 111, wherein the digital memory may be RAM, ROM, or any other type of means for storing digital information. Each of the communication resources 106 are transceived between the communication units 102-105 and the communication resource allocator 101 via the repeaters 107, wherein the repeaters may comprise base stations. One of the communication resources 106 is selected as the control channel which transceives trunking communication system control data between the communication resource allocator and the communication units 102-105.

To initiate a service request, a communication unit transmits an inbound signalling word (ISW) to the communication resource allocator, wherein the ISW contains a request to perform a system service. A system service may be a request for an allocation of communication resource, a transmission of data to the communication resource allocator, telephone interconnect, or any other service the communication system can support. Once the communication resource allocator receives the service request, it processes the request on a first come first served basis with exceptions for priority requests.

As discussed in the background section, when the communication system becomes very busy, i.e. a substantial number of communication units are requesting service, the communication resource allocator can become overloaded. Communication resource allocator overload results when the communication resource allocator's service request queue is full and ignores requests that are subsequently transmitted. Overloading can be substantially avoided by the process illustrated in FIG. 2 which allows the communication resource allocator to limit the types of services it will process when the communication system becomes very busy.

At step 201m the communication resource allocator receives a service request from at least one communication unit. The communication resource allocator determines whether it can process all the received service requests in a predetermined period of time 202. The communication resource allocator stores, in memory, the execution time it takes to perform each type of service request, which is known in the art. Thus, the communication resource allocator can calculate the processing time for the received service requests. The predetermined time may vary depending on system needs. For example, the predetermined period of time may be as small as a few hundred milliseconds or as great as 10 seconds.

If the communication resource allocator can process all the received service requests in the predetermined period of time 202, the communication resource allocator continues to process and receive new service requests 203. If, however, the communication resource allocator cannot process all the received service requests in the predetermined period of time 202, the communication resource allocator generates a global system busy signal and transmits it to the communication units 204. The communication resource allocator then processes the received service requests it has stored and any incoming service requests that have a priority level 205. In the alternative to processing the service requests in the service request queue, the communication resource allocator may replace service request acknowledgements that were transmitted before the global system busy signal was generated with a global system busy signal. A priority level service request may be dependent on the situation, such as an emergency, or dependent upon the user, such as a police, chief.

While processing the service request that it has stored and any incoming priority service requests, the communication resource allocator also monitors to see whether it receives any nonpriority service request 206. If the communication resource allocator receives a nonpriority service request from a communication unit, it transmits an individual system busy signal to that unit and updates an internal data base to indicate that this particular communication unit cannot process global system busy signals 207. The data base within the communication resource allocator can be any form of memory device that allows digital information to be stored such as a RAM or magnetic tape.

In addition to monitoring for nonpriority service requests, the communication resource allocator monitors the execution time and estimated execution time of the service requests stored to determine whether the processing time has dropped below a predetermined value 208. If the processing time has not dropped below the predetermined value 208, the process repeats at step 205. If the processing time has dropped below the predetermined value 208, the communication resource allocator generates a global system nonbusy signal and transmits it to the communication units 209. This would then complete the algorithm for this particular overload situation of the communication resource allocator. The predetermined value of step 208 may comprises a portion of the predetermined period of time of step 202. For example, if the predetermined period of time for step 202 is one second, the predetermined value of step 208 may be 500 milliseconds.

By incorporating the above process in to a trunking communication system, all service requests will be responded to and not ignored as in prior art systems. In addition to responding to all service requests, the present invention may be easily retrofitted in to existing trunking communication systems by programming the respective portions of the present process in to existing microprocessors of the communication resource allocator and the communication units. However, some communication units and communication resource allocators may require additional microprocessing to perform the present invention.