US5856977A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Distribution network switch for very large gigabit switching architecture
Assignee: Industrial Technology Research Institute
•
Filing: 1997-05-15
•
Granted: 1999-01-05
•
Expires: 2017-05-15
Abstract
Abstract An inventive switch for transporting information cells without cell contention is described. The switch includes at least one parallel distribution network. Each distribution network includes an NxN first routing network for receiving cells at a plurality of input ports, where N equals the number the input ports. Illustratively, the routing network is self-routing and non-blocking, such as a Banyan Network. Connected to the NxN network are rho k groups of shared buffers for storing the cells routed through the network for a period of time not greater than one cell cycle, where k is incremented from 1 to [log2N/log2 rho ]-1 and rho equals a predetermined speed-up factor. In one aspect of this embodiment, the number of shared buffers is simply equal to N/ rho . To prevent cell contention and cell loss, all of the contentious cells (cells destined for the same output during the same cycle) are stored in the same shared buffer. Connected to the shared buffers are rho k groups of (N/ rho k)x(N/ rho k) routing networks each having a plurality of output ports for outputting the cells, stored in the shared buffers, based on the destination addresses of each cell. Due in part to the utilization of rho k groups of shared buffers, a large reduction in both hardware costs and chip real estate is realized. Specifically, a decrease in the number of switching stages is achieved.
Inventors
- 👤 Muh-rong Yang
- 👤 Gin-Kou Ma
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 21:44
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L49/00; H04L49/10; H04L49/104; H04L49/105; H04L49/108; H04L49/15; H04L49/1515; H04L49/153; H04L49/1553; H04L49/1561; H04L2012/5638; H04L2012/5646; H04L2012/5647; H04L2012/5678; H04L2012/5681
Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
151 words
A switch for transporting information cells without a cell contention, each of said cells having an output destination, said switch including at least one distribution network, said distribution network comprising: an n×n first routing network for receiving said cells at a plurality of input ports, where n equals the number said input ports; (n/ρ) groups of second routing networks, each having a plurality of output ports for outputting said cells based on destination addresses of said cells, wherein ρ equals a predetermined speed-up factor; and (n/ρ) groups of shared buffers, each coupled between said first routing network and a corresponding one of said second routing networks, for storing said cells routed through said first routing network for a period of time not greater than one cell cycle, wherein all cells having the the same destination address, during each cell cycle, being stored in the same shared buffer to prevent cell contention.
Claim 2
Dependent Claim
151 words
A switch for transporting information cells without a cell contention, each of said cells having an output destination, said switch including at least one distribution network, said distribution network comprising: an n×n first routing network for receiving said cells at a plurality of input ports, where n equals the number said input ports; (n/ρ) groups of second routing networks, each having a plurality of output ports for outputting said cells based on destination addresses of said cells, wherein ρ equals a predetermined speed-up factor; and (n/ρ) groups of shared buffers, each coupled between said first routing network and a corresponding one of said second routing networks, for storing said cells routed through said first routing network for a period of time not greater than one cell cycle, wherein all cells having the the same destination address, during each cell cycle, being stored in the same shared buffer to prevent cell contention.
Claim 3
Dependent Claim
20 words
The switch of claim 1, wherein said speed-up factor ρ is less than the number of said input ports N.
Claim 4
Dependent Claim
55 words
The switch of claim 1, wherein said input ports of said first routing network is grouped into a plurality of speed-up channel (SUCH) groups, wherein the size of said SUCH groups being determined by a predetermined number of input ports, and wherein the number of input ports in each of said SUCH groups equals n/ρ.
Claim 5
Dependent Claim
51 words
The switch of claim 3, wherein the input ports of each said SUCH group are connected to the same corresponding one of said shared buffers via a plurality of switching elements, so that said cells received in said input ports of each SUCH group are self-routed to said corresponding shared buffer.
Claim 6
Dependent Claim
16 words
The switch of claim 1, wherein said first and second routing networks are self-routing, non-blocking networks.
Claim 7
Dependent Claim
15 words
The switch of claim 5, wherein said first and second routing networks are Banyan networks.
Claim 8
Dependent Claim
14 words
The switch of claim 5, wherein said first routing network is a Batcher-Banyan network.
Claim 9
Dependent Claim
18 words
The switch of claim 1, wherein said switch includes more than one said distribution network formed in parallel.
Claim 10
Dependent Claim
37 words
The switch of claim 8, wherein each said parallel distribution network transports a portion of the information of each of said cells, such that each portion of a cell is transported simultaneously in a respective distribution network.
Claim 11
Dependent Claim
19 words
The switch of claim 1, wherein said at least one distribution network form a moderate large dimension (MLD) switch.
Claim 12
Dependent Claim
26 words
The switch of claim 10, wherein multiple MLD switches expandable by connecting said MLD switches together via demultiplexers to form a very large dimension (VLD) switch.
Claim 13
Dependent Claim
14 words
The switch of claim 1, wherein said switch transports asynchronous-transfer mode (ATM) information cells.
Claim 14
Dependent Claim
15 words
The switch of claim 1, wherein said switch transports universal packet timeslot (UPTS) information cells.
Claim 15
Dependent Claim
41 words
The switch of claim 13, wherein said switch includes more than one of said distribution network connected in parallel, wherein each parallel distribution network simultaneously transports a portion of each of said UPTS cells controlled by a topological parallel overlapping network.
Claim 16
Dependent Claim
160 words
A switch for transporting information cells without a cell contention, each of said cells having an output destination, comprising: an n×n first routing network for receiving said cells at a plurality of input ports, where n equals the number of said input ports; ρ k groups of ( N!n/ρk)×( N!(n/ρk) second routing networks, each having a plurality of output ports for outputting said cells based on destination addresses of said cells, wherein k is incremented from 1 to log 2 N!n/log 2 ρ! -1 and ρ equals a predetermined speed-up factor; and ρ k groups of shared buffers, each coupled between said first routing network and a corresponding one of said second routing networks, for storing said cells routed through said first routing network for a period of time not greater than one cell cycle, wherein all cells having the same destination address, during each cell cycle, being stored in the same shared buffer to prevent a said cell connection.
Claim 17
Dependent Claim
160 words
A switch for transporting information cells without a cell contention, each of said cells having an output destination, comprising: an n×n first routing network for receiving said cells at a plurality of input ports, where n equals the number of said input ports; ρ k groups of ( N!n/ρk)×( N!(n/ρk) second routing networks, each having a plurality of output ports for outputting said cells based on destination addresses of said cells, wherein k is incremented from 1 to log 2 N!n/log 2 ρ! -1 and ρ equals a predetermined speed-up factor; and ρ k groups of shared buffers, each coupled between said first routing network and a corresponding one of said second routing networks, for storing said cells routed through said first routing network for a period of time not greater than one cell cycle, wherein all cells having the same destination address, during each cell cycle, being stored in the same shared buffer to prevent a said cell connection.
Claim 18
Dependent Claim
20 words
The switch of claim 15, wherein said speed-up factor ρ is less than the number of said input ports n.
Claim 19
Dependent Claim
55 words
The switch of claim 15, wherein said input ports of said first routing network is grouped into a plurality of speed-up channel (SUCH) groups, wherein the size of said SUCH groups being determined by a predetermined number of input ports, and wherein the number of input ports in each of said SUCH groups equals n/ρ.
Claim 20
Dependent Claim
51 words
The switch of claim 17, wherein the input ports of each said SUCH group are connected to the same corresponding one of said shared buffers via a plurality of switching elements, so that said cells received in said input ports of each SUCH group are self-routed to said corresponding shared buffer.
Claim 21
Dependent Claim
16 words
The switch of claim 15, wherein said first and second routing networks are self-routing, non-blocking networks.
Claim 22
Dependent Claim
15 words
The switch of claim 19, wherein said first and second routing networks are Banyan Networks.
Claim 23
Dependent Claim
14 words
The switch of claim 19, wherein said first routing network is a Batcher-Banyan Network.
Claim 24
Dependent Claim
17 words
The switch of claim 15, wherein said switch includes more than one distribution network formed in parallel.
Claim 25
Dependent Claim
36 words
The switch of claim 22, wherein each parallel distribution network transports a portion of the information of each of said cells, such that each portion of a cell is transported simultaneously in a respective distribution network.
Claim 26
Dependent Claim
20 words
The switch of claim 15, wherein said at least one parallel distribution network form a moderate large dimension (MLD) switch.
Claim 27
Dependent Claim
26 words
The switch of claim 24, wherein multiple MLD switches expandable by connecting said MLD switches together via demultiplexers to form a very large dimension (VLD) switch.
Claim 28
Dependent Claim
15 words
The switch of claim 15, wherein said switch transports asynchronous transfer mode (ATM) information cells.
Claim 29
Dependent Claim
15 words
The switch of claim 15, wherein said switch transports universal packet timeslot (UPTS) information cells.
Claim 30
Dependent Claim
42 words
The switch of claim 27, wherein said switch includes more than one distribution network connected in parallel, wherein each parallel distribution network simultaneously transports a portion of each of said UPTS cells under the control of a topological equivalent parallel overlapping network.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-01-04 | 2002-07-06 | 2003-01-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-01-04 | 2006-07-06 | 2007-01-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-01-04 | 2010-07-06 | 2011-01-05 | $7700.00 | Window Closed / Lapsed |