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

Circuit arrangement for telecommunications exchange systems, particularly telephone exchange systems, comprising information processing sequential logic systems and traffic measuring devices

Assignee: Siemens AG
•
Filing: 1985-07-11
•
Granted: 1987-03-10
•
Expires: 2005-07-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A circuit arrangement for telecommunications exchange systems, particularly telepone exchange systems, comprising information processing sequential logic systems and traffic measuring devices, is provided for handling processing requests. Processing requests are marked by a sequential logic systems as partially acceptable and input into a waiting list formed as a FIFO buffer. Processing requests marked not acceptable are input into a FIFO-LIFO memory which ejects a processing request in a FIFO mode when it is full and when the waiting list is at least partially filled and marks them as not acceptable, but marks processing requests as acceptable and outputs the same to the waiting list in the LIFO mode when the waiting list is empty or nearly empty.

Inventors

  • 👤 Herbert Jans

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 13:10
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/42; H04Q3/54; H04Q3/545; H04Q3/54575; H04Q3/54591

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 227 words
In a circuit arrangement for telecommunications exchange systems, particularly telephone exchange systems, of the type which includes an information processing sequential logic system having a limited call handling capacity with respect to its information processing capacity, in which a buffer precedes the sequential logic system and serves for a temporary acceptance of information processing requests, in which a traffic measuring device is connected to the buffer for recognizing information processing traffic overloads of the sequential logic system and for averting such overloads by way of a request rejection device preceding the traffic measuring device, the request rejection device quantitatively dividing the incoming processing requests into acceptable processing requests which are supplied to the buffer and into unacceptable processing requests which are not supplied to the buffer, the improvement therein comprising: a first monitor connected to the buffer and operable to monitor the available buffer capacity; a first in-first out-last in-first out (FIFO-LIFO) memory connected to the request rejection device and to said first monitor and to the traffic measuring device and operable as a FIFO memory in response to being full and processing requests are stored in the buffer to mark processing requests it has rejected as non-acceptable, and operable as a LIFO memory in response to a predetermined number of processing requests residing in the buffer to output processing requests and mark the same as acceptable.
Claim 2
Dependent Claim 227 words
In a circuit arrangement for telecommunications exchange systems, particularly telephone exchange systems, of the type which includes an information processing sequential logic system having a limited call handling capacity with respect to its information processing capacity, in which a buffer precedes the sequential logic system and serves for a temporary acceptance of information processing requests, in which a traffic measuring device is connected to the buffer for recognizing information processing traffic overloads of the sequential logic system and for averting such overloads by way of a request rejection device preceding the traffic measuring device, the request rejection device quantitatively dividing the incoming processing requests into acceptable processing requests which are supplied to the buffer and into unacceptable processing requests which are not supplied to the buffer, the improvement therein comprising: a first monitor connected to the buffer and operable to monitor the available buffer capacity; a first in-first out-last in-first out (FIFO-LIFO) memory connected to the request rejection device and to said first monitor and to the traffic measuring device and operable as a FIFO memory in response to being full and processing requests are stored in the buffer to mark processing requests it has rejected as non-acceptable, and operable as a LIFO memory in response to a predetermined number of processing requests residing in the buffer to output processing requests and mark the same as acceptable.
Claim 3
Dependent Claim 23 words
The improved circuit arrangement of claim 1, wherein said memory comprises a LIFO output connected to the buffer via the traffic measuring device.
Claim 4
Dependent Claim 52 words
The improved circuit arrangement of claim 2, wherein: the degree of filling of the buffer below which processing requests are also taken by the LIFO output is established by a plurality of processing requests stored in the buffer which is equal to the plurality of processing requests storable in the FIFO-LIFO memory.
Claim 5
Dependent Claim 53 words
The improved circuit arrangement of claim 2, wherein: the degree of filling of the buffer below which processing requests are also taken by the LIFO output is established by a plurality of processing requests stored in the buffer which is approximately equal to the plurality of processing requests storable in the FIFO-LIFO memory.
Claim 6
Dependent Claim 47 words
The improved circuit arrangement of claim 1, wherein: said FIFO-LIFO memory comprises a shift register comprising a FIFO output and operable to eject processing requests via said FIFO output when said FIFO-LIFO memory is full in response to a further processing requests from the request rejection device.
Claim 7
Dependent Claim 37 words
The improved circuit arrangement of claim 5, wherein: said shift register comprises a plurality of memory elements; and said LIFO output of said shift register is connected to the memory element connected to the request rejection device.
Claim 8
Dependent Claim 36 words
The improved circuit arrangement of claim 1, wherein: said memory comprises a shift register including a LIFO output and a FIFO output and is selectively operable to shift stored processing requests toward either of said outputs.
Claim 9
Dependent Claim 35 words
The improved circuit arrangement of claim 7, wherein: a shift processing requests in the direction from said FIFO output towards said LIFO output occurs each time a processing requests is taken from said LIFO output.

References Cited (Backward Citations)

US4151375A Cited
US4156109A Cited
US4379950A Cited
US4497978A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1990-03-09 1990-09-08 1991-03-10 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1994-03-09 1994-09-08 1995-03-10 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1998-03-09 1998-09-08 1999-03-10 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag