US5864552A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Rearrangeable non-blocking switching network
Assignee: Nokia of America Corp
•
Filing: 1996-09-11
•
Granted: 1999-01-26
•
Expires: 2016-09-11
Abstract
Abstract A rearrangeable non-blocking three stage network and method for routing one or more requests between an input stage and an output stage, comprising between 3N and substantially the next largest integer of (41N-E N )/16 center stage interconnection units, where N is the greater of the inlet links to the input stage and outlet links from the output stage. Received requests are grouped by load size into a first group, a second group, and a third group with the second ground divided into a first half and a second half. The requests in the first group and first half of the second group are routed by a first set of center interconnection units, and the requests of the second half of the second group are routed by a second set of center interconnection units. The requests of the third group are routed through the first and second set of interconnection units so long as their load capacity is not exceeded, while any remaining small requests are routed through a third set of interconnection units.
Inventors
- 👤 Ding-Zhu Du
- 👤 Biao Gao
- 👤 Frank Kwangming Hwang
- 👤 Jeong Han Kim
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 08:53
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/25; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04Q3/00; H04Q3/64; H04Q3/68; H04L49/10; H04L49/101; H04L49/15; H04L49/1515
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
165 words
A rearrangeable non-blocking network comprising: an input stage, said input stage comprising r input switches and n inlet links for each of said r input switches, said n inlet links for receiving one or more requests; an output stage, said output stage comprising r' output switches and n' outlet links for each of said r' output switches, said n' outlet links for transmitting said received requests; and a center stage for routing said one or more requests from said input stage to said output stage, said center stage comprising between 3N and substantially the next largest integer of (41N-E N )/16 center interconnection units where N equals the greater of n and n', wherein E n equals 8, 5,6, 3, if N is congruent to mod4(0, 1, 2, 3) r first internal links coupling each of said center interconnection units to each of said r input switches and r' second internal links coupling each of said output switches to each of said center interconnection units.
Claim 2
Dependent Claim
165 words
A rearrangeable non-blocking network comprising: an input stage, said input stage comprising r input switches and n inlet links for each of said r input switches, said n inlet links for receiving one or more requests; an output stage, said output stage comprising r' output switches and n' outlet links for each of said r' output switches, said n' outlet links for transmitting said received requests; and a center stage for routing said one or more requests from said input stage to said output stage, said center stage comprising between 3N and substantially the next largest integer of (41N-E N )/16 center interconnection units where N equals the greater of n and n', wherein E n equals 8, 5,6, 3, if N is congruent to mod4(0, 1, 2, 3) r first internal links coupling each of said center interconnection units to each of said r input switches and r' second internal links coupling each of said output switches to each of said center interconnection units.
Claim 3
Dependent Claim
22 words
A network according to claim 1 wherein said r input switches and r' output switches are substantially the same number of switches.
Claim 4
Dependent Claim
26 words
A network according to claim 1 wherein said n inlet links and n' outlet links are substantially the same number of links and N equals n.
Claim 5
Dependent Claim
24 words
A network according to claim 1 wherein each of said center stage interconnection units further comprises one or more center stage rearrangeable non-blocking networks.
Claim 6
Dependent Claim
160 words
A network according to claim 4 wherein each of said center stage rearrangeable non-blocking networks comprises: an input stage, said input stage comprising a input switches and b inlet links for each of said a input switches, said b inlet links for receiving one or more requests; an output stage, said output stage comprising a' output switches and b' outlet links for each of said a' output switches, said b' outlet links for outputting said received requests; a center stage for routing said one or more requests from said input stage to said output stage, said center stage comprising between 3N and substantially the next largest integer of (41N-E N )/16 center interconnection units where N equals the greater of b and b', a first internal links connecting each of said center interconnection units to each of said a input switches and a' second internal links connecting each of said output switches to each of said a' center interconnection units.
Claim 7
Dependent Claim
18 words
A network according to claim 1 wherein each of said center interconnection units is an r×r' interconnection switch.
Claim 8
Dependent Claim
16 words
A network according to claim 6 wherein said r×r' interconnection switch is an r×r' crossbar switch.
Claim 9
Dependent Claim
121 words
A network according to claim 1 wherein each of said received requests has a load associated therewith, wherein said inlet links, have a first load capacity and said first internal links have a second load capacity, said first load capacity being greater than said second load capacity, and wherein said center stage further comprises P sets of between 3N and substantially the next largest integer of (41N-E N )/16 center interconnection units, where P equals the nearest integer ratio of first load capacity to second load capacity, each of said P sets of between 3N and substantially the next largest integer of (41N-E N )/16 center interconnection units to route 1/P of each of said received requests to said output stage.
Claim 10
Independent Claim
176 words
A method for routing one or more requests between an input stage of switches and an output stage of switches in a multirate rearrangeable non-blocking network, said method comprising the steps of: receiving said requests at one of r input switches of said input stage, through one of n inlet links at each of said r input switches; transmitting said requests at one of r' output switches of said output stage, through one of n' outlet links at each of said r' output switches; and routing each of said requests from said input switch to said output switch through one or more center interconnection units numbering between 3N and substantially the next largest integer of (41N-E N )/16 where N equals the greater of n and n', wherein E N equals 8, 5, 6, 3, if N is congruent to mod4(0, 1, 2, 3) said center interconnection units are coupled to each of said r input switches through r first internal links, and coupled to each of said r' output switches through r' second internal links.
Claim 11
Independent Claim
176 words
A method for routing one or more requests between an input stage of switches and an output stage of switches in a multirate rearrangeable non-blocking network, said method comprising the steps of: receiving said requests at one of r input switches of said input stage, through one of n inlet links at each of said r input switches; transmitting said requests at one of r' output switches of said output stage, through one of n' outlet links at each of said r' output switches; and routing each of said requests from said input switch to said output switch through one or more center interconnection units numbering between 3N and substantially the next largest integer of (41N-E N )/16 where N equals the greater of n and n', wherein E N equals 8, 5, 6, 3, if N is congruent to mod4(0, 1, 2, 3) said center interconnection units are coupled to each of said r input switches through r first internal links, and coupled to each of said r' output switches through r' second internal links.
Claim 12
Dependent Claim
20 words
A method according to claim 9 wherein each of said center interconnection units comprise one or more rearrangeable non-blocking networks.
Claim 13
Independent Claim
266 words
A method for routing one or more requests, each of said requests having a load, in a multirate rearrangeable non-blocking network having an input stage, a center stage, and an output stage, wherein said center stage comprises one or more center interconnection units, each of said center interconnection units having one or more first internal links to said input stage and one or more second internal links to said output stage, and each of said first internal and second internal links having a request load capacity said method comprising the steps of: grouping each of said requests by load size, so that all large load size requests comprise a first group, all medium load size requests comprise a second group and all small load size requests comprise a third group; dividing said medium load size requests of said second group into a first half and a second half; routing each of said requests of said first group and said first half of said second group to a first set of interconnection switches of said center stage; routing each of said requests of said second half of said second group to a second set of interconnection units of said center stage; routing each of said requests of said third group to those of said first internal links of said first and second sets of interconnection units whose load capacity will not be exceeded by carrying said requests of said third group; and routing said requests of said third group not routed to said first and second sets of interconnection units, to a third set of interconnection units.
Claim 14
Independent Claim
266 words
A method for routing one or more requests, each of said requests having a load, in a multirate rearrangeable non-blocking network having an input stage, a center stage, and an output stage, wherein said center stage comprises one or more center interconnection units, each of said center interconnection units having one or more first internal links to said input stage and one or more second internal links to said output stage, and each of said first internal and second internal links having a request load capacity said method comprising the steps of: grouping each of said requests by load size, so that all large load size requests comprise a first group, all medium load size requests comprise a second group and all small load size requests comprise a third group; dividing said medium load size requests of said second group into a first half and a second half; routing each of said requests of said first group and said first half of said second group to a first set of interconnection switches of said center stage; routing each of said requests of said second half of said second group to a second set of interconnection units of said center stage; routing each of said requests of said third group to those of said first internal links of said first and second sets of interconnection units whose load capacity will not be exceeded by carrying said requests of said third group; and routing said requests of said third group not routed to said first and second sets of interconnection units, to a third set of interconnection units.
Claim 15
Dependent Claim
135 words
A method according to claim 11 wherein said input stage comprises r input switches and n inlet links for each of said r input switches, each of said n inlet links for receiving one or more requests, wherein said output stage comprises r' output switches and n' outlet links for each of said r' output switches, said n' outlet links for outputting one or more of said received requests, and wherein said center stage comprises between 3N and substantially the next largest integer of (41N-E N )/16 center interconnection units, where N equals the greater of n and n', r first internal links coupling each of said center interconnection units to each of said r input switches and r' second internal links coupling each of said output switches to each of said center interconnection units.
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-25 | 2002-07-27 | 2003-01-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-01-25 | 2006-07-27 | 2007-01-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-01-25 | 2010-07-27 | 2011-01-26 | $7700.00 | Window Closed / Lapsed |