Patent US5256958A successfully refreshed from Google Patents.
US5256958A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Concentrator-based growable packet switch
Assignee: Nokia Bell Labs
•
Filing: 1991-11-26
•
Granted: 1993-10-26
•
Expires: 2011-11-26
Abstract
Abstract An m×n (m>n) output Packet Switch Unit is implemented by using an n×n Packet Switch Module and an m:n Concentrator. The arriving packet cells are supplied from the m Concentrator inputs to the n Concentrator outputs in a "first-in first-out" (FIFO) sequence. The Concentrator provides for buffering of arriving packet cells on the m Concentrator inputs in excess of available packet cell positions in the n Concentrator outputs until they can be supplied to a concentrator output in the FIFO sequence. In turn, packet cells from the n Concentrator outputs are supplied to n inputs of the Packet Switch Module which supplies them to appropriate output destinations associated with the n outputs of the Packet Switch Module. A plurality of the Concentrator-Based output Packet Switch Units is readily employed to implement any "larger" Packet Switch architecture.
Inventors
- 👤 Kai Y. Eng
- 👤 Mark J. Karol
- 👤 Mark A. Pashan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 06:05
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L49/00; H04L49/15; H04L49/1553; H04L49/1576; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L2012/5603; H04L2012/5609; H04L2012/561; H04L2012/5678; H04L2012/5681
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
193 words
An m×n (m>n) packet switch unit, where m is an integer of at least two (2) and n is an integer of at least one (1), comprising: a packet cell concentrator having m inputs and n outputs including means for temporarily storing arriving packet cells on the m concentrator inputs and means for supplying all of said arriving packet cells in a prescribed repetitive sequence to the n concentrator outputs, said means for temporarily storing arriving packet cells including means for temporarily storing arriving packet cells on the m concentrator inputs in arriving packet cell time slots in excess of available packet cell positions in the n concentrator outputs in output packet cell output time slots so that packet cells of any such excess of said arriving packet cells are not lost or discarded; and a packet switch module having n inputs and n outputs for supplying the packet cells being supplied from the n outputs of the concentrator to the n inputs of the packet switch module to appropriate ones of the n outputs of the packet switch module in accordance with an assigned destination address carried by the individual packet cells.
Claim 2
Dependent Claim
193 words
An m×n (m>n) packet switch unit, where m is an integer of at least two (2) and n is an integer of at least one (1), comprising: a packet cell concentrator having m inputs and n outputs including means for temporarily storing arriving packet cells on the m concentrator inputs and means for supplying all of said arriving packet cells in a prescribed repetitive sequence to the n concentrator outputs, said means for temporarily storing arriving packet cells including means for temporarily storing arriving packet cells on the m concentrator inputs in arriving packet cell time slots in excess of available packet cell positions in the n concentrator outputs in output packet cell output time slots so that packet cells of any such excess of said arriving packet cells are not lost or discarded; and a packet switch module having n inputs and n outputs for supplying the packet cells being supplied from the n outputs of the concentrator to the n inputs of the packet switch module to appropriate ones of the n outputs of the packet switch module in accordance with an assigned destination address carried by the individual packet cells.
Claim 3
Dependent Claim
40 words
The packet switch unit as defined in claim 1, wherein said means for supplying the packet cells in said repetitive sequence includes means for supplying said arriving packet cells to the n concentrator outputs in a first-in first-out (FIFO) sequence.
Claim 4
Dependent Claim
63 words
The packet switch unit as defined in claim 2, wherein said concentrator comprises shared memory means, write control means for writing arriving packet cells on the m concentrator inputs into memory locations in said shared memory means and read control means for reading said packet cells from said shared memory means locations to the n concentrator outputs in said first-in first-out (FIFO) sequence.
Claim 5
Dependent Claim
210 words
A packet switch including a plurality of packet switch units each having m inputs and n outputs, where m is an integer of at least two (2), n is an integer of at least one (1), and m>n, each of said packet switch units comprising: a packet cell concentrator having m inputs and n outputs including means for temporarily storing arriving packet cells on the m concentrator inputs and means for supplying all of said arriving packet cells in a prescribed repetitive sequence to the n concentrator outputs, said means for temporarily storing arriving packet cells including means for temporarily storing arriving packet cells on the m concentrator inputs in arriving packet cell time slots in excess of available packet cell positions in the n concentrator outputs in output packet cell output time slots so that packet cells of any such excess of arriving packet cells are not lost or discarded; and a packet switch module having n inputs and n outputs for supplying the packet cells being supplied from the n outputs of the concentrator to the n inputs of the packet switch module to appropriate ones of the n outputs of the packet switch module in accordance with an assigned destination address carried by the individual packet cells.
Claim 6
Dependent Claim
210 words
A packet switch including a plurality of packet switch units each having m inputs and n outputs, where m is an integer of at least two (2), n is an integer of at least one (1), and m>n, each of said packet switch units comprising: a packet cell concentrator having m inputs and n outputs including means for temporarily storing arriving packet cells on the m concentrator inputs and means for supplying all of said arriving packet cells in a prescribed repetitive sequence to the n concentrator outputs, said means for temporarily storing arriving packet cells including means for temporarily storing arriving packet cells on the m concentrator inputs in arriving packet cell time slots in excess of available packet cell positions in the n concentrator outputs in output packet cell output time slots so that packet cells of any such excess of arriving packet cells are not lost or discarded; and a packet switch module having n inputs and n outputs for supplying the packet cells being supplied from the n outputs of the concentrator to the n inputs of the packet switch module to appropriate ones of the n outputs of the packet switch module in accordance with an assigned destination address carried by the individual packet cells.
Claim 7
Dependent Claim
53 words
The packet switch as defined in claim 4 further including a plurality of address filters associated on a one-to-one basis with the m inputs of the concentrator in each of said packet switch units for supplying packets to the associated concentrator destined for said packet switch module in the particular packet switch unit.
Claim 8
Dependent Claim
39 words
The packet switch as defined in claim 5, wherein said means for supplying the packet cells in said repetitive sequence includes means for supplying said arriving packet cells to the n concentrator outputs in a first-in first-out (FIFO) sequence.
Claim 9
Dependent Claim
62 words
The packet switch as defined in claim 6, wherein said concentrator comprises shared memory means, write control means for writing arriving packet cells on the m concentrator inputs into memory locations in said shared memory means and read control means for reading said packet cells from said shared memory means locations to the n concentrator outputs in said first-in first-out (FIFO) sequence.
Claim 10
Dependent Claim
185 words
In an m×n (m>n) packet switch unit, where m is an integer of at least two (2) and n is an integer of at least one (1), a method comprising the steps of: concentrating packet cells arriving on m inputs to n outputs of an m:n (m>n) concentrator including temporarily storing arriving packet cells on the m concentrator inputs and supplying all of said arriving packet cells in a prescribed repetitive sequence to the n concentrator outputs, said step of temporarily storing arriving packet cells including temporarily storing arriving packet cells on the m concentrator inputs in arriving packet cell time slots in excess of available packet cell positions in the n concentrator outputs in output packet cell output time slots so that packet cells of any such excess of arriving packet cells are not lost or discarded; and switching the packet cells being supplied from the n outputs of the concentrator to n inputs of an n×n packet switch module to appropriate ones of n outputs of the packet switch module in accordance with an assigned destination address carried by the individual packet cells.
Claim 11
Dependent Claim
185 words
In an m×n (m>n) packet switch unit, where m is an integer of at least two (2) and n is an integer of at least one (1), a method comprising the steps of: concentrating packet cells arriving on m inputs to n outputs of an m:n (m>n) concentrator including temporarily storing arriving packet cells on the m concentrator inputs and supplying all of said arriving packet cells in a prescribed repetitive sequence to the n concentrator outputs, said step of temporarily storing arriving packet cells including temporarily storing arriving packet cells on the m concentrator inputs in arriving packet cell time slots in excess of available packet cell positions in the n concentrator outputs in output packet cell output time slots so that packet cells of any such excess of arriving packet cells are not lost or discarded; and switching the packet cells being supplied from the n outputs of the concentrator to n inputs of an n×n packet switch module to appropriate ones of n outputs of the packet switch module in accordance with an assigned destination address carried by the individual packet cells.
Claim 12
Dependent Claim
36 words
The method as defined in claim 8, wherein said step of supplying the packet cells in said repetitive sequence includes supplying said arriving packet cells to the n concentrator outputs in a first-in first-out (FIFO) sequence.
Claim 13
Dependent Claim
50 words
The method as defined in claim 9, wherein said step of concentrating includes writing arriving packet cells on the m concentrator inputs into memory locations in a shared memory and reading said packet cells from said shared memory locations to the n concentrator outputs in said first-in first-out (FIFO) sequence.
References Cited (Backward Citations)
US4603416A
Cited
US4754451A
Cited
US4760570A
Cited
US4868813A
Cited
US4866701A
Cited
US4893304A
Cited
US4955017A
Cited
US5034946A
Cited
US5172371A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-10-25 | 1997-04-26 | 1997-10-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-10-25 | 2001-04-26 | 2001-10-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-10-25 | 2005-04-26 | 2005-10-26 | $7700.00 | Window Closed / Lapsed |