← Back to Patent Explorer
US3702380A Expired / Lapsed US ⏱️ 0.0 years remaining

Queue for electronic telephone exchange

Assignee: Telex Computer Products Inc
•
Filing: 1971-01-21
•
Granted: 1972-11-07
•
Expires: 1991-01-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The identifying number of the trunk circuit and a mark are stored in a set of recirculating stores such as in the queue when the trunk circuit is seized in response to an incoming call. If the queue is empty and an operator is available, the queue directs the call to an operator loop. If all of the operators are busy, the number and mark are stored until one is available. The trunks are served in the same sequence in which their numbers are entered in the registers. Each time the trunk scanner of the common control finds a marked trunk, its identifying number is compared with the stored numbers. If a match is not found and the queue is not already full, the trunk number and mark are entered at the end of the queue. If the marked trunk matches the first marked number in the stores, and an operator is available, the queue signals the common control to serve the marked trunk and erases the corresponding mark in the queue. First in, first out is ensured by running the stores through a complete cycle on each operation. An output display drive circuit is included to provide a visible indication of the number of calls in the queue at any time.

Inventors

  • 👤 Klaus Gueldenpfenning
  • 👤 Uwe A Pommerening
  • 👤 Stanley L Russell

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 22:22
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/42; H04Q3/54

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 162 words
A queue circuit for a telephone exchange of the kind having a common control including a trunk scanner and a clock for timing its operations, the queue circuit being operative to hold incoming calls in ordered sequence and to relay them in sequence to an operator''s position as one becomes available, wherein the improvement comprises: a. a set of re-circulating stores for storing trunk number identifying signals, b. a mark re-circulating store for storing signals indicating trunk marks, c. gate means for feeding signals into said stores, d. detecting means responsive to operation of the trunk scanner for detecting marked trunk circuits, e. a comparator for comparing the number of a marked trunk detected by said detecting means with signals stored in said set of stores, and f. control means responsive to said detecting means and said comparator for driving said stores and said gate means and for selectively inserting signals into said stores and erasing signals stored in said mark stores.
Claim 2
Dependent Claim 162 words
A queue circuit for a telephone exchange of the kind having a common control including a trunk scanner and a clock for timing its operations, the queue circuit being operative to hold incoming calls in ordered sequence and to relay them in sequence to an operator''s position as one becomes available, wherein the improvement comprises: a. a set of re-circulating stores for storing trunk number identifying signals, b. a mark re-circulating store for storing signals indicating trunk marks, c. gate means for feeding signals into said stores, d. detecting means responsive to operation of the trunk scanner for detecting marked trunk circuits, e. a comparator for comparing the number of a marked trunk detected by said detecting means with signals stored in said set of stores, and f. control means responsive to said detecting means and said comparator for driving said stores and said gate means and for selectively inserting signals into said stores and erasing signals stored in said mark stores.
Claim 3
Dependent Claim 179 words
A queue circuit for a telephone exchange of the kind having a common control including a trunk scanner and a clock for timing its operations, the queue circuit being operative to hold incoming calls in ordered sequence and to relay them in sequence to an operator''s position as one becomes available, wherein the improvement comprises: a. a set of re-circulating stores for storing trunk number identifying signals, b. a mark re-circulating store for storing signals indicating trunk marks, c. gate means for feeding signals into said stores, d. detecting means responsive to operation of the trunk scanner for detecting marked trunk circuits, e. a comparator for comparing the number of a marked trunk detected by said detecting means with signals stored in said set of stores, f. control means responsive to said detecting means and said comparator for driving said stores and said gate means and for selectively inserting signals into said stores and erasing signals stored in said mark store, and g. means for producing an output signal indicating the number of signals stored in said mark store.
Claim 4
Dependent Claim 179 words
A queue circuit for a telephone exchange of the kind having a common control including a trunk scanner and a clock for timing its operations, the queue circuit being operative to hold incoming calls in ordered sequence and to relay them in sequence to an operator''s position as one becomes available, wherein the improvement comprises: a. a set of re-circulating stores for storing trunk number identifying signals, b. a mark re-circulating store for storing signals indicating trunk marks, c. gate means for feeding signals into said stores, d. detecting means responsive to operation of the trunk scanner for detecting marked trunk circuits, e. a comparator for comparing the number of a marked trunk detected by said detecting means with signals stored in said set of stores, f. control means responsive to said detecting means and said comparator for driving said stores and said gate means and for selectively inserting signals into said stores and erasing signals stored in said mark store, and g. means for producing an output signal indicating the number of signals stored in said mark store.
Claim 5
Dependent Claim 97 words
A queue circuit according to claim 1 wherein said control means is a logic circuit including: a. means for producing a series of drive signals equal in number to the number of stages in said stores, b. means for applying said drive signals to said stores to circulate signals stored in them and to cause the signals to appear in succession at the output stages of said stores, and c. means for producing a request-for-service signal if said comparator indicates an identity simultaneously with the first appearance of a signal at the output of said mark store.
Claim 6
Dependent Claim 129 words
A queue circuit according to claim 1 wherein said control means is a logic circuit including: a. means for producing a series of drive signals equal in number to the number of stages in said stores, b. means for applying said drive signals to said stores to circulate signals stored in them and to cause the signals to appear in succession at the output stages of said stores, c. means for producing a supplemental drive signal after said series of drive signals if said comparator does not indicate an identity during said series of drive pulses, and d. means for inserting signals indicating a mark and the number of the detected trunk into said stores in response to a supplemental drive signal produced by said supplemental drive signal means.
Claim 7
Dependent Claim 28 words
A queue circuit according to claim 4, also including means for inhibiting said supplemental drive signal means whenever signals are present in all stages of said mark store.
Claim 8
Dependent Claim 104 words
A queue circuit according to claim 1 wherein said control means is a logic circuit including: a. means for producing a series of drive signals equal in number to the number of stages in said stores, b. means for applying said drive signals to said stores to circulate sIgnals stored in them and to cause the signals to appear in succession at the output stages of said stores, and c. means for erasing the first signal to appear at the output of said mark store if said comparator has not indicated an identity coincident with it during two consecutive cycles of the trunk scanner.

References Cited (Backward Citations)

US3271521A Cited
US3424868A Cited
US3328772A Cited
US3430001A Cited
US3466398A Cited
US3560655A Cited
US3581016A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1975-11-07 1976-05-08 1976-11-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1979-11-07 1980-05-08 1980-11-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1983-11-07 1984-05-08 1984-11-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag