| 摘要 |
<p>FINITE STORAGE-TIME QUEUE 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.</p> |
