Finite storage-time queue
First Claim
1. A method of queuing a plurality of serially generated communication link requests in a communication system having a plurality of calling stations and ordered groups of communication links, each group having a different priority level, said method comprising the steps of:
- (a) sensing each of a plurality of serially generated communication link requests from a plurality of calling stations;
(b) scanning a first group of said communication links for availability of one of the communication links therein in response to said step of sensing;
(c) connecting the calling station associated to a given request to one of said communication links in said first group, if available;
(d) queuing said requests for a first fixed time period if none of said communication links in said first group is available during said step (b) of scanning;
(e) repeating said step (b) of scanning and said step (c) of connecting;
(f) sensing the number of requests queued;
(g) scanning a second group of said communication links for availability of one of the communication links therein when a request has been queued for said first fixed time period or the number of queued requests exceeds a first predetermined maximum; and
(h) connecting the calling station associated to the oldest queued request to one of said communication links in said second group.
7 Assignments
0 Petitions
Accused Products
Abstract
A queuing technique for message communication systems having a plurality of caller handsets and multiple tariff communication links.
In response to toll call requests, the lowest tariff links are scanned for availability. If no such link is available, a request is stored in a finite time, fixed storage queue, and the lowest tariff links are repeatedly scanned for availability. If no such link becomes available within a predetermined maximum time period, or if the number of requests stored in the queue exceeds a predetermined maximum number, the next lowest tariff links are scanned and the caller handset corresponding to the oldest stored request is connected to an available one of such links. If none of the next lowest tariff links are available, the oldest caller is connected to one of the regular tariff links.
A second queue may be added between the next lowest tariff link group and the regular tariff link group to provide serial tandem queues or serial concatenated queues.
93 Citations
16 Claims
-
1. A method of queuing a plurality of serially generated communication link requests in a communication system having a plurality of calling stations and ordered groups of communication links, each group having a different priority level, said method comprising the steps of:
-
(a) sensing each of a plurality of serially generated communication link requests from a plurality of calling stations; (b) scanning a first group of said communication links for availability of one of the communication links therein in response to said step of sensing; (c) connecting the calling station associated to a given request to one of said communication links in said first group, if available; (d) queuing said requests for a first fixed time period if none of said communication links in said first group is available during said step (b) of scanning; (e) repeating said step (b) of scanning and said step (c) of connecting; (f) sensing the number of requests queued; (g) scanning a second group of said communication links for availability of one of the communication links therein when a request has been queued for said first fixed time period or the number of queued requests exceeds a first predetermined maximum; and (h) connecting the calling station associated to the oldest queued request to one of said communication links in said second group. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A queuing system for use with a plurality of calling stations and a plurality of ordered groups of communication links, each group having a different priority level, such system comprising:
-
first sensing means adapted to be coupled to said calling stations for sensing communication link request signals from said calling stations; first scanning means for scanning a first group of said communication links to determine the availability of a communication link therein; first switching means for connecting the calling station associated to a given request signal to one of said communication links in said first group, when available; first queuing means for storing said request signals for a predetermined first time period when none of said communication links in said first group is available; means for determining the number of request signals stored in said first queuing means; second scanning means for scanning a second group of said communication links to determine availability of a communication link therein when a request signal has been stored in said first queuing means for said first time period or the number of request signals stored in said first queuing means exceeds a first predetermined number; and second switching means for connecting the calling station associated to the oldest request signal stored in said first queuing means to one of said communication links in said second group. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
Specification