Finite storage-time queue

Details Finite storage-time queue Finite storage-time queue

H - Electricity

04

Q

344/83

H04Q 3/64 (2006.01)

Patent

CA 1110746

FINITE STORAGE-TIME QUEUE Abstract of the Disclosure 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 pre- determined 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.

320487

Affiliated with

Also associated with

Rating

Finite storage-time queue does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Finite storage-time queue, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite storage-time queue will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-977018