Finite storage-time queue
CA 1110746 A · Owner: Rolm Corporation · Inventors: Jolissaint, Charles H.
Overview
Its claims, description and drawings are in the Canadian Patents Database.
Open the CIPO recordAbstract From the Canadian patent
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 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 …
Read the whole patent
Listed from its CIPO record in Patent Yard's archive of Canadian patents past their term. Its claims, description and drawings are in the CIPO record and on Google Patents, and the Claude kit works from them.
Why it's free to use
- Granted October 13, 1981. A Canadian patent filed before October 1, 1989 lasted 17 years from grant, so its term ended October 13, 1998.
- We check Canadian rights only. A patent in its family in another country could still be in force: check its family on Google Patents.
Timeline
Timeline From CIPO dates
Sources & verification
Official CIPO records
Everything on this page comes from the CIPO record linked above. Contains information licensed under the Open Government Licence – Canada.