Cross-connect multirate/multicast SDH/SONET rearrangement procedure and cross-connect using same

• US 5,987,027 A
• Filed: 11/08/1996
• Issued: 11/16/1999
• Est. Priority Date: 11/08/1996
• Status: Expired due to Fees

• Current Assignee: Alcatel SA (Nokia Corporation)
• Original Assignee: Alcatel SA (Nokia Corporation)
• Inventors: Owen, Henry Walter Lilly, Zegura, Ellen Witte, Park, Won Bae
• Primary Examiner(s): Chan, Jason
• Assistant Examiner(s): KWOH, JASPER C
• Application Number:
  US08/745,379
• Time in Patent Office: 1,103 Days
• Field of Search: 370/351, 370/357, 370/358, 370/360, 370/369, 370/370, 370/380, 370/386, 370/388, 370/907
• US Class Current: 370/360
• CPC Class Codes: H04J 2203/0019 Multicast/broadcast capabilities
• CPC Class Codes: H04J 2203/0041 Star, e.g. cross-connect, concentrator, subscriber group equipment, remote electronics
• CPC Class Codes: H04J 2203/0069 Channel allocation
• CPC Class Codes: H04J 3/1611 Synchronous digital hierarchy [SDH] or SONET H04J3/1664 takes precedence for interactions with OTN
• CPC Class Codes: H04Q 11/04 for time-division multiplexing H04Q11/0001 takes precedence
• CPC Class Codes: Y10S 370/907 Synchronous optical network, SONET

Abstract

A connection procedure for finding by rearrangement a path for multirate, multicast traffic through an SDH cross-connect with subnetwork connection protection. If no free path for a new payload through the SDH switching hardware is available, the switching procedure looks for a path that is adequate and blocked by the least existing payload capacity. If the hunt is successful, the procedure rearranges the existing connections to make possible a path for the new payload. The procedure does not interrupt the existing connections; thus it is a "hitless" procedure. Connections for existing payloads that must be moved to make way for the new payload are queued and the connection procedure is applied recursively, to each in turn, until the queue is empty.

Claims

1. A method for finding a path for a composite signal through a switching matrix the switching matrix having only switching elements any of which are potentially available for use as part of a connection for the signal, the method for use even when all possible paths through the switching matrix are blocked, the signal requiring a certain bandwidth and so a certain fraction of the throughput capacity of the switching matrix, each of the possible paths constituting a set of connections from an input switch, through the switching matrix, to an output switch, the switching matrix carrying existing signals on existing paths created by having made existing connections, the method comprising the steps of:

1) searching for the path only among possible paths that do not require rearranging any existing connections, and, if the path is found, using the path for the new signal;

2) if the path is not found in step 1, picking as a target path a partially blocked possible path through the switching matrix, the partially blocked possible path blocked by some existing connections carrying some existing signals requiring less bandwidth than the new signal; and

3) finding a different path for each existing signal carried by existing connections of the target path by recursively applying steps 1-2, with each existing signal carried by existing connections of the target path treated, in turn, as the new signal in steps 1-2;

wherein the searching for the path considers only paths providing a bandwidth adequate for the signal without fragmenting the signal into components.

2. A method as claimed in claim 1, further comprising the step of:

4) repeating the recursive applying of step 3 for existing signals having progressively smaller bandwidth.

3. A method as clained in claim 2, further comprising the steps of:

5) stopping the recursive applying of step 3 for existing signals having progressively smaller bandwidth upon reaching an existing signal for which a target path cannot be found that is blocked by signals of even smaller bandwidth; and

6) repeatedly trying another possible path for the target path for the new signal, until all possible paths are exhausted.

4. A method for finding a path for a new composite signal through a switching matrix the switching matrix having only switching elements any of which are potentially available for use as part of a connection for the signal, even when all possible paths through the switching matrix are blocked, the signal consisting of consecutive frames, each frame consisting of consecutive slots, the switching matrix having an input stage array consisting of a plurality of input switches (I_N, where N=0, 1, . . . , r₁), a middle stage array consisting of a plurality of middle switches (M₁, M₂, . . . , M_m), and an output stage array consisting of a plurality of output switches (O_N, where N=0, 1, . . . , r₂), and having existing connections for carrying existing signals, the new signal requiring a certain bandwidth, and arriving at input switch I_x and destined for output switch O_y, the path for the new signal consisting of connections of selected slots across a selected middle switch from an input switch to an output switch, the method using one of the existing signals or the new signal as a desired signal for which connections are to be rearranged or made in finding the path for the new signal, and taking initially the new signal as the desired signal, the method comprising the steps of:

1) searching for a free path for the desired signal, and, if said free path is found, using said free path for the desired signal, but if said free path is not found, generating a list of possible paths from the paths already searched, sorted by how blocked each possible path is;

2) for each path in the list of possible paths, selecting as a target path (I_x, M_z C, O_y) the next least blocked path, the target path comprising a middle switch M_z selected from the plurality of middle switches (M₁, M₂, . . . , M_m) and a connecting channel C made up of slots some of which must be freed, said slots that make up the connecting channel C also making up channels hierarchically under the connecting channel, the channels hierarchically under the connecting channel being free or not free depending on whether the slots making them up are all free or not all free respectively;

3) queuing the channels that are hierarchically under the connecting channel C and that are not free; and

4) recursively applying steps 1-3 for each queued channel, so as to find another path for that queued channel

wherein in searching for a free path and in generating a list of possible paths, only paths consisting of consecutive slots are considered.

5. A method as claimed in claim 4, wherein, in searching for a target path at some level of recursion below a first application of steps 1-3, each level of recursion having a target path, no path is considered for use as the target path if the path includes part of a target path at any higher level of recursion up to and including the first application of steps 1-3.

6. A method as claimed in claim 4, wherein the recursive applying of steps 1-3 is performed without disturbing existing connections by using a middle switch reserved for rearranging connections.

7. A method as claimed in claim 4, wherein a multirate signal, consisting of a plurality of time slots, which are used in various combinations to provide various rates of information transmission, is represented using a hierarchical structure that indicates whether a time slot of the signal is used, not used, or hierarchically used, thereby allowing all time slots in a level of the hierarchical structure to be switched to another path with one switching operation.

8. A method as claimed in claim 4, wherein, in determining the target path, only contiguous channels are considered, up to and including the number of channels required for the new connection.

9. A method as claimed in claim 4, wherein the search for the free path without rearrangement is performed by traversing the middle stage array in a direction depending on how much bandwidth is needed, so that even when multiple solutions exist, there is more efficient use of switching hardware.

10. A method as claimed in claim 4, wherein if the new signal needs a connection from an input switch to more than one output port, the search is made, according to steps 1-4, for a connection from the input switch to each output port constrained by a requirement that each connection pass through the same middle switch, and wherein the search producing a list of possible paths sorted in order of blocking is conducted by finding a combination of connections having the greatest free bandwidth between the input switch and all the output ports, thereby providing multicast connections even if existing connections must be rearranged.

11. A method as claimed in claim 4, wherein when a 1×

2 SNCP connection is required for the new signal, the method further comprises the step of;

treating the 1×

2 SNCP connection as a multicast connection constrained by a requirement that each connection of the multicast connection pass through the same middle switch,

thereby allowing 1×

2 SNCP connections with multicasting for multirate signals connected through the switching matrix.

12. A method as claimed in claim 4, wherein when a 2×

1 SNCP connection is required, which designates two input sources, I₁ and I₂, each carrying a copy of the same new signal intended for the output destination O, the method further comprises the steps of;

finding two paths, one for the copy of the new signal from each input source I₁ and I₂, to the same middle switch of a target path, with a timing relationship in which the two paths use adjacent channels through the same middle switch, or, if the two input sources are ports on a different input switch, a timing relationship in which the two paths use the same channel or adjacent channels, and

rearranging existing connections using five trials executed in turn, each of said five trials searching for a path for the new signal by rearranging as few existing connections as possible, while preserving the timing relationship between the two copies of the signal, the five trials comprising the steps of;

trial 1, searching for a first path and a second path, the first path from input source I₁ to the output destination O, and the second path from input source I₂ to the output destination O, wherein the first path and the second path are to use a same middle switch and a same connecting channel, and wherein the same middle switch and the same connecting channel are chosen so as to make the first path and the second path the least blocked paths from the input sources I₁ and I₂ to the output destination O, attempting to free, by rearrangement, all channels that are hierarchically under the connecting channel and that are blocking the path from the first input source I₁, and, if successful, attempting to free the channels that are hierarchically under the connecting channel and that are blocking the path from the second input source I₂ ;

in trial 2, attempted only if trial 1 fails, searching for the least blocked path from the first input source I₁ through a middle switch and a connecting channel to the output destination O, without regard for a path from the second input source I₂, attempting to free, by rearrangement, all channels that are hierarchically under the connecting channel and that are blocking the path from I₁, and, if successful, attempting to free, by rearrangement, the channels that are hierarchically under the connecting, channel and that are blocking the path from I₂ ;

in trial 3, attempted only if trials 1-2 fail, and only if trial 2 resulted in freeing the path from I₁, attempting to free, by rearrangement, the path from I₂ through the same middle switch but using an adjacent connecting channel;

in trials 4 and 5, attempted only if trials 1-3 fail, performing the same steps as trials 2 and 3, but with I₁ and I₂ interchanged,

thereby allowing 2×

1 SNCP connections with multicasting for multirate signals connected through the switching matrix.

13. A switching matrix for providing a connection for a composite signal, the switching matrix having only switching elements any of which are potentially available for use as part of a connection for the signal, the switching matrix comprising

a stage of input switches,

a stage of output switches,

one or more stages of middle switches, and

means for finding a path for a signal from one of the input switches to one of the output switches even when all possible paths through the switching matrix are blocked, the signal requiring a certain bandwidth and therefore a certain fraction of the throughput capacity of the switching matrix, a path constituting a set of connections from an input switch, through the switching matrix, to an output switch, the switching matrix carrying existing signals on existing paths created by having made existing connections, said finding means having:

1) means for searching for the path for the new signal, wherein the path does not require rearranging any existing connections, and, if the path is found, using the path for the new signal;

2) means for picking as a target path a partially blocked possible path through the switching matrix, the partially blocked possible path blocked by some existing connections carrying some existing signals requiring less bandwidth than the new signal; and

3) means for finding a different path for each existing signal carried by existing connections of the target path, by recursively using the means for searching for the path for the new signal and the means for picking as a target path a possible path through the switching matrix, with each existing signal carried by existing connections of the target path treated, in turn, as the new signal

wherein the paths used are always paths providing a bandwidth adequate for the signal, for which a path is to be found, without fragmenting the signal into components.