MXPA00003013A - Method and apparatus for queuing and transmitting messages - Google Patents

Abstract

A message transmission queue (300) including a high priority queue (HPQ) (301) having a high priority entry point;a medium priority queue (MPQ) (303) having a medium priority entry point;and a low priority queue (LPQ) (305) having a low priority entry point. Messages in the MPQ (303) are queued after all messages in the HPQ (301). Messages in the LPQ (305) are queued after all messages in the MPQ (303). A sequencer reinserts messages into the queue (300) based on the message repeat count and the message's previous queue position.

Description

METHOD AND APPARATUS FOR PUTTING IN WAITING ROW AND TRANSMITTING MESSAGES Field of the Invention This invention relates to communication systems, including but not limited to in-line sequencing and transmission of messages in linked communication systems.

Background of the Invention The operation and basic structure of a land mobile communication system is well known. Mobile communication systems typically comprise one or more communication units (e.g., vehicle-mounted communication units or laptops in a land mobile system and communication units / telephone in a cellular system) and one or more relays that transmit and receive information via radio frequency communication (FR) resources. These communication resources can be channels modulated by narrow data rate, multiplexer intervals by time division, frequency pairs, and so on. The land mobile communication systems can be organized as linked communication systems, where a plurality of communication resources are assigned among a group of users by assigning the repeaters on a communication basis by communication through the FR coverage area. Typically, one or more zone controllers or other linked communication controllers, which provide similar functionality, control communications through the system by transmitting and receiving control messages with communication devices, such as site controllers or smart repeaters, to through the system. In many of today's linked communication systems, a zone controller needs to carry information to the communication units. Communications from a zone controller are transferred to one or more communication devices at each site and then transmitted over a control channel provided between the site and the communication zone. Because these messages arrive asynchronously, but are transmitted on the control channel synchronously, the messages are placed in a queue on the basis of the first in, first out (FIFO). Because all messages flow through the queue sequentially, messages are not selected for transmission on any other basis than the FIFO base. Messages may be delayed due to heavy loading, and some messages may actually be transmitted long after their utility has expired (old messages). When old messages are transmitted, the bandwidth is wasted and the transmission of useful information is further delayed. Some systems will discard messages when the waiting queue becomes long, thus compromising the reliability of the message, since discarded messages tend to be repeated messages that are established to improve reliability. In addition, many standards, such as IS-102 (APCO-25), can limit any changes to the air interface that could increase the capacity of the control channel. Accordingly, there is a need for a method for transmitting messages that provides sequencing of the control channel without compromising message reliability, wasting bandwidth, or unnecessarily delaying message transmission.

Brief Description of the Drawings FIGURE 1 is a block diagram of a linked communication system according to the invention.

FIGURE 2 is a flow chart showing a method for prioritizing messages according to the invention. FIGURE 3 is a block diagram of a queue structure according to the invention. FIGURE 4 and FIGURE 5 comprise a flowchart showing a method for removing messages from the queue for transmission and re-inserting them in the queue for retransmission according to the invention.

Description of a Preferred Modality The following describe an apparatus and a method for queuing (sequencing) and transmitting messages over a control channel without compromising the reliability of the message, wasting bandwidth or unnecessarily delaying the transmission of messages. The method uses a wait row with multiple entry points, within which are the upper part of the waiting line. When messages require multiple transmissions, they can be reinserted into the queue in many different places, including significantly different positions in the queue than those where the message was previously received. An entry point of a message in the queue is based on its priority, and the place of its reentry is based at least in part on the previous position of the message in the queue. Messages can also be processed before reinsertion in the queue. The present invention provides for the rapid transmission of the first two transmissions of limit or short message messages, because such messages need to reach their intended destination with high reliability before the deadline is reached. A method of the present invention comprises the steps of generating, by means of a call processor, a message for future transmission on at least one control channel in a communication site; set a priority based on a deadline for message transmission; establish a repeat message count based on the target audience for the message; and transporting the message, including the priority and repetition count of the message from the call processor to the communication site. The adjustment step may further comprise the steps of, when the message has a short transmission limit, set the priority as high; When the message has a large transmission deadline, set the priority as low; and when the priority of the message was not set as high and was not set as low, set the priority as average. The setting step may further comprise the steps of, when the message is directed to more than one communication device (including subscribers, registrars, comparators), setting the count of a message repetition as high; when the message is directed only to a communication unit, establish the repetition count of the message, medium; and when the message is not directed to any communication unit, it establishes the repetition count of the message as low. Another method of the present invention comprises the steps of receiving a first message, including a priority and a repetition count of the message; place the first message in a queue in one of at least two entry points to the queue, where such placement is based on the priority of the first message, and where each of the entry points corresponds to a different priority; select a second message from the top of the queue for transmission; and when the second message has not been transmitted a number of times equal to the repetition count of the message, reinsert the message in the queue at a place in the waiting queue that is the same or smaller than the position in the row of previous wait for the message. The step of reinserting the message may comprise the step of selecting an insertion point not necessarily immediately below the position in the previous queue of the message. Each message may be transmitted in one of N intervals in a table, and the selection step may further comprise the step of selecting a message different from the message in the upper part of the waiting row when the message at the top of the row The wait is the same as the message scheduled for transmission in the same frame, where N is an integer greater than 1. A waiting queue for message transmission according to the present invention comprises a high priority wait row (HPQ ) that has a high priority entry point; a middle priority wait row (MPQ) that has medium priority; where the messages in the MPQ are placed in a queue after all the messages in the HPQ; a low priority wait row (LPQ) that has a low priority entry point; where the messages in the LPQ are placed in a queue after all the messages in the MPQ; a sequencer, operably coupled to the HPQ, the MPQ and the LPQ, arranged and constructed to reinsert messages in the queue based on the repetition count of the message in the previous position of the message in the queue. The queue can be comprised of a high priority queue (HPQ) queue that has a high priority entry point and a medium priority wait queue (MPQ) that has a medium priority entry point; messages in the MPQ can be placed in a queue after all the messages in the HPQ; the reinsertion step may include the case of, when the position preceding the message in the queue was at the bottom of the HPQ, placing the message in the MPQ at a position lower than the entry point of medium priority. The waiting queue can be comprised of a high priority wait row (HPQ); where the HPQ comprises a first waiting sub-row and a second waiting sub-row, and where a message having a high priority and a repetition count of the message of at least two is placed first in the first waiting sub-row at the entry point of high priority, and the message is reinserted in the second waiting sub-row after the transmission of the first waiting sub-row. The waiting queue may be comprised of a medium priority wait row (MPQ); where the MPQ comprises a first waiting sub-row and a second waiting sub-row, and wherein a message having a medium priority and a repetition count of the message of at least two is placed in the first waiting sub-row at the entry point of medium priority, and the message is reinserted into the second waiting sub-row after the transmission of the first waiting sub-row. The wait queue can be comprised of a high priority wait row (HPQ) and a medium priority wait queue (MPQ) that has a middle priority entry point; where the MPQ is comprised of a top queue and a bottom queue; where the middle priority entry point is in the upper wait row; where messages in the bottom queue are placed in a queue after all messages in the top queue; where messages with a position in the previous queue in the HPQ and messages with a position in the previous row in the upper queue are reinserted in the lower queue after the transmission. At least some of the messages in the bottom queue can be converted to messages that are transmitted using less bandwidth than is used to transmit a message. The order in which the messages are to be transmitted from the lower wait queue of the MPQ can be arbitrary.

The queue can be comprised of a medium priority wait (MPQ) queue that has a medium priority entry point and a low priority wait (LPQ) queue that has a low priority entry point; the LPQ may be comprised of a higher wait row and a lower wait row; the low priority entry point may be in the upper wait row; messages in the bottom queue are placed in a queue after all messages in the top queue; Messages with a position in the previous queue in the MPQ can be reinserted in the lower queue after the transmission. The order in which the messages are to be transmitted from the lower wait queue of the LPQ can be arbitrary. A block diagram of a communication system in which the present invention can be implemented is shown in FIGURE 1; One or more zone controllers, or other types of system controllers or call processors, 101 transmits a message from the different sites of the system to a site controller 103, 105 and 107, which may be a stand-alone card mailbox, such such as the TETRA site controller, available from Motorola Inc., or an intelligent repeater or base station 121, such as the IntelliRepeater ™ base station available from Motorola, Inc., so that messages can be transmitted via a control channel at each site 109, 111 and 113 that service the different communication units 115, 117 and 119 through the communication system. The site controller 103 or the smart repeater 121 are intelligently coupled to one or more repeater base stations 121, including the one serving the control channel, which communicates with the communication units 115, 117 and 119. The present invention involves a message prioritization scheme that is provided by the zone controller 101 in the preferred embodiment, and a process for queuing that takes place in the repeater of the counting channel and any peripheral devices in the repeater of the control channel. Call recorders (not shown) and other peripheral devices such as call billing devices and network administrators can also be connected to the communication system either directly or via frequency connections to the radio. Although only three sites and three communication units are shown in a diagram of FIGURE 1, the present invention can be applied to a large number of sites including multi-zone systems and / or systems with multiple call processors. A method for generating messages from the output control channel is shown in the flow diagram of FIGURE 1. In step 201, a message is generated for its future transmission on at least one control channel at a communication site. Next, a priority is set for this message. In step 203, it is determined if there is a short transmission deadline for the message. For example, if there is a first response to a request, there will be a very short transmission deadline for removing the message from the requesting communication unit 115 before the timer to reach the end of the delay interval of the requesting communication unit 115 deduce the requesting communication unit 115 to make another request. In this case, the priority is set as high in step 205, and the process continues with step 213. If the priority does not have a short transmission deadline step 203, the process continues with step 207, where it is determined if the message is intended to be for a device with a large transmission deadline. There may be a large transmission deadline, for example, when the output control channel message is a message only for logging purposes, such as a message intended to be only for a logging function. In that case, the priority of the message is set as low step 209, and the process continues in step 213. The length of a short transmission deadline is several hundred milliseconds, and the length of a large or long transmission limit is of several seconds in the preferred mode. Other times can be used successfully, and the conditions of each system can be designed. If the message has a large or long transmission deadline in step 207, the priority is then set as an average in step 211. The priority for the transmission deadline allows prioritization based on many different factors, including how critical is the time of the message, the type of message (session or acknowledgment) whether or not the message is about an emergency, and so on. A reliability factor is then established for the message. In the preferred embodiment, the reliability factor is a repetition count of the message that is set by the zone controller or the call processor for each message. The repetition count of the message indicates the number of times the message will be transmitted before it is removed from the queue. In step 213, it is determined if it is required to increase the reliability of the message. An increase in reliability in the preferred embodiment includes the situation when the message is addressed to many communication devices, communication devices which include subscriber unit, such as recorders, comparators, laptops and mobiles, and so on. The highest reliability can take into account emergency calls or special calls, such as an emergency situation that needs to keep many different users in close contact, for example, an air crash with a bombing incident. If greater reliability is required in step 213, then the reliability for the message to be set as high in step 215, and in the preferred embodiment, the repetition count of the message is set to a high value. If greater reliability is not required, the process continues with step 217, where it is determined if less reliability is required. If low reliability is acceptable for this message, then the reliability of this message is set as low in step 219, resulting in a low message repetition count in the preferred embodiment. In the preferred embodiment, when the message is not addressed to any communication unit, for example, when the message is addressed only to a call recorder, the reliability, and consequently the repetition count of the message, can be established with a value low. When low reliability is not acceptable for the message in step 217, reliability is set as an average in step 221, resulting in a repeat count of the average message in the preferred mode. The average reliability would be acceptable, for example, when the message is only directed to a communication unit. In the preferred embodiment, a high value equals three repetitions, a mean value equals two repetitions, and a low value equals a repetition. The process then proceeds to step 223, where the message is carried in the call processor 101 to the communication site 109 including the priority in the repetition count of the message with the message. A block diagram of a wait queue, or queue structure 300, is shown in FIGURE 3. In the preferred embodiment, the queue 300 is comprised of a high priority wait row (HPQ) 301, a medium priority wait row (MPQ) 303, and a low priority wait row (LPQ) 305. Messages are initially entered into the queue in either the HPQ 301, MPQ 303, or LPQ 305 over the basis of message priority, whether at the high priority entry point, the medium priority entry point, or the low priority entry point, respectively. The messages are reintroduced in the queue, based on the least partial priority, until the message has been transmitted a number of times equal to the repetition count of the message. The wait-row diagram also shows how messages are entered in the queue and sent between waiting rows (reinserted) so that the messages are sequences for transmission over the control channel taking into account the priority and the number of repetitions of each message. In the preferred embodiment, the HPQ 301 is comprised of two standby sub-lines. The HPQ 301 generally empties quickly because it is used to transmit high priority messages as quickly as possible without overwhelming the rest of the messages that need to be transmitted in the system. The high priority entry point for the HPQ 301 is in the first waiting sub-row 307, and all the messages entering the queue 300 that have a high priority are placed in the waiting queue # 1 307 in the high priority entry point. If the repetition count of the message has not been satisfied for a message after being withdrawn from queue # 1 307 and transmitted, that message then goes immediately to queue # 2 309, so that the messages of high priority and unless the first repetition of such a message is quickly transported to the desired end user. Any message that still requires an additional repetition after being transmitted from the wait queue # 2 is then placed in the MPQ 303. The MPQ 303 is comprised of one upper queue 311 and a lower queue 313. middle priority entry, the place in the waiting queue where the messages that have a medium priority are first entered in the waiting queue, is in the upper waiting queue 311. The upper waiting queue is comprised of two waiting sub-lines 315 and 317, in a queue structure similar to that of HPQ 301. A medium priority message is transmitted once from queue # 3 315, and if a repetition is required, it is placed in the queue # 4 317, and if an additional repetition is required, the message is then placed in the wait queue inferring 313 from the MPQ 303. After all messages are transmitted from the upper queue 313 of the MPQ 303, the messages are ento Transmitted numbers from the lower wait queue 313 of the MPQ 303. In the preferred embodiment, the messages may be processed after entering the lower queue 313 before being removed from the queue for transmission. Messages from the HPQ 301 and the upper wait queue 311 of the MPQ 303 enter the lower wait queue 313 of the MPQ 303. In the preferred mode, the messages from the waiting queue # 2 309 are entered into the block. 319. In the preferred embodiment, process block 319 converts sessions into updates. The conversion of sessions into updates includes processing certain information, for example individual identifications, so that the remaining update can be transmitted using less bandwidth than the original message. In the preferred mode, an update consumes half the bandwidth of a session for transmission. Another processing that may be performed in the processing block 319 may include compression of the message, concatenation of the message and bifurcation of the message, and other messages other than the sessions which may also be processed as desired. In the preferred embodiment, messages that are not sessions pass through process block 319 to queue # 5 321.

Any of the updates or other messages from the process block 319 are placed in the wait queue # 5 321. Similarly, queue messages # 4 317 are fed to a process block 323 that provides a similar function to that of the process block 319. In the preferred embodiment, the sessions are converted to updates by the process block 323, and the output of the process block 323 is fed to the row # 6 325. If some messages require additional repetitions after of the transmission of queue # 5 (actually taken from queue # 5 by the arbitrage block 327 for queue # 5 and queue # 6 for transmission), are fed into the queue Waiting time # 6 of MPQ 305 (waiting line # 8 in the preferred mode). Similarly, after the messages are transmitted from queue # 6 325 (actually taken from queue # 6 by arbitrary block 327 for queue # 5 and wait queue # 6 for the transmission), they are placed in the LPQ 305 (waiting line # 7 or waiting line # 8 in the preferred mode). The arbitration block 327 for the waiting queue # 5 and the waiting queue # 6 'determines which messages will be removed after the lower queue 313 and sent for transmission as the output of the lower queue 313. In this way, the lower wait queue 313 of the MPQ 303 has only one exit point in the preferred embodiment, although multiple exit points can also be implemented successfully. The LPQ 305 is comprised of an upper wait row 329 and a lower wait row 331. The low priority entry point, instead of the waiting queue where the messages having a low priority are first entered into a row of wait, is in the upper wait row 329. In the preferred embodiment, the upper wait row 329 is comprised of a process block 333 that periodically generates status messages, such as adjacent site information, network status, status of the radio frequency subsystem and ID (identification) of the site, at the low priority entry point. Messages from the low priority entry point enter the waiting queue # 7 335 and are sent for transmission where there are no messages for the transmission waiting in queue # 1 to queue # 6, inclusive. If a message requires a replay after queue # 7 335, it is placed back in queue # 7 335. The queue below queue # 5 331 of LPQ 305 includes queue # 8 337 and the wait row # 9 331, whose messages are arbitrated by the referee 341 to determine which output of the lower wait row 331 is provided as output from the waiting queue of the lower wait row 331 of the LPQ 305. The entries from queue # 8 in the preferred mode come from queue # 5 321 and queue # 6 325 after those messages are transmitted from those queues. In the preferred mode, the session goes from queue # 5 321 to queue # 8 337, and all other messages go to queue # 6 325. In the preferred mode, queue # 337 typically includes ongoing sessions, while queue # 9 339 includes continuous status messages, such as adjacent site status transmissions, network status, radio frequency subsystem status, and site ID. The arbitration block 341 in the preferred mode arbitrates between the sending of status and update messages. A method for selecting, or removing messages from queue 300 for transmission and re-inserting them in queue 300 for retransmission is shown in the flow chart of FIGURE 4 and FIGURE 5. If in step 401 queue # 1 307 is not empty, the process continues with step 403 where a message is removed from queue # 1 307 for transmission. In step 405, the repetition count for this message decreases by one and the process continues with step 407. If in step 407 the repetition count is equal to zero the process proceeds to step 411 otherwise the process proceeds to step 409 , where the message is inserted in the wait queue # 2 309. In step 411, it is determined if the message is old, that is, it is determined whether the message can still serve any purpose for which it was transmitted. For example, if the message of the transmission deadline for the message expired, the message would be considered old because its transmission would not serve it for useful purposes and serve it to waste bandwidth, consequently the serial number discarded at 413 and the process to continue with step 401. If the message is not old in step 411, the message that was removed from queue 300 is transmitted in step 415, and the process continues with step 417. In step 417, when an interval for transmission is available, the process proceeds to step 401, otherwise the process proceeds to step 417. If in step 401 the wait queue # 1 307 is empty, the process continues with step 419 , where it is determined whether queue # 2 30 is empty. If queue # 2 309 is not empty, the process continues with step 421, where a message is removed from queue # 2 309 for transmission. In step 423, the repetition count for the message decreases, and in step 425, if the repetition count is zero, the process proceeds to step 411, otherwise the process proceeds to step 427. If the step 427 the message is not a session, the message is inserted in the wait queue # 5 321 in step 429. If the message is a session in step 427, the message is converted into an update in step 431 and also is inserted into queue # 5 321, and the process continues with step 411. A description of how a message is converted into an update is found with respect to process block 419 of FIGURE 3. If in step 419 , wait row # 2 309 is empty, the process continues with step 433, where it is determined whether queue # 3 315 is empty. If queue # 3 315 is not empty, a message is removed from queue # 3 315 for transmission in step 435. The repetition count for this message decreases in step 437, and if the count of repetition is equal to zero in step 439, the process proceeds to step 411, otherwise the process proceeds to step 441, where the message is inserted into the wait row # 4 317. If in step 443, the Wait row # 3 315 is empty, the process continues with step 443, where it is determined whether queue # 4 317 is empty. If queue # 4 317 is not empty, a message is removed from queue # 4 317 in step 445 for transmission, the repetition count for this message decreases by one in step 447, and in the step 449, it is determined if the repetition count for this message is zero. If the repetition count is zero, the process proceeds to step 411, otherwise the process proceeds to step 451, where it is determined whether the message is a session. Step 451 is similar to step 427. If the message is not granted in step 451, the message is inserted into the wait queue # 3 325 in step 453. If the message is a session in step 451, the session is converted to an update, as described with respect to the process block 319 of FIGURE 3, the message is inserted into the wait queue # 6 325, and the process proceeds to step 411. If in step 443, the Wait row # 4 317 is empty, the process continues with step 501 of FIGURE 5. If the wait row # 5 321 is not empty in step 501, the process continues with step 503, where a message is removed from wait queue # 5 321 for the transmission in step 503. If in step 505, the message is an update, the process continues with step 513, otherwise the process continues with step 507. In step 507, the repetition count decreases, and in step 509, if the repetition count is equal to zero, the process continues with step 415 of FIGURE 4. , otherwise the process continues with step 511, where the message is inserted in the wait row # 6 325, and the process continues with step 415 of FIGURE 4. If the message is an update in step 505, the process continues with step 315, where the message is inserted in the wait queue # 8 337, and the process continues with step 515. In the preferred mode, an update consumes half the time / bandwidth to transmit with a regular message, and the messages are transmitted in fixed length intervals. For the efficient use of the control channel, in the preferred embodiment, two messages are transmitted with the size of a half interval over an interval, in this way, when the message of the middle of one interval is put in the waiting queue, another Half interval message is reached to fill the other half of the interval. Such a message can be found either in the waiting queue # 5 321, the waiting queue # 6 325 or the waiting queue # 8 337, thus these three waiting queues will be searched to find a message from the middle of a queue. interval. Steps 515, 517, 519, 521, 523, 525 and 527 include the search process for a half-interval message. In step 515, if there is an update available for the transmission in the wait queue # 5 321, that update is removed and inserted in the waiting queue # 8 337 in step 519, and the process continues with step 415 of FIGURE 4. If there is no update in queue # 5 321 in step 515, then it is determined if there is an update in queue # 6 325 in step 521. I there is an update in the queue # 6 325, the process continues with step 523, where an update is removed and placed for transmission in step 523, and the wait row update # 6 325 is then inserted into the wait queue # 8 337 in step 519 and the process continues with step 415 of FIGURE 4. If there is no update in wait row # 6 325 in step 521, the process proceeds to step 525 where it is determined whether an update is available. the waiting line # 8 337. If there is an update available on to wait queue # 8 337, that update is removed for transmission in step 527 and inserted into queue # 8 337 in step 319, and the process continues with step 415 of FIGURE 4. If it does not exist update in queue # 8 337 in step 525, the process continues with step 415 of FIGURE 4. If in step 501 queue # 5 321 is empty, the process continues with step 52, where it is determined if the wait row # 6 325 is empty. If queue # 6 325 nozzle is empty, a message is removed from queue # 6 325 for transmission in step 531, and the process proceeds to step 533. If in step 533 the message of the wait row # 6 325 is an update, the process continues with step 513, otherwise the process continues with step 539. If in step 529, wait row # 6 325 is empty, the process continues with the step 535, where it is determined if the wait row # 7 335 is empty. If queue # 7 335 is not empty, then a message is removed from queue # 7 335 in step 537 for transmission, and the process proceeds to step 539. In step 539, the count of repetition for the message decreases, if in step 541 the repetition count is equal to zero, the process continues with step 415 of FIGURE 4, otherwise if the repetition count is not zero then the message is inserted into the wait row # 7 335 in step 543, and the process continues with step 415 of FIGURE 4. If in step 535 the wait row # 7 335 is empty, the process continues with step 545, where it is determined if the wait row # 8 337 is empty. If the wait row # 8 337 is not empty, the process continues with step 547, and if the wait row # 8 337 is empty the process continues with step 557, where the messages in the waiting queue # 9 339 They are handled. If in step 547, you want to send a status message, the process continues with step 557. The messages are selected between the wait queue # 8 337 and the wait queue # 9 339 based on how many messages are in each waiting queue and how often those messages need to be transmitted. If you do not want to send a status at this time, the process continues with step 549, where a message is removed from the waiting queue # 8 337 for the transmission and inserted into the waiting queue # 8 337 of step 551. to that in the preferred embodiment, the messages in the waiting queue # 8 are messages with a half-interval size, a second message is removed from the waiting queue # 8 337 in step 553 for the transmission to fill the interval and the message is inserted into the waiting queue # 8 337 in step 555, therefore two middle interval messages are passed from the waiting queue # 8 337 for the transmission in step 415 of FIGURE 4. If the row wait # 8 337 is empty in step 545 or there is a status message to be sent in 547 the process continues with step 557, or a message is removed from queue # 9 339 for transmission, the messages inserted in the waiting line # 9 339, the messages are inserted in the waiting line # 9 339 new at step 559, and the process continues with step 415 of FIGURE 4, where the messages are then transmitted. Although the preferred modality decreases the count of number of repetitions, using a growing counter until the number of repetitions serves the same purpose, or any other method of counting the number of times the message is repeated also serve it for the same function . The flow chart of FIGURES 4 and 5 was used in conjunction with the flow chart of FIGURE 3 with respect to the references of the wait-row numbers, for example, wait row # 1 refers to the row wait # 1 307, queue # 2 refers to queue # 2 309, and so on. In the preferred embodiment, the messages are transmitted in a single interval of a table comprised of three intervals. A feature of the preferred embodiment includes preventing a message and one of its repetitions from being transmitted in the same frame. This feature is implemented in the removal steps 403, 421, 435, 445, 503, 517, 523, 527, 531, 537, 549, 553 and 557. The advantage of the queue structure can also be gained if the Messages are not transmitted in a box or if the messages are all of a different size or multiple sizes. Putting in a queue messages messages based on priority as opposed to previous techniques, and messages that are transmitted with critical time release are quickly placed in a queue and transmitted, and are not subject to delay or messages of low priority simply because the low priority messages were placed at the beginning of the v queue. No bandwidth is wasted and important responses are not delayed, and as a result, reliability is less likely to be traded for performance. When the zone controller creates output messages for the control channel and sends them to the site where sequencing decisions are made, the site does not know the state of the system, and thus can not make intelligent decisions about which messages should be sent , at what time. By making the zone controller prioritize messages, the smarter decisions lead to a flexible architecture that allows for more complex functionality to be added, providing higher performance to handle higher than expected traffic loads, for example, for APCO-25 systems and provide a variable amount of packet repetitions, so that the reliability of the message can be flexible and comparable with the requirements in real time, as provided by the present invention. The present invention also makes the site design simpler, and therefore provides a mechanism to terminate the immediacy of the output messages and the communication of this information to the message sequencer to a communication site results in a system with a Therefore, it works with the maximized total system, thus supporting more traffic channels with each control channel. A variable number of packet repetitions allows the reliability of the message to be comparable to the requirements in real time. The present invention can be incorporated into other specific forms without departing from its spirit or essential characteristics. The described modalities should be considered in all aspects only illustrative and not restrictive. The scope of the invention is dictated, therefore, by the appended claims rather than by the foregoing description. All changes that fall within the meaning and range of equivalency of the claims are encompassed within its scope. It is noted that in relation to this date, the best method known to the applicant to carry out the aforementioned invention, is that which is clear from the present description of the invention.

Claims (10)

CLAIMS Having described the invention as above, the content of the following claims is claimed as property:

1. A method, characterized in that it comprises the steps of: generating, by means of a call processor, a message for its future transmission on at least one control channel in a communication site; set a priority based on a transmission deadline for the message; establish a message repetition count based on a target audience for the message; transport the message, including the priority and repetition count of the message, of the process of repetition of calls to the communication site. The method according to claim 1, characterized in that the fixing step further comprises the steps of: when the message has a short transmission limit, set the priority as high; When the message has a large transmission deadline, set the priority as low; when the priority of the message was not set as high and was not set as low, set the priority as average. 3. A method, characterized in that it comprises the steps of: receiving a first message, including a priority and a repetition count of the message; place the first message in a queue in one of at least two entry points to the queue, when the placement is based on the priority of the first message, and where each of the entry points corresponds to a different priority; select a second message from the top of the queue for transmission; When the second message has not been transmitted a number of times equal to the repetition count of the message, reinsert the message in the queue at a place in the waiting queue that is the same or smaller than the previous position of the message in the waiting line. The method according to claim 3, characterized in that each message is transmitted in one of N intervals in a frame, where the selection step further comprises the step of selecting a message different from the message of the upper part of the row of wait when the message at the top of the queue is the same as the message scheduled for transmission in the same table, where N is an integer greater than 1. 5. The method according to claim 3, characterized because the waiting queue is comprised of a high priority wait queue (HPQ) that has a high priority entry point and a medium priority wait queue (MPQ) that has a middle priority entry point; where the messages in the MPQ are placed in a queue after all the messages in the HPQ; and where the reinsertion step comprises the step of when the previous position of the message in the queue was at the bottom of the HPQ, placing the message in the MPQ at a position below the entry point of medium priority. The method according to claim 3, characterized in that the waiting queue is comprised of at least one priority wait row (PQ) having a priority entry point; where the PQ comprises a first waiting sub-row and a second waiting sub-row, and where a message having a priority and a repetition count of the message of at least two is placed first in the first waiting sub-row at the entry point of priority, and the message is reinserted in the second waiting sub-row after the transmission of the first waiting sub-row. The method according to claim 3, characterized in that the wait queue is comprised of a high priority wait row (HPQ) and a medium priority wait queue (MPQ) having an entry point of medium priority; where the MPQ is comprised of a higher wait row and a lower wait row; where the middle priority entry point is the upper wait row; where the messages in the bottom queue are placed in a queue after all messages in the top queue; where the messages with a previous position in the queue in the HPQ and the messages with a previous position in the queue in the upper queue are reinserted in the lower queue after the transmission. 8. A waiting queue for message transmission, characterized in that it comprises: a high priority wait queue (HPQ), which has a high priority entry point; a middle priority wait row (MPQ) that has a middle priority entry point; where the messages in the MPQ are placed in a queue after all the messages in the HPQ; a low priority wait row (LPQ) that has a low priority entry point; where the messages in the LPQ are placed in a queue after all the messages in the MPQ; a sequencer, operably coupled to the HPQ, the MPQ and the LPQ, arranged and constructed to reinsert messages in the queue based on the repetition count of the message and the previous position of the message in the queue. The queue for transferring messages according to claim 8, characterized in that at least one of the HPQ and the MPQ comprises a first waiting sub-row and a second waiting sub-row, and where a message having a count of repetitions of the message of at least two is placed first in the first waiting sub-row, and the message is reinserted in the second waiting sub-row after the transmission of the first waiting sub-row. The queue for transferring messages according to claim 8, characterized in that the MPQ is comprised of a higher waiting queue and a lower waiting queue; where the middle priority entry point is in the upper wait row; where messages in the bottom queue are placed in a queue after all messages in the top queue; where the messages with a previous position to the queue in the HPQ and the messages with a previous position in the queue in the upper queue are reinserted in the lower queue after the transmission.