Method for rerouting in hierarchically structured networks

Claim 3

A method according to claim 1 characterised in that said local alternative path is calculated based on path information identifying said path within said peer group, including an identifier of said outgoing border node of said peer group for said connection, and stored in said entering border node of said peer group during set-up of said connection along said path.

Claim 4

A method according to claim 1 characterised in that in case said local alternative path cannot be found within said peer group, a distinct local alternative path is calculated within a restoration peer group including said peer group.

Claim 5

A method according to claim 1 characterised in that each distinct entering border node of each distinct peer group along said path stores distinct path information identifying said path within said each distinct peer group respectively and including an identifier of a respective distinct outgoing border node of said each distinct peer group along said path for said connection respectively, and so that said peer group is one of said each distinct peer groups and having the lowest hierarchical level at which said local alternative path exists.

Claim 6

A method according to claim 1 characterised in that in case of failure, said peer group includes said failure.

Claim 7

A method according to claim 5 characterised in that said local alternative path is further calculated based on an identifier of the location of said failure within said peer group.

Claim 8

A signalling procedure for setting up and rerouting a connection earlier set up and established between a first terminal coupled to a first node (A.1.2) and a second terminal coupled to a second node (C.2), said first node and said second node being part of a switching network hierarchically structured into a plurality of peer groups at at least two hierarchical levels, said earlier connection set up along a path calculated between said first node (A.1.2) and said second node (C.2) by the steps of sending a set-up message along said path, in the downstream direction from said first node (A.1.2) to said second node (C.2), sending, upon receipt of said set-up message by said second node (C.2), a connect message from said second node (C.2) to said first node (A.1.2) along said path in the upstream direction, said signalling method comprising the steps of: an outgoing border node of a peer group of said plurality, along said path, in the downstream direction determines, upon entering of said connect message within said peer group at said outgoing border node, a unique identifier for said outgoing border node of said peer group for said connection, and adds said unique identifier to said connect message, for further transmitting it to said first node, when said connect message leaves said peer group along said path in the upstream direction at an entering border node, extracting said unique identifier stored in said entering border node, and calculating a local alternative path within said peer group and setting up said local alternative path between said entering border node and said outgoing node of said peer group.

Claim 9

A signalling procedure for setting up and rerouting a connection earlier set up and established between a first terminal coupled to a first node (A.1.2) and a second terminal coupled to a second node (C.2), said first node and said second node being part of a switching network hierarchically structured into a plurality of peer groups at at least two hierarchical levels, said earlier connection set up along a path calculated between said first node (A.1.2) and said second node (C.2) by the steps of sending a set-up message along said path, in the downstream direction from said first node (A.1.2) to said second node (C.2), sending, upon receipt of said set-up message by said second node (C.2), a connect message from said second node (C.2) to said first node (A.1.2) along said path in the upstream direction, said signalling method comprising the steps of: an outgoing border node of a peer group of said plurality, along said path, in the downstream direction determines, upon entering of said connect message within said peer group at said outgoing border node, a unique identifier for said outgoing border node of said peer group for said connection, and adds said unique identifier to said connect message, for further transmitting it to said first node, when said connect message leaves said peer group along said path in the upstream direction at an entering border node, extracting said unique identifier stored in said entering border node, and calculating a local alternative path within said peer group and setting up said local alternative path between said entering border node and said outgoing node of said peer group.

Claim 10

A signalling procedure according to claim 7 characterised in that in case said local alternative path cannot be found within said peer group, a distinct local alternative path is calculated within a restoration peer group including said peer group.

Claim 11

A signalling procedure according to claim 7 characterised in that each distinct outgoing border node of each distinct peer group included in said plurality and along said path in the downstream direction, respectively determines, upon entering of said connect message within said each distinct peer group at said each distinct outgoing border node respectively, a distinct unique identifier for said each distinct outgoing border node for said each distinct peer group and for said connection, and adds said distinct unique identifier to said connect message, so that when said connect message leaves said each distinct peer group at a distinct entering border node respectively, said distinct unique identifier is extracted by and stored in said distinct entering border node respectively, and so that said peer group is one of said each distinct peer groups, having the lowest hierarchical level at which said alternative path exists.

Claim 12

A signalling procedure according to claim 7 characterised in that in case of failure along said path for said connection, said signalling procedure includes additional steps of sending, upon detecting of said failure by a downstream neighbouring node to said failure along said path, a downstream release message from said downstream neighbouring node to said second node(C.2), and upon detecting of said failure by an upstream neighbouring node to said failure along said path, an upstream release message from said upstream neighbouring node to said first node, so that said entering node of said peer group is located upstream to said failure location and so that said peer group includes said failure location, so that upon receipt of said upstream release message by said entering node of said peer group, said entering node blocks said upstream release message from further passing towards said first node, and so that upon receipt of said downstream release message by said outgoing node of said peer group, said outgoing node blocks said downstream release message from further passing towards said second node.

Claim 13

A signalling procedure according to claim 10 characterised in that said upstream release message and said downstream release message respectively include an upstream failure peer group identifier for an upstream failure peer group being one of said each distinct peer groups, wherein said failure was localised by said upstream neighbouring node, and a downstream failure peer group identifier for a downstream failure peer group being one of said each distinct peer groups wherein said failure was localised by said downstream neighbouring node, in that said peer group includes said upstream failure peer group, and said downstream failure peer group.

Claim 14

A signalling procedure according to claim 11 characterised in that said upstream release message further includes an identifier of the location of said failure within said upstream failure peer group.

Claim 15

An ingress node of a switching network hierarchically structured into a plurality of peer groups at at least two hierarchical levels, said network having a connection earlier set up and established between a first node and a second node, said earlier connection being set up along a path calculated between said first node and said second node, said ingress node including calculating means adapted to calculate part of a path for a connection within a peer group of which said ingress node forms the entering node in the downstream direction, characterised in that said calculating means is further adapted to calculate a local alternative path between said ingress node and an outgoing border node of said peer group along said path in the downstream direction if a failure is determined in the connection earlier set up.

Claim 16

An ingress node of a switching network hierarchically structured into a plurality of peer groups at at least two hierarchical levels, said network having a connection earlier set up and established between a first node and a second node, said earlier connection being set up along a path calculated between said first node and said second node, said ingress node including calculating means adapted to calculate part of a path for a connection within a peer group of which said ingress node forms the entering node in the downstream direction, characterised in that said calculating means is further adapted to calculate a local alternative path between said ingress node and an outgoing border node of said peer group along said path in the downstream direction if a failure is determined in the connection earlier set up.

Claim 17

An ingress node according to claim 13 characterised in that said ingress node further includes extracting means adapted to extract an identifier of said outgoing border node of said peer group, from an upstream connect message and memory means adapted to store said identifier of said outgoing border node of said peer group.

Claim 18

An ingress node according to claim 13 characterised in that said ingress node further includes release message blocking means for blocking a release message to further pass along said path.

Claim 19

An ingress node according to claim 13 characterised in that said ingress node includes switchover means adapted to interconnect a part of said path upstream to said ingress node, and said local alternative path.

Claim 20

An ingress node according to claim 13 characterised in that said extraction means is further adapted to extract a failure peer group identifier from said release message.

Claim 21

An ingress node according to claim 13 characterised in that said ingress node further includes message generating means adapted to generate a local set-up message including information concerning said local alternative path, said ingress node further includes transmission means adapted to transmit said local set-up message towards said outgoing border node of said peer group.

Claim 22

An ingress node according to claim 13 characterised in that said ingress node further includes means adapted to generate an upstream release message including a peer group identifier of the next higher level peer group including said peer group.

Claim 23

An egress node of a switching network hierarchically structured into a plurality of peer groups at at least two hierarchical levels, said network having a connection earlier set up and established between a first node and a second node, said earlier connection being set up along a path calculated between said first node and said second node, wherein a path is set up between a first node and a second node of said switching network, said egress node forming an outgoing border node of a peer group along said path in the downstream direction, characterised in that said egress node includes means adapted to block a downstream release message to further pass along a path if a failure is determined in the connection earlier set up.

Claim 24

An egress node of a switching network hierarchically structured into a plurality of peer groups at at least two hierarchical levels, said network having a connection earlier set up and established between a first node and a second node, said earlier connection being set up along a path calculated between said first node and said second node, wherein a path is set up between a first node and a second node of said switching network, said egress node forming an outgoing border node of a peer group along said path in the downstream direction, characterised in that said egress node includes means adapted to block a downstream release message to further pass along a path if a failure is determined in the connection earlier set up.

Claim 25

An egress node according to claim 20 characterised in that said egress node includes means adapted to determine a unique identifier for said egress node within said peer group for said connection, and includes means adapted to add said unique identifier to a connect message in the upstream direction.

Claim 26

An egress node according to claim 20 characterised in that said egress node includes release message extracting means adapted to extract an identifier of a downstream failure peer group from said downstream release message.

Claim 27

An egress node according to claim 22 characterised in that said egress node includes comparing means adapted to compare said identifier of said downstream failure peer group with part of said unique identifier identifying said peer group.

Claim 28

An egress node according to claim 20 characterised in that said egress node includes receiving means adapted to receive a local set-up message, and extracting means adapted to extract therefrom information concerning a local alternative path within said peer group.

Claim 29

An egress node according to claim 24 characterised in that said egress node includes switchover means adapted to interconnect a part of said path downstream to said egress node and said local alternative path.

Claim 30

An egress node according to claim 20 characterised in that said egress node further includes a timer, adapted to be triggered and initialised upon receipt of said downstream release message.

Claim 31

An egress node according to claim 20 characterised in that said egress node further includes downstream release message generating means adapted to generating a downstream release message including a peer group identifier of a peer group including said peer group at the next higher hierarchical level.

Claim 32

A fault determination node of a switching network being hierarchically structured into a plurality of peer groups at at least two hierarchical levels, said network having a connection earlier set up and established between a first node and a second node, said earlier connection being set up along a path calculated between said first node and said second node, said fault determination node including detecting means adapted to detect a failure occurring along a path set up for a connection between a first node and a second node of said switching network, said fault determination node further including release message generating means adapted to generate and transmit a release message along said path, characterised in that said fault determination node further includes peer group identification means adapted to determine a failure peer group identifier of a peer group including said failure, said release message generating means thereby being further adapted to add said failure peer group identifier to said release message.

Claim 33

A fault determination node of a switching network being hierarchically structured into a plurality of peer groups at at least two hierarchical levels, said network having a connection earlier set up and established between a first node and a second node, said earlier connection being set up along a path calculated between said first node and said second node, said fault determination node including detecting means adapted to detect a failure occurring along a path set up for a connection between a first node and a second node of said switching network, said fault determination node further including release message generating means adapted to generate and transmit a release message along said path, characterised in that said fault determination node further includes peer group identification means adapted to determine a failure peer group identifier of a peer group including said failure, said release message generating means thereby being further adapted to add said failure peer group identifier to said release message.