Patent US5067124A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5067124A Expired / Lapsed US ⏱️ 0.0 years remaining

Packet switching network for a communication system

Assignee: US Philips Corp
•
Filing: 1989-09-28
•
Granted: 1991-11-19
•
Expires: 2009-09-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention relates to a switching network for a communication system, comprising m/1 stages and in which cells are transmitted in accordance with a time-division multiple access method and the switching is effected on the basis of the routing information contained in the header. The arriving cells are temporarily stored in a buffer until a free frame is available. The queues built up in the buffers of the m/1 stages are to be processed in the most fair manner. For this purpose it is proposed to assign a memory to each m/1 stage of each auxiliary line (Zl . . . Zm), to which memory are applied the results of the comparisons between routing information and address of the trunk line (A) and to determine for the decision circuits the order in which the cells stored in the buffers (B) are read out.

Inventors

  • 👤 Ulrich Killat
  • 👤 Johann Kruger

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 12:09
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/30; H04L49/3018; H04L49/25; H04L49/253; H04L49/254; H04L49/40

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 167 words
Switching network for a communication system, comprising m/1 stages which include auxiliary lines (Z1 . . . Zm) and have each a trunk line (A) and in which cells are switched through on the basis of routing information contained in a header of each cell and in which a cell arriving at an auxiliary line is written into a buffer (B) dedicated to a trunk line (A) if the routing information and address of this trunk line match and in which a decision circuit (CA) is included in each m/1 stage, characterized in that, in each m/1 stage, each auxiliary line (Z1 . . . Zm) is assigned a memory (FIFO) to which are applied the results of the comparisons of the routing information and address of the trunk line (A) and the contents of the memory (FIFO) are applied to the decision circuit (CA) which, on the basis of these contents, determines the order in which the cells stored in the buffers (B) are read out.
Claim 2
Dependent Claim 167 words
Switching network for a communication system, comprising m/1 stages which include auxiliary lines (Z1 . . . Zm) and have each a trunk line (A) and in which cells are switched through on the basis of routing information contained in a header of each cell and in which a cell arriving at an auxiliary line is written into a buffer (B) dedicated to a trunk line (A) if the routing information and address of this trunk line match and in which a decision circuit (CA) is included in each m/1 stage, characterized in that, in each m/1 stage, each auxiliary line (Z1 . . . Zm) is assigned a memory (FIFO) to which are applied the results of the comparisons of the routing information and address of the trunk line (A) and the contents of the memory (FIFO) are applied to the decision circuit (CA) which, on the basis of these contents, determines the order in which the cells stored in the buffers (B) are read out.
Claim 3
Dependent Claim 181 words
An m/1 stage for use in a switching network for use in a communication system, where m is an integer greater than one, the stage comprising a) m inputs for coupling with m auxiliary lines (Z1 . . . Zm) to receive from the auxiliary lines a plurality of cells, b) an output for coupling with a respective trunk line (A), and c) means for switching cells through the stage on the basis of routing information contained in cell headers, which switching means comprises: i) m means (C) for comparing the cells' routing information with an address of the respective trunk line, ii) m memory means (FIFO), each for storing a result output by a respective one of the means for comparing, and iii) m buffers (B), each for storing cells received from a respective one of the auxiliary lines, when the cells' routing information matches the address of the respective trunk line, and iv) a decision circuit (CA), responsive to the contents of the memory means, for determining an order for reading cells out of the buffers onto the output.
Claim 4
Dependent Claim 181 words
An m/1 stage for use in a switching network for use in a communication system, where m is an integer greater than one, the stage comprising a) m inputs for coupling with m auxiliary lines (Z1 . . . Zm) to receive from the auxiliary lines a plurality of cells, b) an output for coupling with a respective trunk line (A), and c) means for switching cells through the stage on the basis of routing information contained in cell headers, which switching means comprises: i) m means (C) for comparing the cells' routing information with an address of the respective trunk line, ii) m memory means (FIFO), each for storing a result output by a respective one of the means for comparing, and iii) m buffers (B), each for storing cells received from a respective one of the auxiliary lines, when the cells' routing information matches the address of the respective trunk line, and iv) a decision circuit (CA), responsive to the contents of the memory means, for determining an order for reading cells out of the buffers onto the output.
Claim 5
Dependent Claim 75 words
The stage of claim 2 further comprising a) a multiple-OR circuit (OS) common to all of the auxiliary lines, having input means coupled to receive the results from the means for comparing, and b) m AND circuits (U3), one for each auxiliary line, each having i) a respective input coupled to an output of the multiple-OR circuit and ii) a respective output coupled to a write control input of a respective one of memory means.
Claim 6
Dependent Claim 124 words
The stage of claim 3 a) further comprising i) m flip-flops (FF1), each having A) a respective input coupled to receive the result from a respective one of the means for comparing; and B) a respective output coupled to an input of the respective memory means; ii) m second AND gates (U1) each having A) a respective input coupled to the output of a respective one of the flip-flops; and B) a respective output coupled to a control input of a respective one of the buffers (B); and wherein b) each means for comparing is a respective comparator; and c) the input means of the multiple-OR circuit includes a plurality of inputs each coupled to the output of a respective one of the flip-flops.
Claim 7
Dependent Claim 92 words
The stage of claim 4 further comprising a) m third AND gates (U2), each having a respective output coupled to a further input of a respective one of the buffers; b) m second flip-flops (FF2), each having i) a respective input coupled to a respective output of the decision circuit, and ii) a respective output coupled to an input of a respective one of the third AND gates, and wherein the decision circuit causes the respective buffers to be read out via the respective second flip-flops and the respective third AND gates.
Claim 8
Dependent Claim 58 words
The stage of claim 2 further comprising m second buffers (FF3), each having a respective input coupled to an output of a respective one of the memory means, for receiving contents of the respective one of the memory means, as the memory means are read out cyclically, and wherein the decision circuit evaluates states of the second buffers.
Claim 9
Dependent Claim 127 words
The stage of claim 6 a) further comprising i) m flip-flops (FF1), each having a respective input coupled to receive the result from a respective one of the means for comparing and each having a respective output coupled to an input of a respective one of the memory means; ii) m second AND gates (U1) each having: A) a respective input coupled to the output of a respective one of the flip-flops; and B) a respective output coupled to a control input of a respective one of the buffers (B); and wherein b) each means for comparing is a respective comparator; c) the input means of the multiple-or circuit includes a plurality of inputs each coupled to the output of a respective one of the flip flops.
Claim 10
Dependent Claim 90 words
The stage of claim 7 further comprising a) m third AND gates (U2), each having an output coupled to a further input of a respective one of the buffers; b) m second flip-flops (FF2), each having: i) a respective input coupled to a respective output of the decision circuit, and ii) a respective output coupled to an input of a respective one of the third AND gates, wherein the decision circuit causes the respective buffers to be read out via the respective second flip-flops and the respective third AND gates.
Claim 11
Dependent Claim 38 words
The stage of claim 6, wherein the decision circuit comprises m logic circuits (LCA), one for each of the second buffers, and the decision circuit controls reading out of the buffers based on contents of the second buffers.
Claim 12
Dependent Claim 111 words
The stage of claim 9 wherein each logic circuit comprises a) a respective decision circuit AND gate (UCA1 . . . UCA16), each having an input coupled with a respective one of the second buffers, b) a respective decision circuit flip-flop (DFF1 . . . DFF16), having a respective input coupled to the output of the respective decision circuit AND gate, c) a respective OR gate (OCA1 . . . OCA16), having a respective input coupled with an output of the respective decision circuit flip-flop, and d) a respective NOR gate (NOR1 . . . NOR16), having a respective input coupled to a second output of the respective decision circuit flip-flop.
Claim 13
Dependent Claim 176 words
The stage of claim 10 I. further comprising a) means, disposed within the switching means, for generating a first series switching signal (Ai); and b) m respective further AND gates (U4); and II. wherein within each logic circuit, a) a respective second input of each of the OR gates is coupled to receive the first series switching signal; b) a respective second input of each of the NOR gates is coupled to receive the first series switching signal; c) the respective output of each of the OR gates is connected to a respective third input of a respective subsequent one of the OR gates, except for a respective last one of the OR gates, d) the respective output of the respective last one of the OR gates provides a second series switching signal (Ae); e) a respective second input of each of the decision circuit AND gates is coupled to receive the second series switching signal; f) a respective input of each of the further AND gates is coupled to receive the second series switching signal.
Claim 14
Dependent Claim 40 words
A switching network comprising a) m auxiliary lines for receiving cells; b) a plurality of stages as claimed in any of claims 9-18; and c) a plurality of trunk lines for output, a respective trunk line corresponding with each stage.

References Cited (Backward Citations)

US4623996A Cited
EP0183592A1 Cited
US4754451A Cited
US4760570A Cited
US4868813A Cited
US4935922A Cited
US4969149A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-11-18 1995-05-20 1995-11-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-11-18 1999-05-20 1999-11-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-11-18 2003-05-20 2003-11-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag