Processing

Please wait...

PATENTSCOPE will be unavailable a few hours for maintenance reason on Tuesday 26.10.2021 at 12:00 PM CEST
Settings

Settings

Goto Application

1. WO2013149675 - APPARATUS AND METHOD FOR COMPUTING END-TO-END PATHS THROUGH A NETWORK COMPRISING A PLURALITY OF NETWORK DOMAINS

Note: Text based on automatic Optical Character Recognition processes. Please use the PDF version for legal matters

[ EN ]

CLAIMS

1 . A method of computing end-to-end paths through a network comprising a plurality of network domains, the method comprising the steps of:

computing a path segment within a network domain using a child path computation element associated with the network domain; and

computing an end-to-end path across a plurality of network domains using a parent path computation element that computes the end-to-end path in conjunction with the plurality of child path computation elements associated with the respective plurality of network domains.

2. A method as claimed in claim 1 , wherein a child path computation element computes a path segment within its respective network domain using topology information local to that network domain.

3. A method as claimed in claim 2, further comprising the step of forming a path segment within a network domain using a traffic engineering label switched path, TE-LSP.

4. A method as claimed in any one of the preceding claims, wherein the parent path computation element computes the end-to-end path by joining a plurality of path segments computed by a plurality of respective child path computation elements.

5. A method as claimed in claim 4, wherein the step of joining further comprises the steps of connecting an egress port and label of a first network domain to an ingress port and label of a second network domain.

6. A network architecture for enabling end-to-end paths to be computed across a plurality of network domains, the network architecture comprising: a plurality of child path computation elements associated with a plurality of respective network domains, each child path computation element adapted to compute a path segment within its respective network domain; and a parent path computation element adapted to compute an end-to-end path across a plurality of network domains in conjunction with the plurality of respective child path computation elements.

7. A network architecture as claimed in claim 6, wherein a child path computation element is further adapted to compute a path segment within its respective network domain using topology information local to that network domain.

8. A network architecture as claimed in claim 7, wherein a child path computation element is further adapted to form a path segment using a traffic engineering label switched path, TE-LSP.

9. A network architecture as claimed in any one of claims 6 to 8, wherein the parent path computation element is adapted to compute the end-to-end path by joining a plurality of path segments computed by a plurality of respective child path computation elements.

10. A path computation element for computing an end-to-end path across a network comprising a plurality of network domains, the path computation element comprising:

an interface unit for communicating with a plurality of child path computation elements, each of the child path computation elements associated with a respective network domain and adapted to compute a path segment within its respective network domain; and

a processing unit adapted to compute an end-to-end path across a plurality of network domains in conjunction with a plurality of child path computation elements.

1 1 . A path computation element as claimed in claim 10, wherein the processing unit is configured to compute the end-to-end path by joining a plurality of path segments computed by a plurality of respective child path computation elements.

12. A path computation element as claimed in claim 10 or 1 1 , wherein the interface unit is configured to receive limited information relating to the topology of the network, and wherein the processing unit is configured to compute the end-to-end path using the limited information, wherein the limited information relates to:

information relating to the edge nodes and/or boundary nodes of the plurality of network domains; and

information relating to the communication links coupling the plurality of network domains.

13. A path computation element as claimed in claim 12, wherein the processing unit is configured to compute the identity of border nodes of each network domain forming part of an end-to-end path, and configured to communicate the identity of the boundary nodes of each network domain to the respective child path computation element of the network domain.

14. An ingress node of a network domain, the ingress node forming part of a path segment within the network domain, the path segment forming part of an end-to-end path across a plurality of different network domains; the ingress node comprising:

an input interface configured to receive a traffic signal, a local path identifier and a global path identifier, wherein the local path identifier is computed by a child path computation element local to the network domain, and the global path identifier computed by a parent path computational element associated with a plurality of child path computation elements;

a processing unit adapted to establish a label switched path within the network domain for routing the traffic signal to an egress node of the network domain, the label switched path using the local path identifier to route the traffic signal to the egress node, and the global path identifier to link the path segment to the end-to-end path across the plurality of network domains, and

an output interface configured to transmit the traffic signal to the egress node of the network domain using the local path identifier.

15. An ingress node as claimed in claim 14, wherein the global path identifier comprises a call object identifier.

16. A method of computing a path segment within an ingress node of a network domain, the ingress node forming part of a path segment within the network domain, the path segment forming part of an end-to-end path across a plurality of different network domains, the method comprising the steps of:

receiving a traffic signal, a local path identifier and a global path identifier, wherein the local path identifier is computed by a child path computation element local to the network domain, and the global path identifier computed by a parent path computational element associated with a plurality of child path computation elements;

establishing a label switched path within the network domain for routing the traffic signal to an egress node of the network domain, the label switched path using the local path identifier to route the traffic signal to the egress node, and the global path identifier to link the path segment to the end-to-end path across the plurality of network domains; and

transmitting the traffic signal to the egress node of the network domain.

17. A method as claimed in claim 16, wherein the global path identifier is a call object identifier for the end-to-end path across multiple network domains.

18. An egress node of a network domain, the egress node forming part of a

path segment within the network domain, the path segment forming part of an end-to-end path across a plurality of different network domains; the egress node comprising:

an input interface configured to receive a label switched path signal from another node in the network domain, the label switched path signal comprising a local path identifier and a global path identifier, the local path identifier having been computed by a child path computation element associated with the network domain, and the global path identifier having been computed by a parent path computational element associated with a plurality of child path computation elements;

a processing unit adapted terminate the received label switched path signal, extract a traffic signal, and associate the global path identifier as an egress label for the traffic signal; and

an output interface configured to transmit the traffic signal to an ingress node of another network domain forming part of the end-to-end path, using the egress label.

19. An intermediate node of a network domain, the intermediate node forming part of a path segment within the network domain, the path segment forming part of an end-to-end path across a plurality of different network domains; the intermediate node comprising:

an input interface configured to receive a label switched path signal from another node in the network domain, the label switched path signal comprising a local path identifier and a global path identifier, the local path identifier having been computed by a child path computation element associated with the network domain, and the global path identifier having been computed by a parent path computational element associated with a plurality of child path computation elements;

a processing unit adapted to process the received label switched signal: and

an output interface configured to transmit the label switched path signal to

another node in the network domain using the local path identifier.