EP0382035A2 - Dual dynamic priority control in a selective call system - Google Patents

Dual dynamic priority control in a selective call system Download PDF

Info

Publication number
EP0382035A2
EP0382035A2 EP90101684A EP90101684A EP0382035A2 EP 0382035 A2 EP0382035 A2 EP 0382035A2 EP 90101684 A EP90101684 A EP 90101684A EP 90101684 A EP90101684 A EP 90101684A EP 0382035 A2 EP0382035 A2 EP 0382035A2
Authority
EP
European Patent Office
Prior art keywords
call
priority
calls
receiver
source
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP90101684A
Other languages
German (de)
French (fr)
Other versions
EP0382035A3 (en
EP0382035B1 (en
Inventor
Robert Louis Breeden
John Hollmer Kinney, Jr.
Douglas Edward Griffin
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Motorola Solutions Inc
Original Assignee
Motorola Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Motorola Inc filed Critical Motorola Inc
Publication of EP0382035A2 publication Critical patent/EP0382035A2/en
Publication of EP0382035A3 publication Critical patent/EP0382035A3/en
Application granted granted Critical
Publication of EP0382035B1 publication Critical patent/EP0382035B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W88/00Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/18Service support devices; Network management devices
    • H04W88/185Selective call encoders for paging networks, e.g. paging centre devices

Definitions

  • This invention relates generally to the field of selective call control centers for transmission of calls to selective call receivers, such as paging receivers and more particularly to determining the order of transmission of calls to the receivers and/or determining which address within a receiver is to be called.
  • control centers of paging systems administer a queue of calls for transmission, by storing each call in memory, and transmitting the calls, often on a first-in, first-out basis.
  • Priority is a concept used in paging control centers, or terminals, to alter the processing of selected calls, primarily in regard to their insertion into an output queue. Specifically, calls assigned a priority higher than that of other calls waiting for output are given advanced placement in the output queue, so that they will be transmitted sooner than calls assigned lower priority.
  • a paging control center 10 three paging inputs in the form of telephones 11, 12 and 13, and three pagers 14, 15 and 16.
  • each of the pagers 14, 15 and 16 is assigned a priority level, and these levels are stored in a memory in the paging control center 10.
  • the control center 10 is aware of the priority of that address, and determines the order of transmission of calls accordingly.
  • one of the telephones 11, 12 and 13 is designated as a "code blue" telephone, i.e. if a call is placed via that telephone (e.g. telephone 11), such a call is immediately given pre­emptive status, whereby any existing call in progress is interrupted and the code blue call is immediately transmitted.
  • code blue i.e. if a call is placed via that telephone (e.g. telephone 11)
  • This system is useful where the code blue telephone is assigned for emergency use.
  • the invention provides a method and apparatus for assigning priorities to calls received by a selective call control center.
  • Call sources are provided having different assigned priorities
  • call receivers are provided having different assigned priorities. The order of transmission of calls from the call sources to be transmitted to the
  • Figure 6 is a flow diagram of the priority determination operation.
  • three queues established by a microprocessor in the control center 10 are shown as blocks 17, 18 and 19.
  • the blocks represent locations in memory (described below) within the control center, in which identification codes of different calls may be stored on a first-in, first-out basis. Sufficient memory is set aside for each block so as to ensure that each block is notationally endless.
  • Identification codes for different calls are represented as a1, b1, c1 etc.
  • call a1 has been transmitted, the code a1 will be deleted from queue 17, and call b1 will be the next to be transmitted.
  • Call b1 will be followed by calls b2 and b3, and provided no other calls have arrived in the meantime, call c1 will be the next to be transmitted after call b3, followed by calls c2-c5.
  • its identification code is assigned to the appropriate queue in accordance with the priority allocated to it. If a priority 2 call arrives its code will be added to the end of queue 18. From queue 18, it will be transmitted in advance of any remaining calls in queue 19. Likewise, if a priority 1 call arrives any priority 2 or 3 call currently being transmitted will be interrupted, queues 18 and 19 will remain unchanged, and the priority 1 call, which is immediately added to queue 17 is immediately transmitted.
  • each of the input devices shown in Figure 1 as telephones 11, 12 and 13, is assigned a priority level (Ps).
  • Ps priority level
  • the system may be arranged in a hospital, where telephone 11 is an emergency "code blue" telephone for use only for calling a cardiac arrest team, while telephone 12 (and other telephones of similar priority) is assigned to a doctor or head of nursing staff and telephone 13 (and other telephones of similar priority) is assigned for general use.
  • Each of the pagers 14, 15 and 16 has two addresses. By paging the first address, the addressed pager responds with a loud audible tone, while by paging the second address, the pager responds by a silent vibration. It will be understood that the responses of the separate addresses may take a number of forms, including different volumes of tone, different combinations of tone and/or visible indicators, or different mode of operation, such as variable volume alert and fixed volume alert. There may be more addresses for each pager, typically up to eight.
  • each of the pagers has an assigned priority level (Pr).
  • Pr priority level
  • address A of a pager 14 has priority 1
  • address B has priority 2
  • pager 15 has priority 3
  • Other pagers not shown have priority 3.
  • the operators of pagers 14 and 15 may have special duties as members of a cardiac arrest team, while at the same time they operate as members of the hospital having non-­particular duties.
  • Pager 16 is an operator having non-­particular duties (not being a member of the cardiac arrest team), and there are other operators of pagers of lower rank.
  • the operators of pagers 14, 15 and 16 may, for example, be doctors and nurses, while the operators of other pagers are orderlies.
  • the operation of the system is as follows. In the event that there is a cardiac arrest in the hospital, a member of staff places a call through telephone 11, and this has the effect of immediately pre-empting any existing calls being transmitted, and pagers 14 and 15 are paged via their A addresses. In so paging these pagers via their A addresses, those pagers issue an audible tone which the operators of the pagers cannot disable in advance.
  • the system may be configured such that telephone 11 is dedicated only to page those addresses as a group. Thus, telephone 11 may be unable to page pager 16, or other pagers. As an alternative, telephone 11 may be configured to address pager 16 by dialing the appropriate number, and by virtue of the fact that the call has been placed via telephone 11, the call is immediately given pre-emptive status.
  • FIG 3 the three input telephones 11, 12 and 13 of Figure 1 are shown. These telephones are connected to telephone inputs of DTMF decoder and supervisor 20.
  • a data bus 21 connects the decoder and supervisor 20 to a microprocessor 22. Included in the data bus 21 are source identifier lines 23 which identify the input of the decoder and supervisor to which a particular telephone making a call is connected. Also included in the data bus 21 are destination receiver identifier lines 24, which identify the telephone number being dialed. It will be understood that one of the telephones, e.g., telephone 11, can be dedicated to dial a particular number, this number being stored in decoder and supervisor 20 and being sent on data lines 24 automatically upon use of telephone 11.
  • microprocessor 22 Connected with microprocessor 22 is a read only memory 25, which is preferably an EEPROM.
  • This EEPROM contain a look-up table, which will be described in more detail with reference to Figure 4.
  • Microprocessor 22 provides an output on data bus 27 to a transmit controller and paging encoder 28, which in turn passes information on data bus 29 to a transmitter 30.
  • the transmitter controller and paging decoder also controls transmitter 30 by an on/off control line 31.
  • a user makes a paging call by picking up one of the telephones, e.g. telephone 12 and dialing a 3-digit number identifying that a call is to be made.
  • the user hears a prerecorded message provided by decoder and supervisor 20, telling the user to dial the number of the pager to which the page is to be transmitted.
  • decoder and supervisor 20 telling the user to dial the number of the pager to which the page is to be transmitted.
  • a number of further features may be possible, including providing a voice message, keying in an alphanumeric message into a keyboard (not shown) and/or dialing in a call-back number, e.g. through a touch-tone pad, for the person being paged to call back.
  • the decoder and supervisor 20 identifies the telephone input being operated from the hardwired connection to the decoder and supervisor 20, and it passes this information, together with the three digit number paged, on data lines 23 and 24 any other information provided (message, voice etc.) is also passed on data bus 21.
  • the microprocessor 22 receives this information and performs the following operations. If the call is identified as coming from telephone 11, then the microprocessor performs a look-up operation in the table of Figure 4A and determines that pagers 14 and 15 are to be paged as a cardiac arrest team on their A addresses. The call is treated as a priority 1 call. If the call originates from any other source, the microprocessor 22 determines that only the pager identified by the user originating the call is to be paged ad a look-up operation is made on the look-up table of Figure 4B. All this information is contained in EEPROM 25.
  • a number defining pager 15 for example is input and the table identifies that the priority of pager 15 is priority 2.
  • the table also provides the actual address that the transmitter 30 has transmit to reach that pager on address B. This address is given in the right-hand column. It will be understood that this address could include post-digit addressing, wherein a code is included in the header information at the start of a call/page, that code determining the function that the pager is to perform, e.g. in terms of the type of alarm response.
  • FIG. 5 shows a flow diagram of the overall queue management performed by microprocessor 22.
  • the uppermost priority call in this case call a1 is transmitted first, as represented by step 51.
  • step 52 is executed in that the queues are updated by deleting code a1 from queue 17.
  • step 53 if there are more calls still queuing the program returns to point X, and the next call in the queue is transmitted as represented by step 51. In this case, there are indeed more call queuing, and the next call to be transmitted is call b1.
  • steps 51, 52 and 53 are repeated until all the queues 17-19 are vacant.
  • the program passes from step 53 to step 54, and the system waits for the next incoming call from input devices 11-13 etc.
  • FIG 6 illustrates the operation of microprocessor 22 on receipt of a new call.
  • the program of Figure 5 is interrupted, as represented by step 61, whenever a new call is received from one of the input devices and the identification code of the new call is placed in the correct queue, as represented by step 62.
  • step 62 comprises a number of smaller steps, in which the priority of the call source (Ps) associated with the source 11, 12, or 13 is compared with the priority of the call destination receiver (Pr) i.e. the priority of pager 14, 15, 16. If the priority (Ps) of the source is greater (numerically lower), then the priority P assigned to that call is made equal to Ps (step 64).
  • the priority of the call receiver (Pr) is greater than that of call source (Ps) then the priority of the call (P) is made equal to Pr (step 65). Based on the priority P of the call, that call is assigned to the appropriate queue and a queue counter Np of that queue is incriminated (step 66).
  • step 67 in which the queue counter of the priority 1 queue i.e. N1, is tested. If N1 is greater than or equal to 1, then the program of Figure 5 is reset to point X. The reason for this test is to ascertain whether a pre-emptive priority call is to be made (a code blue call), and if so, to interrupt the transmission of the current call, and immediately transmit the priority 1 call by resetting the program to step 51, at which point the program recognizes the priority 1 call as being the next call in the queues.
  • a pre-emptive priority call a code blue call
  • step 67 or 68 Upon completion of step 67 or 68, as the case may be, the program of Figure 6 is exited at step 69, and the program of Figure 5 resumes normal operation, with the new call having been assigned to its appropriate queue. From Figure 6, it can be seen that the priority of a call is made equal to the greater of the priority of the source and the priority of the call receiver or destination.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Telephonic Communication Services (AREA)
  • Exchange Systems With Centralized Control (AREA)

Abstract

A selective call control center (10) is provided for transmission of calls to selective call receivers (14,15,16), such as paging receivers. In a first aspect, priorities are assigned to call sources and to call receivers and the order of transmission of calls is determined by the control center as a function of the priorities of the source and the receiver for each call. In a second aspect, at least one call receiver is provided having at least two addresses and the address to be selected from the at least two addresses for calling that receiver is determined dependent on the priority of the source of the call.

Description

    Background of the Invention
  • This invention relates generally to the field of selective call control centers for transmission of calls to selective call receivers, such as paging receivers and more particularly to determining the order of transmission of calls to the receivers and/or determining which address within a receiver is to be called.
  • As the use of pagers becomes more and more established, the stage is already being reached where the control center of a paging system is becoming saturated at busy times, in the sense that more paging calls are being placed than the system is capable of transmitting to the destination paging receivers on the allocated radio frequency channels. To overcome this problem, control centers of paging systems administer a queue of calls for transmission, by storing each call in memory, and transmitting the calls, often on a first-in, first-out basis.
  • "Priority" is a concept used in paging control centers, or terminals, to alter the processing of selected calls, primarily in regard to their insertion into an output queue. Specifically, calls assigned a priority higher than that of other calls waiting for output are given advanced placement in the output queue, so that they will be transmitted sooner than calls assigned lower priority.
  • Description of the Prior Art
  • Currently produced paging terminals generally treat priority in one of two manners:
    • (1) Semipermanent individual assignment of call priority level by means of a parameter in the pager data base (i.e. stored in the paging terminal memory), or
    • (2) The use of a special "priority" input to momentarily raise the priority level of a call placed via that input.
  • These two manners of treating priority will be explained by reference to the generalized paging system shown in Figure 1.
  • In this figure there is shown a paging control center 10, three paging inputs in the form of telephones 11, 12 and 13, and three pagers 14, 15 and 16.
  • In the first prior art system, each of the pagers 14, 15 and 16 is assigned a priority level, and these levels are stored in a memory in the paging control center 10. Each time a call is placed to the address of a particular pager, the control center 10 is aware of the priority of that address, and determines the order of transmission of calls accordingly.
  • In the second prior art system, one of the telephones 11, 12 and 13 is designated as a "code blue" telephone, i.e. if a call is placed via that telephone (e.g. telephone 11), such a call is immediately given pre­emptive status, whereby any existing call in progress is interrupted and the code blue call is immediately transmitted. This system is useful where the code blue telephone is assigned for emergency use.
  • Neither of the above prior art systems is sufficiently flexible to meet present day requirements of paging systems.
  • Summary of the Invention
  • In a first aspect of this invention, the invention provides a method and apparatus for assigning priorities to calls received by a selective call control center. Call sources are provided having different assigned priorities, and call receivers are provided having different assigned priorities. The order of transmission of calls from the call sources to be transmitted to the





  • Figure 6 is a flow diagram of the priority determination operation.
  • Description of the Preferred Embodiment
  • The preferred embodiment of the invention may be described in general terms with reference to Figure 1, the elements of which have already been described with reference to the prior art.
  • When a call is placed, that call is assigned a priority and an identification code identifying the call is placed in a queue corresponding to that priority. This is illustrated in Figure 2.
  • Referring to that figure, three queues established by a microprocessor in the control center 10 are shown as blocks 17, 18 and 19. The blocks represent locations in memory (described below) within the control center, in which identification codes of different calls may be stored on a first-in, first-out basis. Sufficient memory is set aside for each block so as to ensure that each block is notationally endless. Identification codes for different calls are represented as a1, b1, c1 etc., queue 17 has top priority (priority P=1), queue 18 has second priority (P=2) and queue 19 has the lowest priority (P=3). In the figure it is shown that there is one call (a1) in queue 17, three calls (b1, b2, b3,) in queue 18, and five calls (c1-c5) in queue 19. In this situation, call a1 has been transmitted, the code a1 will be deleted from queue 17, and call b1 will be the next to be transmitted. Call b1 will be followed by calls b2 and b3, and provided no other calls have arrived in the meantime, call c1 will be the next to be transmitted after call b3, followed by calls c2-c5. As soon as a new call comes in, its identification code is assigned to the appropriate queue in accordance with the priority allocated to it. If a priority 2 call arrives its code will be added to the end of queue 18. From queue 18, it will be transmitted in advance of any remaining calls in queue 19. Likewise, if a priority 1 call arrives any priority 2 or 3 call currently being transmitted will be interrupted, queues 18 and 19 will remain unchanged, and the priority 1 call, which is immediately added to queue 17 is immediately transmitted.
  • In the preferred embodiment of the present invention, each of the input devices, shown in Figure 1 as telephones 11, 12 and 13, is assigned a priority level (Ps). There may be a large number of input devices, and there may be a large number of priority levels, but for the purposes of illustration, it will be assumed that there are three priority levels and that telephone 11 is assigned the top priority level, level 1, telephone 12 (and other telephones not shown) is assigned the lowest priority level, level 3. As an example, the system may be arranged in a hospital, where telephone 11 is an emergency "code blue" telephone for use only for calling a cardiac arrest team, while telephone 12 (and other telephones of similar priority) is assigned to a doctor or head of nursing staff and telephone 13 (and other telephones of similar priority) is assigned for general use.
  • Each of the pagers 14, 15 and 16 (and other pagers not shown) has two addresses. By paging the first address, the addressed pager responds with a loud audible tone, while by paging the second address, the pager responds by a silent vibration. It will be understood that the responses of the separate addresses may take a number of forms, including different volumes of tone, different combinations of tone and/or visible indicators, or different mode of operation, such as variable volume alert and fixed volume alert. There may be more addresses for each pager, typically up to eight.
  • In addition to the priority levels assigned to the input devices, each of the pagers has an assigned priority level (Pr). For the purposes of the present example, it may be assumed that address A of a pager 14 has priority 1, and address B has priority 2, and the same for pager 15, while both addresses of pager 16 are priority 2. Other pagers not shown have priority 3. In this example, the operators of pagers 14 and 15 may have special duties as members of a cardiac arrest team, while at the same time they operate as members of the hospital having non-­particular duties. Pager 16 is an operator having non-­particular duties (not being a member of the cardiac arrest team), and there are other operators of pagers of lower rank. The operators of pagers 14, 15 and 16 may, for example, be doctors and nurses, while the operators of other pagers are orderlies.
  • The operation of the system is as follows. In the event that there is a cardiac arrest in the hospital, a member of staff places a call through telephone 11, and this has the effect of immediately pre-empting any existing calls being transmitted, and pagers 14 and 15 are paged via their A addresses. In so paging these pagers via their A addresses, those pagers issue an audible tone which the operators of the pagers cannot disable in advance. The system may be configured such that telephone 11 is dedicated only to page those addresses as a group. Thus, telephone 11 may be unable to page pager 16, or other pagers. As an alternative, telephone 11 may be configured to address pager 16 by dialing the appropriate number, and by virtue of the fact that the call has been placed via telephone 11, the call is immediately given pre-emptive status.
  • In contrast to the above, if a call is placed via telephone 12 to any one of telephones 14, 15, and 16, such a call is a priority 2 call to a priority 2 address (in this case pagers 14 and 15 are addressed via their B addresses) and such a call is placed in a priority 2 queue as described above with reference to Figure 2. If, by dialing an appropriate number into telephone 12, the system is configured to address pager 14 via its A address, then such a call is treated with pre-emptive status by virtue of the fact that the destination of the call has priority 1.
  • From the above, it can be seen that priority 1 takes precedence over priority 2, irrespective of whether the priority 1 results from a priority 1 source (telephone 11; Ps=1) or a priority 1 destination receiver (address A of pager 14 or 15; Pr=1).
  • To continue the above example, if a call is placed via telephone 13 to pager 16, that call is placed in the priority 2 queue, because the destination of the call (pager 16) has been assigned priority 2. If a call is placed via telephone 13 another pager (not shown) of priority 3, that call is placed in a priority 3 queue, by virtue of the fact that the source has priority 3 and the destination also has priority 3. None of the calls in the priority 3 queue will be transmitted until all the calls in the priority 2 queue have been transmitted.
  • The manner in which the above features are implemented is described with reference to Figures 3-6.
  • In Figure 3, the three input telephones 11, 12 and 13 of Figure 1 are shown. These telephones are connected to telephone inputs of DTMF decoder and supervisor 20. A data bus 21 connects the decoder and supervisor 20 to a microprocessor 22. Included in the data bus 21 are source identifier lines 23 which identify the input of the decoder and supervisor to which a particular telephone making a call is connected. Also included in the data bus 21 are destination receiver identifier lines 24, which identify the telephone number being dialed. It will be understood that one of the telephones, e.g., telephone 11, can be dedicated to dial a particular number, this number being stored in decoder and supervisor 20 and being sent on data lines 24 automatically upon use of telephone 11. Connected with microprocessor 22 is a read only memory 25, which is preferably an EEPROM. This EEPROM contain a look-up table, which will be described in more detail with reference to Figure 4. Microprocessor 22 provides an output on data bus 27 to a transmit controller and paging encoder 28, which in turn passes information on data bus 29 to a transmitter 30. The transmitter controller and paging decoder also controls transmitter 30 by an on/off control line 31.
  • The operation of the apparatus is as follows. A user makes a paging call by picking up one of the telephones, e.g. telephone 12 and dialing a 3-digit number identifying that a call is to be made. The user hears a prerecorded message provided by decoder and supervisor 20, telling the user to dial the number of the pager to which the page is to be transmitted. At this stage a number of further features may be possible, including providing a voice message, keying in an alphanumeric message into a keyboard (not shown) and/or dialing in a call-back number, e.g. through a touch-tone pad, for the person being paged to call back. The decoder and supervisor 20 identifies the telephone input being operated from the hardwired connection to the decoder and supervisor 20, and it passes this information, together with the three digit number paged, on data lines 23 and 24 any other information provided (message, voice etc.) is also passed on data bus 21.
  • The microprocessor 22 receives this information and performs the following operations. If the call is identified as coming from telephone 11, then the microprocessor performs a look-up operation in the table of Figure 4A and determines that pagers 14 and 15 are to be paged as a cardiac arrest team on their A addresses. The call is treated as a priority 1 call. If the call originates from any other source, the microprocessor 22 determines that only the pager identified by the user originating the call is to be paged ad a look-up operation is made on the look-up table of Figure 4B. All this information is contained in EEPROM 25.
  • From the table of Figure 4B, a number defining pager 15 for example is input and the table identifies that the priority of pager 15 is priority 2. The table also provides the actual address that the transmitter 30 has transmit to reach that pager on address B. This address is given in the right-hand column. It will be understood that this address could include post-digit addressing, wherein a code is included in the header information at the start of a call/page, that code determining the function that the pager is to perform, e.g. in terms of the type of alarm response.
  • Figure 5 shows a flow diagram of the overall queue management performed by microprocessor 22. For the purposes of explanation of the diagram, let it be supposed that there are a number of calls waiting for transmission in queues, as shown in Figure 2. From this situation, the operations of the flow diagram will commence from point X. The uppermost priority call, in this case call a1 is transmitted first, as represented by step 51. Once this page has been transmitted, step 52 is executed in that the queues are updated by deleting code a1 from queue 17. Next, a test is carried out, step 53, and if there are more calls still queuing the program returns to point X, and the next call in the queue is transmitted as represented by step 51. In this case, there are indeed more call queuing, and the next call to be transmitted is call b1. Thus steps 51, 52 and 53 are repeated until all the queues 17-19 are vacant. At this point, the program passes from step 53 to step 54, and the system waits for the next incoming call from input devices 11-13 etc.
  • Figure 6 illustrates the operation of microprocessor 22 on receipt of a new call. The program of Figure 5 is interrupted, as represented by step 61, whenever a new call is received from one of the input devices and the identification code of the new call is placed in the correct queue, as represented by step 62. On the left hand side of the figure, it is shown that step 62 comprises a number of smaller steps, in which the priority of the call source (Ps) associated with the source 11, 12, or 13 is compared with the priority of the call destination receiver (Pr) i.e. the priority of pager 14, 15, 16. If the priority (Ps) of the source is greater (numerically lower), then the priority P assigned to that call is made equal to Ps (step 64). On the other hand, if the priority of the call receiver (Pr) is greater than that of call source (Ps) then the priority of the call (P) is made equal to Pr (step 65). Based on the priority P of the call, that call is assigned to the appropriate queue and a queue counter Np of that queue is incriminated (step 66).
  • Referring again to the right hand side of the diagram, the next step to be implemented is step 67 in which the queue counter of the priority 1 queue i.e. N1, is tested. If N1 is greater than or equal to 1, then the program of Figure 5 is reset to point X. The reason for this test is to ascertain whether a pre-emptive priority call is to be made (a code blue call), and if so, to interrupt the transmission of the current call, and immediately transmit the priority 1 call by resetting the program to step 51, at which point the program recognizes the priority 1 call as being the next call in the queues. Upon completion of step 67 or 68, as the case may be, the program of Figure 6 is exited at step 69, and the program of Figure 5 resumes normal operation, with the new call having been assigned to its appropriate queue. From Figure 6, it can be seen that the priority of a call is made equal to the greater of the priority of the source and the priority of the call receiver or destination.
  • The above description of the preferred embodiment has been given by way of example, and it will be understood that modifications can be made within the scope of the invention. Thus, for example, the comparison of Ps and Pr may take various other forms. These priorities may, for example, be numerically added, and the resulting sum be taken as the overall priority P. In the above case, the highest overall priority would be P=2. In such a case P=2, and P=3 could be made pre-emptive priorities, since these values can only be reached in Ps or Pr=1. Many other functions can be envisaged in which P depends on both Ps and Pr. Further look-up functions would be another example.

Claims (9)

1. A selective call controller (10) comprising:
means (20) for receiving calls from call sources, for identifying the source of each call and for assigning a priority to said source;
means (28) for transmitting said calls to call receivers and for assigning a priority to the receiver to which each call is to transmitted; and
means (22) for determining an order of transmission of the calls to the receivers as a function of the priorities of the source and the receiver for each call.
2. The controller of claim 1, further comprising means for comparing the priority of the source of each call with the priority of the receiver for that call and means, responsive to the means for comparing, for assigning an overall priority to that call, said overall priority corresponding to the greater of said priorities, wherein the overall priority of a call determines the order of transmission of the call relative to other calls having higher or lower overall priorities.
3. A selective call system comprising: a plurality of
call sources (11,12,13) having different assigned priorities;
a plurality of call receivers (14,15,16) having different assigned priorities;
a selective call control center (10) including means for assigning priorities to calls received by the control center from the call sources for transmission to the call receivers;
transmission means (28) for transmitting the calls to the call receivers; and
means (20) for determining an order of transmission of the calls to the receivers as a function of the priorities of the source and the receiver for each call.
4. A selective call system comprising: at least one call receiver (14,15,16) having at least two addresses;
a selective call controller (10) having means for receiving calls from call sources, for identifying the source of each call and for assigning a priority to said source and having means for determining which of said at least two addresses is to be called dependent upon the priority of the source of the call.
5. The system of claim 4, wherein the at least one call receiver comprises means for generating different alert signals, wherein the alert function generated depends on the address called.
6. The system of claim 4, further comprising the features of the system of claim 3, whereby the priority of a source is used to determine both the order of transmission of calls and the address in the receiver which is called.
7. A method of operating a selective call system, comprising the steps of:
providing call sources having different assigned priorities;
providing at least one call receiver having at least two addresses;
determining which of said at least two addresses is to be called dependent upon the priority of the source of the call.
8. The method of claim 7, wherein the at least one call receiver is capable of generating different alert functions and the alert function generated depends on the address called.
9. The method of claim 7, wherein calls for transmission from the call sources to the at least one call receiver are assigned priorities in accordance with claim 7, and wherein the priority of a source is used to determine both the order of transmission of calls and the address in the receiver which is called.
EP90101684A 1989-02-10 1990-01-29 Dual dynamic priority control in a selective call system Expired - Lifetime EP0382035B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US07/308,711 US4959648A (en) 1989-02-10 1989-02-10 Dual dynamic priority control in a selctive call system
US308711 2002-12-02

Publications (3)

Publication Number Publication Date
EP0382035A2 true EP0382035A2 (en) 1990-08-16
EP0382035A3 EP0382035A3 (en) 1992-01-02
EP0382035B1 EP0382035B1 (en) 1996-04-03

Family

ID=23195082

Family Applications (1)

Application Number Title Priority Date Filing Date
EP90101684A Expired - Lifetime EP0382035B1 (en) 1989-02-10 1990-01-29 Dual dynamic priority control in a selective call system

Country Status (6)

Country Link
US (1) US4959648A (en)
EP (1) EP0382035B1 (en)
AT (1) ATE136417T1 (en)
CA (1) CA2007014C (en)
DE (1) DE69026293T2 (en)
HK (1) HK1000755A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1993021697A1 (en) * 1992-04-10 1993-10-28 Nokia Telecommunications Oy Signalling method for a radio system
WO1998015141A2 (en) * 1996-09-30 1998-04-09 Ericsson Inc. Data and message retrieval communications system including remote receive-only communication unit
GB2350918A (en) * 1999-06-12 2000-12-13 Ericsson Telefon Ab L M Paging in a mobile telecommunications network

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03154437A (en) * 1989-11-13 1991-07-02 Nippon Telegr & Teleph Corp <Ntt> Incoming call control system
GB9201699D0 (en) * 1992-01-25 1992-03-11 A & B Fire Prevention Ltd Remote monitoring system
US5533094A (en) * 1992-05-12 1996-07-02 Telefonaktiebolaget L M Ericsson, A Corp. Of Sweden Allocation of paging capacity in cellular applications by storing a set of page request group designations, paging extents and paging priority parameters
KR940012897A (en) * 1992-11-19 1994-06-24 정용문 How to Display Emergency Call Priority of Wireless Call Receiver
JPH06188831A (en) * 1992-12-16 1994-07-08 Fujitsu Ltd Personal communication system
US5483251A (en) * 1992-12-31 1996-01-09 At&T Corp. Abridgment of text-based display information
US5615249A (en) * 1994-11-30 1997-03-25 Lucent Technologies Inc. Service prioritization in a cellular telephone system
US5592154A (en) * 1995-06-05 1997-01-07 Motorola, Inc. Method and apparatus for prioritizing communications in a two-way communication system
US6141322A (en) * 1997-05-09 2000-10-31 General Datacomm, Inc. Method and apparatus for precedence and preemption in ATM connection admission control
US6653930B1 (en) * 1999-05-14 2003-11-25 Siemens Information & Communication Networks, Inc. Urgency-based variable call notification
US8077019B2 (en) * 2006-01-19 2011-12-13 Qualcomm Incorporated Method of associating groups of classified source addresses with vibration patterns
KR100780436B1 (en) * 2006-05-25 2007-11-28 삼성전자주식회사 Apparatus and method for displaying background screen of mobile communication terminal
JP4591480B2 (en) * 2007-06-29 2010-12-01 ブラザー工業株式会社 Computer program and network terminal

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3823375A (en) * 1971-11-08 1974-07-09 K Wycoff System for transmitting priority messages and secondary messages
US4438433A (en) * 1981-09-29 1984-03-20 Motorola, Inc. Multiaddress pager with a call storage and priority paging option

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4670872A (en) * 1985-07-02 1987-06-02 Phillips Petroleum Company Communication link contention resolution system
US4825193A (en) * 1988-01-07 1989-04-25 Motorola, Inc. Acknowledge back pager with adaptive variable transmitter output power

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3823375A (en) * 1971-11-08 1974-07-09 K Wycoff System for transmitting priority messages and secondary messages
US4438433A (en) * 1981-09-29 1984-03-20 Motorola, Inc. Multiaddress pager with a call storage and priority paging option

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1993021697A1 (en) * 1992-04-10 1993-10-28 Nokia Telecommunications Oy Signalling method for a radio system
US5418787A (en) * 1992-04-10 1995-05-23 Nokia Telecommunications Oy Signalling method for a radio system
AU664615B2 (en) * 1992-04-10 1995-11-23 Nokia Telecommunications Oy Signalling method for a radio system
WO1998015141A2 (en) * 1996-09-30 1998-04-09 Ericsson Inc. Data and message retrieval communications system including remote receive-only communication unit
WO1998015141A3 (en) * 1996-09-30 1998-07-16 Ericsson Inc Data and message retrieval communications system including remote receive-only communication unit
US6108534A (en) * 1996-09-30 2000-08-22 Ericsson Inc. Data and message retrieval communications system including remote receive-only communication unit
GB2350918A (en) * 1999-06-12 2000-12-13 Ericsson Telefon Ab L M Paging in a mobile telecommunications network
GB2350918B (en) * 1999-06-12 2003-10-29 Ericsson Telefon Ab L M Paging in a mobile telecommunications network

Also Published As

Publication number Publication date
CA2007014C (en) 1994-04-26
EP0382035A3 (en) 1992-01-02
HK1000755A1 (en) 1998-04-24
US4959648A (en) 1990-09-25
CA2007014A1 (en) 1990-08-10
ATE136417T1 (en) 1996-04-15
EP0382035B1 (en) 1996-04-03
DE69026293T2 (en) 1996-10-31
DE69026293D1 (en) 1996-05-09

Similar Documents

Publication Publication Date Title
EP0382035B1 (en) Dual dynamic priority control in a selective call system
EP1362470B1 (en) Call queue handling
US5307399A (en) Paging system that allows caller/subscriber interconnection
CA2180684C (en) Automatic call forwarding
US5537684A (en) Method for a communication unit to influence communication resource allocation
AU654963B2 (en) Telephone paging system for connecting calling and paged parties
EP0370826A2 (en) Signalling and control protocol for a communication system
AU2002232364A1 (en) Call queue handling
EP0705017A2 (en) Telecommunication system with multilink host computer call control interface system and method
JPH07143236A (en) Camp-on communication management system
EP0109432A4 (en) Call completion circuit and method.
JPS59147563A (en) Communication terminal station apparatus with bidirectional communication line
US5051740A (en) Paging terminal
US5509059A (en) Method for the establishment in a communication system of a connection between a communication terminal apparatus and a plurality of further apparatus
JP2695819B2 (en) Electronic private branch exchange
JPH04216220A (en) Radio call system
EP1278358A1 (en) Scheduled Emergency Callback and Outcall Service
JPH03280768A (en) Ic card telephone system
JPS6346851A (en) Alarm automatic notice system
JP3142308B2 (en) Telephone system
JPS6187458A (en) Pb signal reception processing system
JPS62166A (en) Facsimile communication system
US20040097222A1 (en) Method for transmitting information data associated with the number of transmissions of a calling signal
JPH0440731A (en) Telephone system
JPS61154251A (en) Morning call setting system

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH DE ES FR GB IT LI LU NL SE

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE CH DE ES FR GB IT LI LU NL SE

17P Request for examination filed

Effective date: 19920630

17Q First examination report despatched

Effective date: 19940722

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH DE ES FR GB IT LI LU NL SE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRE;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.SCRIBED TIME-LIMIT

Effective date: 19960403

Ref country code: CH

Effective date: 19960403

Ref country code: ES

Free format text: THE PATENT HAS BEEN ANNULLED BY A DECISION OF A NATIONAL AUTHORITY

Effective date: 19960403

Ref country code: AT

Effective date: 19960403

Ref country code: BE

Effective date: 19960403

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 19960403

Ref country code: LI

Effective date: 19960403

REF Corresponds to:

Ref document number: 136417

Country of ref document: AT

Date of ref document: 19960415

Kind code of ref document: T

ET Fr: translation filed
REF Corresponds to:

Ref document number: 69026293

Country of ref document: DE

Date of ref document: 19960509

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Effective date: 19960703

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19970131

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20051209

Year of fee payment: 17

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20060104

Year of fee payment: 17

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20060131

Year of fee payment: 17

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070801

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20070129

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20070930

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070129

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070131

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230520