Re-routing traffic in a communications network
First Claim
1. A method of re-routing traffic in a communications network operating in a hierarchical tree structure where the network traffic is sent from an ingress node to a plurality of egress nodes, wherein the ingress node is a root node of the tree structure and the egress nodes are leaf nodes of the tree structure, and wherein in the event of a fault on a path across the network, the method comprising:
- determining, by a first node located between the fault and the ingress node, whether the first node is capable of autonomously switching traffic to an alternative sub-tree;
as a consequence of the first node determining that the first node is unable to switch traffic to an alternative sub-tree, sending, by the first node, a fault notification signal upstream to a second node located upstream of the first node, wherein the second node is not the ingress node;
as a consequence of the first node determining that the first node is able to switch traffic to an alternative sub-tree, determining whether the first node is capable of switching traffic from an initial sub-tree to an alternative sub-tree which avoids the fault; and
as a consequence of the first node is determining that the first node is not capable of switching traffic to an alternative sub-tree which avoids the fault, sending, by the first node, a fault notification signal upstream to the second node, and autonomously determining whether the second node is capable of switching traffic to an alternative sub-tree which avoids the fault,wherein the communications network is configured to provide an E-tree service to at least part of the nodes of the communications network, wherein the ingress node is a node responsible for distribution of the E-tree service within the communications network and the egress nodes are nodes attached to destinations of the E-tree service.
1 Assignment
0 Petitions
Accused Products
Abstract
Method of re-routing traffic in a communications network (1) in the event of a fault (3) on a path across the network, the method comprising, determining whether a first node (4), located between the fault and a network ingress node (6), is capable of switching traffic to an alternative path which avoids the fault, and if the first node is determined to be not so capable, then determining whether a second node (8), located upstream of the first node, is capable of switching traffic to an alternative path which avoids the fault.
183 Citations
18 Claims
-
1. A method of re-routing traffic in a communications network operating in a hierarchical tree structure where the network traffic is sent from an ingress node to a plurality of egress nodes, wherein the ingress node is a root node of the tree structure and the egress nodes are leaf nodes of the tree structure, and wherein in the event of a fault on a path across the network, the method comprising:
-
determining, by a first node located between the fault and the ingress node, whether the first node is capable of autonomously switching traffic to an alternative sub-tree; as a consequence of the first node determining that the first node is unable to switch traffic to an alternative sub-tree, sending, by the first node, a fault notification signal upstream to a second node located upstream of the first node, wherein the second node is not the ingress node; as a consequence of the first node determining that the first node is able to switch traffic to an alternative sub-tree, determining whether the first node is capable of switching traffic from an initial sub-tree to an alternative sub-tree which avoids the fault; and as a consequence of the first node is determining that the first node is not capable of switching traffic to an alternative sub-tree which avoids the fault, sending, by the first node, a fault notification signal upstream to the second node, and autonomously determining whether the second node is capable of switching traffic to an alternative sub-tree which avoids the fault, wherein the communications network is configured to provide an E-tree service to at least part of the nodes of the communications network, wherein the ingress node is a node responsible for distribution of the E-tree service within the communications network and the egress nodes are nodes attached to destinations of the E-tree service. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A communications network operating in a hierarchical tree structure where the network traffic is sent from an ingress node to a plurality of egress nodes, wherein the ingress node is a root node of the tree structure and the egress nodes are leaf nodes of the tree structure, the communications network comprising:
-
a plurality of nodes which are connected by respective links to form a tree for traffic across the network, the nodes comprising at least one re-routing node configured to; determine that a fault has occurred between the re-routing node and a network egress node, determine if the re-routing node is able to autonomously switch traffic onto an alternative sub-tree, send a fault notification signal upstream to an upstream node located upstream of the re-routing node as a consequence of the re-routing node determining that the re-routing node is unable to switch traffic to an alternative sub-tree, wherein the upstream node is not the ingress node; determine whether the re-routing node is capable of switching traffic to an alternative sub-tree which avoids the fault as a consequence of the re-routing node determining that the re-routing node is able to switch traffic to an alternative sub-tree; send a fault notification signal upstream to the upstream node as a consequence of determining that the re-routing node is not capable of switching traffic to an alternative sub-tree which avoids the fault, and autonomously determine whether the upstream node is capable of switching traffic to an alternative sub-tree which avoids the fault, wherein the communications network is configured to provide an E-tree service to at least part of the nodes of the communications network, wherein the ingress node is a node responsible for distribution of the E-tree service within the communications network and the egress nodes are nodes attached to destinations of the E-tree service. - View Dependent Claims (11, 12, 13, 14, 15)
-
-
16. A first node for use in a communications network operating in a hierarchical tree structure where the network traffic is sent from an ingress node to a plurality of egress nodes, wherein the ingress node is a root node of the tree structure and the egress nodes are leaf nodes of the tree structure, the node comprising:
-
a plurality of hardware interfaces and a processor collectively configured to; determine that a fault in the network has occurred; determine whether the first node is capable of causing traffic to be autonomously switched to an alternative sub-tree, send a fault notification signal upstream to an upstream node located upstream of the first node as a consequence of determining that the first node is unable to switch traffic to an alternative sub-tree, wherein the upstream node is not the ingress node; determine whether the first node is capable of switching traffic to an alternative sub-tree which avoids the fault as a consequence of determining that the first node is able to switch traffic to an alternative sub-tree; send a fault notification signal upstream to the upstream node as a consequence of determining that the first node is not capable of switching traffic to an alternative sub-tree which avoids the fault, and autonomously determine whether the upstream node is capable of switching traffic to an alternative sub-tree which avoids the fault, wherein the communications network is configured to provide an E-tree service to at least part of the nodes of the communications network, wherein the ingress node is a node responsible for distribution of the E-tree service within the communications network and the egress nodes are nodes attached to destinations of the E-tree service. - View Dependent Claims (17, 18)
-
Specification