Widesense nonblocking switching networks

• US 5,945,922 A
• Filed: 09/06/1996
• Issued: 08/31/1999
• Est. Priority Date: 09/06/1996
• Status: Expired due to Term

• Current Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Original Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Inventors: Gao, Biao, Hwang, Frank Kwangming
• Primary Examiner(s): Horabik, Michael
• Assistant Examiner(s): WILSON JR, WILLIAM HALL
• Application Number:
  US08/711,697
• Time in Patent Office: 1,089 Days
• Field of Search: 340/825.8, 340/826, 340/825.03, 340/827, 340/825.02, 340/825.79, 370/388, 370/358, 370/357, 379/220, 379/271, 379/292, 379/306
• US Class Current: 340/2.22
• CPC Class Codes: H04L 49/1515 Non-blocking multistage, e.g. Clos
• CPC Class Codes: H04L 49/1569 Clos switching fabrics
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

A multirate network is Wide Sense Non Blocking with a new routing algorithm classifying requests into large, load greater than 1/(1+p), and small groups, where B is the upper load bound of any given request and p=.left brkt-bot.1/B.right brkt-bot.. Where B is less than 31/32-β/4, substantially 2βn(P+1)(B+p-1)/p2 center interconnection units are restricted for carrying large requests only. For all other B, substantially 2βn center interconnection units are restricted. Using this routing algorithm, general multirate WSNB is guaranteed with substantially the lesser of 2f(p)+1+3.75βn and 2nβ(P+1)(Bp+B+p-1)/p² interconnection units where n is the number of inlets per input stage switch, β is the ratio of load capacity of external links to the input and output stages, and the load capacity of the internal links connecting the center stage to the input and output stages. Where the network is a three-rate network then the center stage can be further reduced to 5n center interconnection units for β=1. The center stage can be even further reduced to 3n center interconnection units if the network is a two-rate network for β=1.

Claims

1. A multirate Wide Sense NonBlocking network comprising:

an input stage, said input stage comprising 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, each of said requests having an associated load with a value between an upper load bound B and a lower load bound b and each of said n inlet links having an external load capacity;

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 outputting said received requests and each of said n outlet links having said external load capacity; and

a center stage for routing said one or more requests from said input stage via a plurality of first internal links from each of said r input switches, to said output stage via a plurality of second internal links for each of said output switches, each of said first and second internal links having an internal load capacity, said center stage comprising substantially the lesser of 2f(β

)+1+3.75β

n or 2nβ

(p+1)(Bp+B+p-1)/p² center interconnection units where β

is the ratio of said internal load capacity to said external load capacity and p=.left brkt-bot.1/B.right brkt-bot..

2. A network according to claim 1 wherein each of said center stage WSNB nonblocking networks comprises an odd number multiple of three stage WSNB networks.

3. A network according to claim 1 wherein each of said center interconnection units is an r×

r interconnection switch.

4. A network according to claim 3 wherein said r×

r interconnection switch is an r×

r crossbar switch.

5. A network according to claim 1 wherein said substantially the lesser of 2f(β

)+1+3.75β

n or 2nβ

(1+p)(Bp+B+p-1)/p² center interconnection units comprise a plurality of center interconnection units restricted for routing requests having a load greater than 1/(1+p).

6. A network according to claim 5 wherein said plurality of restricted center interconnection units is substantially 2β

n(p+1)(B+B-1)/p² where B is less than approximately 31/32-β

/4 and 2β

n otherwise.

7. A three rate Wide Sense NonBlocking network, comprising:

an input stage, said input stage comprising 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, each of said requests having an associated load with a value between an upper load bound B and a lower load bound b and each of said n inlet links having an external load capacity;

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 outputting said received requests and each of said n outlet links having said external load capacity; and

a center stage for routing said one or more requests from said input stage via a plurality of first internal links from each of said r input switches, to said output stage via a plurality of second internal links for each of said output switches, each of said

first and second internal links having an internal load capacity, said center stage comprising substantially between 2n and 5n center interconnection units.

8. A network according to claim 7 wherein each of said center stage interconnection units further comprises an odd number multiple of WSNB networks.

9. A network according to claim 7 wherein said network is WSNB for small rates, medium rates and large rates, and wherein said large rates have a normalized value less than or equal to 0.5 and said center stage comprises substantially 3.75n center interconnection units.

10. A two rate Wide Sense NonBlocking Network, comprising:

an input stage, said input stage comprising 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, each of said requests having an associated load with a value between an upper load bound B and a lower load bound b and each of said n inlet links having an external load capacity;

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 outputting said received requests and each of said n outlet links having said external load capacity; and

a center stage for routing said one or more requests from said input stage via a plurality of first internal links from each of said r input switches, to said output stage via a plurality of second internal links for each of said output switches, each of said first and second internal links having an internal load capacity, said center stage comprising substantially between 2n and 3n center interconnection units.

11. A network according to claim 10 wherein each of said center stage interconnection units further comprises an odd number multiple of WSNB networks.

12. A method for routing one or more requests having a load between an upper bound B and a lower bound b, between an input stage of switches and an output stage of switches in a multi-rate Wide Sense NonBlocking 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, each of said n inlet links having an external load capacity;

outputting 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 each of said n outlet links having said external load capacity; and

routing said requests from said input stage via a plurality of first internal links from each of said input switches, to said output stage via a plurality of second internal links from each of said output switches, said first and second internal links having an internal link load capacity, through one or more of between 8n and substantially the lesser of 2f(β

)+1+3.75nβ and

2β

n(1+p)(Bp+B+p-1)/p² center interconnection units where β

is the ratio of said internal link load capacity to said external link load capacity and p=.left brkt-bot.1/B.right brkt-bot., said center interconnection units being connected to each of said r input switches through r first internal links, and connected to each of said r output switches through r second internal links.

13. A method according to claim 12 wherein said routing step further comprises the steps of:

grouping said requests having a load greater than 1/(p+1) into a large group, and all other of said requests into a small group;

routing said requests of said large group to substantially 2β

n(p+1)(B+p-1)/p² restricted units of said center interconnection units if B is less than approximately 31/32-β

/4, and to substantially 2f(β

)+1 restricted units of said center interconnection units for all other B; and

routing said requests of said small group to said center interconnection units other than said restricted units.

14. A method for routing one or more requests having a load between an upper bound B and a lower bound b, between an input stage of switches and an output stage of switches in a three-rate Wide Sense NonBlocking 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, each of said n inlet links having an external load capacity;

outputting 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 each of said n outlet links having said external load capacity; and

routing said requests from said input stage via a plurality of first internal links from each of said input switches, to said output stage via a plurality of second internal links from each of said output switches, said first and second internal links having an internal link load capacity, through one or more of substantially between 2n and 5n center interconnection units where β

is the ratio of said internal link load capacity to said external link load capacity, said center interconnection units being connected to each of said r input switches through r first internal links, and connected to each of said r output switches through r second internal links.

15. A method according to claim 14 wherein said lower bound b is greater than 0.5 and wherein said routing step utilizes one or more of substantially 2n center interconnection units.

16. A method according to claim 14 wherein said three rates comprise a first rate, a second rate and a third rate, said second rate greater than said first rate and said third rate greater than said second rate, and wherein said first rate is not greater than 0.5 and said second rate is greater than 0.5 and wherein said routing step further comprises the steps of:

routing all first rate requests through a first set of 2n center interconnection switches of said substantially between 2n and 5n center interconnection units; and

routing all secondary and third rate requests through a second set of 2n center interconnection switches of said substantially between 2n and 5n center interconnection units, said second set and said first set being mutually exclusive.

17. A method according to claim 14 wherein said three rates comprise a first rate, a second rate and a third rate, said second rate greater than said first rate and said third rate greater than said second rate, and wherein said second rate is not greater than 0.5, and said third rate is greater than 0.5 said routing step further comprising the steps of:

routing said third rate requests through a first set of 2n center interconnection units of said substantially between 2n and 5n center interconnection units; and

routing said first and second rates as follows;

grouping said requests having a load greater than 1/(p+1) into a large group and all other of said requests into a small group;

routing said requests of said large group and q₂ requests of said small group to x restricted units of said 3n center interconnection units, wherein the value of x substantially depends on q₁, q₂ and δ

, wherein δ

is equal to q₀ +q₂ -2q₁ and q₁, q₂ and q₀ are defined by the following inequalities;

space="preserve" listing-type="equation">q.sub.0 b≦

1<

(q.sub.0 +1)b

space="preserve" listing-type="equation">B+q.sub.1 b≦

1<

B+(q.sub.1 +1)b

space="preserve" listing-type="equation">2B+q.sub.2 b≦

1<

2B+(q.sub.2 +1)b

such that ##EQU12## where δ

equals 1;

##EQU13## where δ

equals 0 and q₁ is greater than 2q₂ +1;

##EQU14## where δ

=0 and q₁, equals 2q₂ ; and

##EQU15## where δ

equals -1; and

routing said requests of said small group other than said q₂ requests to said center interconnection units other than said restricted units.

18. A method according to claim 14 wherein said three rates comprise a first rate, a second rate and a third rate, said second rate greater than said first rate and said third rate greater than said second rate and wherein said third rate is less than 0.5, and wherein said substantially between 2n and 3n center interconnection units comprise 3.75n center interconnection units, said routing step further comprising the steps of:

grouping said requests having a load greater than 1/(p+1) into a large group, and all other of said requests into a small group;

routing said requests of said large group to substantially 2β

n(p+1)(B+p-1)/p² restricted units of said center interconnection units if B is less than approximately 31/32-β

/4, and to substantially 2f(β

)+1 restricted units of said center interconnection units for all other B; and

routing said requests of said small group to said center interconnection units other than said restricted units.

19. A method for routing one or more requests having a load between an upper bound B and a lower bound b, between an input stage of switches and an output stage of switches in a two-rate Wide Sense NonBlocking 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, each of said n inlet links having an external load capacity;

outputting 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 each of said n outlet links having said external load capacity; and

routing said requests from said input stage via a plurality of first internal links from each of said input switches, to said output stage via a plurality of second internal links from each of said output switches, said first and second internal links having an internal link load capacity, through one or more of substantially between 2n and 3n center interconnection units, said center interconnection units being connected to each of said r input switches through r first internal links, and connected to each of said r output switches through r second internal links.

20. A method according to claim 19 wherein said upper bound B is less than 0.5 and said lower bound b is greater than 0.333, said substantially between 2n and 3n center interconnection units comprising substantially 2n center interconnection units.

21. A method according to claim 19 wherein said lower bound b is not less than 0.5, said substantially between 2n and 3n center interconnection units comprising substantially 2n center interconnection units.

22. A method according to claim 19 wherein said upper bound B is not greater than 0.333 and wherein said substantially between 2n and 3n center interconnection units comprising substantially 3n center interconnection units, said routing step further comprising the steps of:

grouping said requests having a load greater than 1/(p+1) into a large group, and all other of said requests into a small group;

routing said requests of said large group to substantially 2β

n(p+1)(B+p-1)/p² restricted units of said center interconnection units if B is less than approximately 31/32-β

/4, and to substantially 2f(β

)+1 restricted units of said center interconnection units for all other B; and

routing said requests of said small group to said center interconnection units other than said restricted units.

23. A method according to claim 19 wherein said upper bound B is greater than 0.333 and less than 0.5 and said lower bound b is less than 0.333, said substantially between 2n and 3n center interconnection units comprising substantially 3n center interconnection units, said routing step further comprising the steps of:

grouping said requests having a load greater than 1/(p+1) into a large group and all other of said requests into a small group;

routing said requests of said large group and q₂ requests of said small group x restricted units of said 3n center interconnection units, wherein the value of x substantially depends on q₁, q₂ and δ

wherein δ

is equal to q₀ +q₂ -2q₁ and q₁, q₂ and q₀ are defined by the following inequalities;

space="preserve" listing-type="equation">q.sub.0 b≦

1<

(q.sub.0 +1)b

space="preserve" listing-type="equation">B+q.sub.1 b≦

1<

B+(q.sub.1 +1)b

space="preserve" listing-type="equation">2B+q.sub.2 b≦

1<

2B+(q.sub.2 +1)b

such that ##EQU16## where δ

equals 1;

##EQU17## where δ

equals 0 and q₁ is greater than 2q₂ +1;

##EQU18## where δ

=0 and q₁, equals 2q₂ ; and

##EQU19## where δ

equals -1; and

routing said requests of said small group other than said q₂ requests to said center interconnection units other than said restricted units.

24. A method according to claim 19 wherein said upper bound B is greater than 0.5 and said lower bound b is less than 0.5, said substantially between 2n and 3n center interconnection units comprising more than ##EQU20## for q₀ ≦

2q₁ and ##EQU21## for q₀ ≧

+2q₁ +1, said routing step further comprising the steps of;

grouping said requests having a load greater than 1(p+1) into a large group and all other of said requests into a small group;

routing said requests of said large group and q₁ requests of said small group x restricted units of said 3n center interconnection units, wherein the value of x substantially depends on q₁, q₂ and δ

wherein δ

is equal to q₀ +q₂ -2q₁, and q₁, q₂ and q₀ are defined by the following inequalities;

space="preserve" listing-type="equation">q.sub.0 b≦

1<

(q.sub.0 +1)b

space="preserve" listing-type="equation">B+q.sub.1 b≦

1<

B+(q.sub.1 +1)b

space="preserve" listing-type="equation">2B+q.sub.2 b≦

1<

2B+(q.sub.2 +1)b

such that ##EQU22## where δ

equals 1;

##EQU23## where δ

equals 0 and q₁ is greater than 2q₂ +1;

##EQU24## where δ

=0 and q₁, equals 2q₂ ; and

##EQU25## where δ

equals -1; and

routing said requests of said small group other than said q₁ requests to said center interconnection units other than said restricted units.