US5325090A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Three-stage, at least doubled atm switching network
Assignee: Siemens AG
•
Filing: 1992-03-02
•
Granted: 1994-06-28
•
Expires: 2012-03-02
Abstract
Abstract Three-stage, at least doubled ATM switching network. A method for expanding a three-stage, stretched and at least doubled ATM self-routing switching network, the switching matrices of the second switching stage can be respectively doubled in one redundancy level after another without interrupting operation given a simultaneous, respective halving of the plurality and filling of link groups formed from the very outset and proceeding between the first switching stage, the second switching stage and the third switching stage, of which link groups only links of one and the same group of links are occupied for every connection lasting during an expansion of the switching network.
Inventors
- 👤 Ernst-Heinrich Goeldner
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 02:28
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L49/00; H04L49/10; H04L49/104; H04L49/105; H04L49/106; H04L49/15; H04L49/1553; H04L49/1576; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
456 words
A three-stage, at least doubled ATM self-routing switching network, having switching matrices, every switching matrix of a first switching stage and of a third switching stage, each of the first and third switching stages respectively having a switching matrices given full configuration of the switching network, connectable to input ports or output ports and to links and every switching matrix of a middle switching stage connectable to the links, every switching matrix of the middle switching stage having b switching matrices, given full configuration of the switching network, being connected to every switching matrix of the first or third switching stage, via at least one link, comprising: given connection of each switching matrix of the middle switching stage to 2 k groups of links where k is a whole number and where k=..., 2, 1, 0, every switching matrix of the middle switching stage is connected to every switching matrix of every neighboring switching stage via at least one respective link of each of the 2 k groups of links; given partial configuration of the switching network, the second switching stage having only b/t switching matrices, where t=2.sup. j and j=..., 2, 1 where j is a whole number, that are connected to each of a maximum of b/t switching matrices of every neighboring switching stage via respectively t groups of links whereof, given an expansion of the switching network to b/e switching matrices in the middle switching stage and a maximum of b/e switching matrices in the respectively neighboring switching stage, only respectively e groups of links, where e=2 j and i=..., 2, 1, 0 where i is a whole number; i<j, remain between previously existing switching matrices from the partial configuration that are filled out by links connecting the previously existing switching matrices of the second switching stage to added switching of the first or third switching stage, and further t-e groups of links connect added switching matrices of the middle switching stage to the previously existing switching matrices of every neighboring switching stage, via respectively e groups of links whose line locations in the switching matrices that the further t-e groups connect to one another are identical to the line locations that original links, that do not remain between previously existing switching matrices, had in the switching matrices connected to one another by the original links in the previous partial configuration and that are correspondingly filled up by links connecting the added switching matrices of the second switching stage to added switching matrices of the first and third switching stages; and only links of one and the same group of links being occupied in every switching matrix of the middle switching stage for every connection lasting during an expansion of the switching network.
Claim 2
Dependent Claim
456 words
A three-stage, at least doubled ATM self-routing switching network, having switching matrices, every switching matrix of a first switching stage and of a third switching stage, each of the first and third switching stages respectively having a switching matrices given full configuration of the switching network, connectable to input ports or output ports and to links and every switching matrix of a middle switching stage connectable to the links, every switching matrix of the middle switching stage having b switching matrices, given full configuration of the switching network, being connected to every switching matrix of the first or third switching stage, via at least one link, comprising: given connection of each switching matrix of the middle switching stage to 2 k groups of links where k is a whole number and where k=..., 2, 1, 0, every switching matrix of the middle switching stage is connected to every switching matrix of every neighboring switching stage via at least one respective link of each of the 2 k groups of links; given partial configuration of the switching network, the second switching stage having only b/t switching matrices, where t=2.sup. j and j=..., 2, 1 where j is a whole number, that are connected to each of a maximum of b/t switching matrices of every neighboring switching stage via respectively t groups of links whereof, given an expansion of the switching network to b/e switching matrices in the middle switching stage and a maximum of b/e switching matrices in the respectively neighboring switching stage, only respectively e groups of links, where e=2 j and i=..., 2, 1, 0 where i is a whole number; i<j, remain between previously existing switching matrices from the partial configuration that are filled out by links connecting the previously existing switching matrices of the second switching stage to added switching of the first or third switching stage, and further t-e groups of links connect added switching matrices of the middle switching stage to the previously existing switching matrices of every neighboring switching stage, via respectively e groups of links whose line locations in the switching matrices that the further t-e groups connect to one another are identical to the line locations that original links, that do not remain between previously existing switching matrices, had in the switching matrices connected to one another by the original links in the previous partial configuration and that are correspondingly filled up by links connecting the added switching matrices of the second switching stage to added switching matrices of the first and third switching stages; and only links of one and the same group of links being occupied in every switching matrix of the middle switching stage for every connection lasting during an expansion of the switching network.
Claim 3
Dependent Claim
39 words
The three-stage, at least doubled ATM self-routing switching network according to claim 1, wherein only respective links of one and the same group of links are occupied in every switching matrix of the middle switching stage for individual connections.
Claim 4
Independent Claim
607 words
A method for expanding a three-stage, at least doubled ATM switching network having switching matrices, wherein every switching matrix of a first switching stage and a third switching stage each respectively having a switching matrices given full configuration of the switching network, is connectable to input ports or output ports and to links and every wherein every switching matrix of the middle switching stage is connectable to the links, whereby every switching matrix of the middle switching stage having b switching matrices, given full configuration of the switching network, is connected to every switching matrix of the first or third switching stage, via at least one link, comprising the steps of: (a) when wiring each switching matrix of the middle switching stage to 2 k groups of links, where k is a whole number and where k =..., 2, 1, 0, connecting every switching matrix of the middle switching stage to every switching matrix of every neighboring switching stage via at least respectively one link of each of the 2 k groups of links; (b) given partial configuration of the switching network, providing the second switching stage having only b/t switching matrices, where t=2 j and j=..., 2, 1 where j is a whole number, that are connected to each of a maximum of b/t switching matrices of every neighboring switching stage via respectively t groups of links whereof, given an expansion of the switching network to b/e switching matrices in the middle switching stage and a maximum of b/e switching matrices in the respectively neighboring switching stage, leaving only respectively e groups of links, where e=2 i and i=..., 2, 1, 0 where i is a whole number; i<j, between previously existing switching matrices from the partial configurations that are filled out by links connecting the previously existing switching matrices of the second switching stage to added switching matrices of the first or third switching stage, and providing further t-e groups of lines that connect the added switching matrices of the middle switching stage to the previously existing switching matrices of every neighboring switching stage via respectively e groups of links whose lines locations in the switching matrices that the further t-e groups connect to one another are identical to the line locations that original links, that do not remain between previously existing switching matrices, had in the switching matrices connected to one another by the original links in the previous partial configuration and that are correspondingly filled up by links connecting the added switching matrices of the second switching stage to added switching matrices of the first and third switching stages, wherein only links of one and the same group of links are occupied in every switching matrix of the middle switching stage for every connection lasting during an expansion of the switching network; (c) taking out of service one redundancy level of a doubled switching network; (d) expanding the one level by adding b/e-b/t switching matrices in the middle switching stage and connecting every added switching matrix of the middle switching stage to every switching matrix of the first or third switching stage via at least respectively one link of at least one group of links, whose line locations in the switching matrices that they connect to one another are the same as the line location of the links not remaining between previously existing switching matrices, in the expansion in the switching matrices connected to one another by the original links in the previous partial configuration level; and (e) after a return of said one redundancy level into service, going to step (c) for the other redundancy level or levels of the switching network.
Claim 5
Independent Claim
607 words
A method for expanding a three-stage, at least doubled ATM switching network having switching matrices, wherein every switching matrix of a first switching stage and a third switching stage each respectively having a switching matrices given full configuration of the switching network, is connectable to input ports or output ports and to links and every wherein every switching matrix of the middle switching stage is connectable to the links, whereby every switching matrix of the middle switching stage having b switching matrices, given full configuration of the switching network, is connected to every switching matrix of the first or third switching stage, via at least one link, comprising the steps of: (a) when wiring each switching matrix of the middle switching stage to 2 k groups of links, where k is a whole number and where k =..., 2, 1, 0, connecting every switching matrix of the middle switching stage to every switching matrix of every neighboring switching stage via at least respectively one link of each of the 2 k groups of links; (b) given partial configuration of the switching network, providing the second switching stage having only b/t switching matrices, where t=2 j and j=..., 2, 1 where j is a whole number, that are connected to each of a maximum of b/t switching matrices of every neighboring switching stage via respectively t groups of links whereof, given an expansion of the switching network to b/e switching matrices in the middle switching stage and a maximum of b/e switching matrices in the respectively neighboring switching stage, leaving only respectively e groups of links, where e=2 i and i=..., 2, 1, 0 where i is a whole number; i<j, between previously existing switching matrices from the partial configurations that are filled out by links connecting the previously existing switching matrices of the second switching stage to added switching matrices of the first or third switching stage, and providing further t-e groups of lines that connect the added switching matrices of the middle switching stage to the previously existing switching matrices of every neighboring switching stage via respectively e groups of links whose lines locations in the switching matrices that the further t-e groups connect to one another are identical to the line locations that original links, that do not remain between previously existing switching matrices, had in the switching matrices connected to one another by the original links in the previous partial configuration and that are correspondingly filled up by links connecting the added switching matrices of the second switching stage to added switching matrices of the first and third switching stages, wherein only links of one and the same group of links are occupied in every switching matrix of the middle switching stage for every connection lasting during an expansion of the switching network; (c) taking out of service one redundancy level of a doubled switching network; (d) expanding the one level by adding b/e-b/t switching matrices in the middle switching stage and connecting every added switching matrix of the middle switching stage to every switching matrix of the first or third switching stage via at least respectively one link of at least one group of links, whose line locations in the switching matrices that they connect to one another are the same as the line location of the links not remaining between previously existing switching matrices, in the expansion in the switching matrices connected to one another by the original links in the previous partial configuration level; and (e) after a return of said one redundancy level into service, going to step (c) for the other redundancy level or levels of the switching network.
Claim 6
Independent Claim
465 words
A method for expanding a three-stage, at least doubled ATM self-routing switching network having switching matrices, wherein every switching matrix of a first switching stage and a third switching stage each respectively having a switching matrices, given full configuration of the switching network, is connectable to input ports or output ports and to links and wherein every switching matrix of the middle switching stage is connectable to the links, whereby every switching matrix of the middle switching stage having b switching matrices, given full configuration of the switching network, is connected to every switching matrix of the first or third switching stage, via at least one link, comprising the steps of: (a) when wiring each switching matrix of the middle switching stage to 2 k groups of links, where k is a whole number and where k=..., 2, 1, 0, connecting every switching matrix of the middle switching stage to every switching matrix of every neighboring switching stage via at least respectively one link of each of the 2 k groups of links; (b) given partial configuration of the switching network, providing the second switching stage having only b/t switching matrices, where t=2 j and j=..., 2, 1 where j is a whole number, that are connected to each of a maximum of b/t switching matrices of every neighboring switching stage via respectively t groups of links whereof, given an expansion of the switching network to b/e switching matrices in the middle switching stage and a maximum of b/e switching matrices in the respectively neighboring switching stage, leaving only respectively e groups of links, where e=2 i and i=..., 2, 1, 0 where i is a whole number; i<j, between previously existing switching matrices from the partial configurations that are filled out by links connecting the previously existing switching matrices of the second switching stage to added switching matrices of the first or third switching stage, and providing further t-e groups of lines that connect the added switching matrices of the middle switching stage to the previously existing switching matrices of every neighboring switching stage via respectively e groups of links whose line locations in the switching matrices that the further t-e groups connect to one another are identical to the line locations that original links, that do not remain between previously existing switching matrices, had in the switching matrices connected to one another by the original links in the previous partial configuration and that are correspondingly filled up by links connecting the added switching matrices of the second switching stage to added switching matrices of the first and third switching stages, wherein only links of one and the same group of links are occupied in every switching matrix of the middle switching stage for every connection lasting during an expansion of the switching network.
Claim 7
Independent Claim
465 words
A method for expanding a three-stage, at least doubled ATM self-routing switching network having switching matrices, wherein every switching matrix of a first switching stage and a third switching stage each respectively having a switching matrices, given full configuration of the switching network, is connectable to input ports or output ports and to links and wherein every switching matrix of the middle switching stage is connectable to the links, whereby every switching matrix of the middle switching stage having b switching matrices, given full configuration of the switching network, is connected to every switching matrix of the first or third switching stage, via at least one link, comprising the steps of: (a) when wiring each switching matrix of the middle switching stage to 2 k groups of links, where k is a whole number and where k=..., 2, 1, 0, connecting every switching matrix of the middle switching stage to every switching matrix of every neighboring switching stage via at least respectively one link of each of the 2 k groups of links; (b) given partial configuration of the switching network, providing the second switching stage having only b/t switching matrices, where t=2 j and j=..., 2, 1 where j is a whole number, that are connected to each of a maximum of b/t switching matrices of every neighboring switching stage via respectively t groups of links whereof, given an expansion of the switching network to b/e switching matrices in the middle switching stage and a maximum of b/e switching matrices in the respectively neighboring switching stage, leaving only respectively e groups of links, where e=2 i and i=..., 2, 1, 0 where i is a whole number; i<j, between previously existing switching matrices from the partial configurations that are filled out by links connecting the previously existing switching matrices of the second switching stage to added switching matrices of the first or third switching stage, and providing further t-e groups of lines that connect the added switching matrices of the middle switching stage to the previously existing switching matrices of every neighboring switching stage via respectively e groups of links whose line locations in the switching matrices that the further t-e groups connect to one another are identical to the line locations that original links, that do not remain between previously existing switching matrices, had in the switching matrices connected to one another by the original links in the previous partial configuration and that are correspondingly filled up by links connecting the added switching matrices of the second switching stage to added switching matrices of the first and third switching stages, wherein only links of one and the same group of links are occupied in every switching matrix of the middle switching stage for every connection lasting during an expansion of the switching network.
Claim 8
Dependent Claim
160 words
The method for expanding a three-stage, at least doubled ATM switching network according to claim 4, wherein the method further comprises the steps of: (c) taking out of service one redundancy level of a doubled switching network; and (d) adding b/e-b/t switching matrices in the middle switching stage and connecting every added switching matrix of the middle switching stage to every switching matrix of the first or third switching stage via at least respectively one link of at least one group of links, whose line locations in the switching matrices that they connect to one another are the same as the line locations of the links not remaining between previously existing switching matrices in the expansion in the switching matrices connected to one another by the original links in the previous partial configuration level; and (e) after a return of said one redundancy level into service, going to (c) for the other redundancy level or levels of the switching network.
References Cited (Backward Citations)
US3729591A
Cited
US4400627A
Cited
US4983961A
Cited
EP0384961A2
Cited
EP0384936B1
Cited
US5103220A
Cited
EP0412343A2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-06-27 | 1997-12-27 | 1998-06-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-06-27 | 2001-12-27 | 2002-06-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-06-27 | 2005-12-27 | 2006-06-28 | $7700.00 | Window Closed / Lapsed |