Method and system for establishing content-flexible connections in a communications network

• US 6,735,170 B1
• Filed: 03/31/2000
• Issued: 05/11/2004
• Est. Priority Date: 03/31/2000
• Status: Expired due to Fees

• Current Assignee: Ciena Corporation
• Original Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Inventors: Roberts, Kim B.
• Primary Examiner(s): Kizou, Hassan
• Assistant Examiner(s): Swickhamer, Christopher M
• Application Number:
  US09/539,707
• Time in Patent Office: 1,502 Days
• Field of Search: 370/235-238, 370/535-543, 370/230, 370/351, 370/465
• US Class Current: 370/230
• CPC Class Codes: H04J 2203/0066 Signalling, e.g. protocols, reference model
• CPC Class Codes: H04J 2203/0067 Resource management and 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/0478 Provisions for broadband connections

Abstract

A method for establishing connections along a network route, including determining a capacity and a set of concatenation constraints, and allocating selected resources along the route to allow the delivery of any combination of signals satisfying the set of concatenation constraints and having a total capacity not exceeding the determined capacity. Also disclosed is a method of establishing at least one higher layer connection (HLC) within a lower layer connection (LLC), including determining a first capacity and a first set of concatenation constraints associated with the LLC; establishing the LLC by allocating selected resources along the route to allow the delivery of any combination of signals satisfying the first set of concatenation constraints and having a total capacity not exceeding the first capacity; and, for each HLC, using a respective subset of the allocated resources to carry a respective combination of signals satisfying a respective set of second concatenation constraints which is a subset of the first set of concatenation constraints.

Claims

1. A method of establishing a connection along a route in a network, comprising:

determining a capacity associated with the connection;

determining a set of concatenation constraints associated with the connection; and

allocating selected resources along the route to allow the delivery of any combination of signals satisfying the determined set of concatenation constraints and having a total capacity not exceeding the determined capacity.

2. A method as claimed in claim 1, wherein the concatenation constraints are satisfied by a particular combination of signals if the particular combination of signals only includes signals selected from a pre-determined group of signals.

3. A method as claimed in claim 2, wherein the pre-determined group of signals includes at least one concatenated signal.

4. A method as claimed in claim 2, wherein the pre-determined group of signals includes at least one non-concatenated signal.

5. A method as claimed in claim 2, wherein the pre-determined group of signals includes at least one concatenated signal and at least one non-concatenated signal.

6. A method as claimed in claim 5, wherein the at least one concatenated signal includes an STS-Mc signal for an integer M and wherein the at least one non-concatenated signal includes an STS-N signal for an integer N.

7. A method as claimed in claim 2, wherein said route traverses at least one node in the network and wherein the method further comprises, before the step of allocating selected resources:

determining, from the determined capacity and the determined set of concatenation constraints, a set of hardware requirements associated with each node along the route.

8. A method as claimed in claim 7, wherein the step of allocating selected resources comprises, for each node along the route:

(1) identifying an external connection pattern which is consistent with the route;

(2) identifying a distribution of node-level resources which allows the hardware requirements associated with the node to be met; and

(3) allocating the distribution of node-level resources identified at step (2).

9. A method as claimed in claim 8, wherein step (2) comprises:

(a) identifying an internal connection pattern through the node which is consistent with the external connection pattern, said internal connection pattern being associated with a distribution of node-level resources;

(b) determining if the hardware requirements associated with the node can be met by applying the identified internal connection pattern; and

(c) if so, proceeding to step (3) using the distribution of node-level resources associated with the identified internal connection pattern;

otherwise

(i) identifying another internal connection pattern through the node which is consistent with the external connection pattern and which is associated with another distribution of node-level resources; and

(ii) repeating steps (b) and (c).

10. A method as claimed in claim 9, wherein said node-level resources include switching and processing resources.

11. A method as claimed in claim 9, wherein each node comprises a plurality of interconnected shelves and wherein step (b) comprises, for each shelf:

(B1) identifying a shelf-level connection pattern which is consistent with the internal connection pattern, said shelf-level connection pattern being associated with a respective distribution of shelf-level resources;

(B2) determining, from the hardware requirements associated with the node, a set of hardware requirements associated with the shelf;

(B3) determining if the hardware requirements associated with the shelf can be met by applying the identified shelf-level connection pattern; and

(B4) if so, allocating the distribution of shelf-level resources associated with the identified shelf-level connection pattern and proceeding to step (c);

otherwise

(i) identifying another shelf-level connection pattern through the node which is consistent with the internal connection pattern and which is associated with another distribution of shelf-level resources; and

(ii) repeating steps (B3) and (B4).

12. A method as claimed in claim 11, further comprising:

(B5) if no shelf-level connection pattern is capable of meeting the hardware requirements associated with the shelf, signaling this fact at the node level.

13. A method as claimed in claim 1, wherein the concatenation constraints are satisfied by a combination of signals if that combination only includes:

signals selected from a first pre-determined group of signals;

or

sub-combinations of signals which satisfy a second set of concatenation constraints;

wherein said second set of concatenation constraints is satisfied by a sub-combination of signals if that sub-combination only includes signals selected from a second pre-determined group of signals.

14. A method as claimed in claim 13, wherein the first pre-determined group of signals includes at least one concatenated signal.

15. A method as claimed in claim 13, wherein the first pre-determined group of signals includes at least one non-concatenated signal.

16. A method as claimed in claim 13, wherein the first pre-determined group of signals includes at least one concatenated signal and at least one non-concatenated signal.

17. A method as claimed in claim 16, wherein the at least one concatenated signal includes an STS-Mc signal for an integer M and wherein the at least one non-concatenated signal includes an STS-N signal for an integer N.

18. A method as claimed in claim 13, wherein the second pre-determined group of signals includes at least one concatenated signal.

19. A method as claimed in claim 13, wherein the second pre-determined group of signals includes at least one non-concatenated signal.

20. A method as claimed in claim 13, wherein the second pre-determined group of signals includes at least one concatenated signal and at least one non-concatenated signal.

21. A method as claimed in claim 20, wherein the at least one concatenated signal includes an STS-Mc signal for an integer M and wherein the at least one non-concatenated signal includes an STS-N signal for an integer N.

22. A method as claimed in claim 13, wherein said route traverses at least one node in the network and wherein the method further comprises, before the step of allocating selected resources:

determining, from the determined capacity and the first set of concatenation constraints, a set of hardware requirements associated with each node along the route.

23. A method as claimed in claim 22, wherein the step of allocating selected resources comprises, at each node along the route:

(1) identifying an external connection pattern which is consistent with the route;

(2) identifying a distribution of node-level resources which allows the hardware requirements associated with the node to be met; and

(3) allocating the distribution of node-level resources identified at step (2).

24. A method as claimed in claim 23, wherein step (2) comprises:

(a) identifying an internal connection pattern through the node which is consistent with the external connection pattern, said internal connection pattern being associated with a distribution of node-level resources;

(b) determining if the hardware requirements associated with the node can be met by applying the identified internal connection pattern; and

(c) if so, proceeding to step (3) using the distribution of node-level resources associated with the identified internal connection pattern;

otherwise

(i) identifying another internal connection pattern through the node which is consistent with the external connection pattern and which is associated with another distribution of node-level resources; and

(ii) repeating steps (b) and (c).

25. A method as claimed in claim 24, wherein said node-level resources include switching and processing resources.

26. A method as claimed in claim 24, wherein each node comprises a plurality of interconnected shelves and wherein step (b) comprises:

(B1) identifying a shelf-level connection pattern which is consistent with the internal connection pattern, said shelf-level connection pattern being associated with a respective distribution of shelf-level resources;

(B2) determining, from the hardware requirements associated with the node, a set of hardware requirements associated with the shelf;

(B3) determining if the hardware requirements associated with the shelf can be met by applying the identified shelf-level connection pattern; and

(B4) if so, allocating the distribution of shelf-level resources associated with the identified shelf-level connection pattern and proceeding to step (c);

otherwise

(i) identifying another shelf-level connection pattern through the node which is consistent with the internal connection pattern and which is associated with another distribution of shelf-level resources; and

(ii) repeating steps (B3) and (B4).

27. A method as claimed in claim 26, further comprising:

(B5) if no shelf-level connection pattern is capable of meeting the hardware requirements, signaling this fact at the node level.

28. A method as claimed in claim 1, further comprising:

transmitting a combination of signals along the route, wherein the transmitted combination of signals satisfies said set of concatenation constraints.

29. A method as claimed in claim 28, wherein each of the signals in the transmitted combination of signals is a frame-based signal.

30. A method as claimed in claim 28, further comprising:

at the end points of the route, altering the composition of the transmitted combination of signals, wherein the altered transmitted combination of signals still satisfies the set of concatenation constraints.

31. A method of processing a request for establishing a connection along a route in a network, wherein said route traverses at least one node, said request being indicative of a capacity and a set of concatenation constraints associated with the connection, the method comprising:

determining, from the capacity and from the set of concatenation constraints, a set of hardware requirements associated with each node;

for each node along the route, identifying an external connection pattern which is consistent with the route; and

sending to each node the external connection pattern and the set of hardware requirements associated therewith.

32. A method of processing, at a node, a request for establishing a connection through the node, said request being indicative of an external connection pattern and a set of hardware requirements associated with the node, the method comprising:

(a) identifying an internal connection pattern involving sub-node-level components which is consistent with the external connection pattern, said internal connection pattern being associated with a distribution of node-level resources;

(b) sending the hardware requirements associated with the node and the internal connection pattern to the sub-node-level components;

(c) determining whether the hardware requirements associated with the node can be met by applying the identified internal connection pattern; and

(d) if so, allocating the distribution of node-level resources associated with the identified internal connection pattern;

otherwise

(i) identifying another internal connection pattern which is consistent with the external connection pattern and which is associated with another distribution of node-level resources; and

(ii) repeating steps (b), (c) and (d).

33. A method of processing, at a sub-node-level component, a request for establishing a connection through the component, said request being indicative of an internal connection pattern and a set of hardware requirements associated with the component, the method comprising:

(a) identifying a sub-node-level connection pattern which is consistent with the internal connection pattern, said sub-node-level connection pattern being associated with a respective distribution of sub-node-level-level resources;

(b) determining if the hardware requirements associated with the component can be met by applying the identified sub-node-level connection pattern; and

(c) if so, allocating the distribution of sub-node-level resources associated with the identified sub-node-level connection pattern;

otherwise

(i) identifying another sub-node-level connection pattern through the node which is consistent with the internal connection pattern and which is associated with another distribution of sub-node-level resources; and

(ii) repeating steps (b) and (c).

34. An article of manufacture, comprising:

a computer usable medium having computer readable program code means embodied therein for causing a controller to process a request for establishing a connection along a route in a network, wherein said route traverses at least one node, said request being indicative of a capacity and a set of concatenation constraints associated with the connection, the computer readable program code means in said article of manufacture comprising;

computer readable program code means for causing a computer to determine, from the capacity and from the set of concatenation constraints, a set of hardware requirements associated with each node;

computer readable program code means for causing a computer to identify, for each node along the route, an external connection pattern which is consistent with the route; and

computer readable program code means for causing a computer to send to each node the external connection pattern and the set of hardware requirements associated therewith.

35. An article of manufacture, comprising:

a computer usable medium having computer readable program code means embodied therein for causing a node controller to process a request for establishing a connection through the node, said request being indicative of an external connection pattern and a set of hardware requirements associated with the node, the computer readable program code means in said article of manufacture comprising;

computer readable program code means for causing a computer to identify an internal connection pattern involving sub-node-level components which is consistent with the external connection pattern, said internal connection pattern being associated with a distribution of node-level resources; and

computer readable program code means for causing a computer to;

(a) send the hardware requirements associated with the node and the internal connection pattern to the sub-node-level components to determine whether the hardware requirements associated with the node can be met by applying the identified internal connection pattern; and

(b) if so, to allocate the distribution of node-level resources associated with the identified internal connection pattern;

otherwise to identify another internal connection pattern which is consistent with the external connection pattern and which is associated with another distribution of node-level resources and to repeat steps (a) and (b).

36. An article of manufacture, comprising:

a computer usable medium having computer readable program code means embodied therein for causing a sub-node-level controller to process a request for establishing a connection through the component, said request being indicative of an internal connection pattern and a set of hardware requirements associated with the component, the computer readable program code means in said article of manufacture comprising;

computer readable program code means for causing a computer to identify a sub-node-level connection pattern which is consistent with the internal connection pattern, said sub-node-level connection pattern being associated with a respective distribution of sub-node-level-level resources; and

computer readable program code means for causing a computer to;

(a) determine if the hardware requirements associated with the component can be met by applying the identified sub-node-level connection pattern; and

(b) if so, to allocate the distribution of sub-node-level resources associated with the identified sub-node-level connection pattern;

otherwise to identify another sub-node-level connection pattern through the node which is consistent with the internal connection pattern and which is associated with another distribution of sub-node-level resources and to repeat steps (a) and (b).

37. A controller for processing a request for establishing a connection along a route in a network, wherein said route traverses at least one node, said request being indicative of a capacity and a set of concatenation constraints associated with the connection, comprising:

means for determining, from the capacity and from the set of concatenation constraints, a set of hardware requirements associated with each node;

means for identifying, for each node along the route, an external connection pattern which is consistent with the route; and

means for sending to each node the external connection pattern and the set of hardware requirements associated therewith.

38. A node controller for processing a request for establishing a connection through the node, said request being indicative of an external connection pattern and a set of hardware requirements associated with the node, comprising:

means for identifying an internal connection pattern involving sub-node-level components which is consistent with the external connection pattern, said internal connection pattern being associated with a distribution of node-level resources; and

means for;

(a) sending the hardware requirements associated with the node and the internal connection pattern to the sub-node-level components to determine whether the hardware requirements associated with the node can be met by applying the identified internal connection pattern; and

(b) if so, allocating the distribution of node-level resources associated with the identified internal connection pattern;

otherwise identifying another internal connection pattern which is consistent with the external connection pattern and which is associated with another distribution of node-level resources; and

repeating steps (a) and (b).

39. A sub-node-level controller for processing a request for establishing a connection through the component, said request being indicative of an internal connection pattern and a set of hardware requirements associated with the component, comprising:

means for identifying a sub-node-level connection pattern which is consistent with the internal connection pattern, said sub-node-level connection pattern being associated with a respective distribution of sub-node-level resources; and

means for;

(a) determining if the hardware requirements associated with the component can be met by applying the identified sub-node-level connection pattern; and

(b) if so, allocating the distribution of sub-node-level resources associated with the identified subnode-level connection pattern;

otherwise identifying another sub-node-level connection pattern through the node which is consistent with the internal connection pattern and which is associated with another distribution of sub-node-level resources; and

repeating steps (a) and (b).

40. A method of establishing at least one higher layer connection within a lower layer connection in a network, comprising:

determining a first capacity associated with the lower layer connection;

determining a first set of concatenation constraints associated with the lower layer connection;

establishing the lower layer connection by allocating selected resources along the route to allow the delivery of any combination of signals satisfying the first set of concatenation constraints and having a total capacity not exceeding the first capacity; and

for each of the at least one higher layer connection, using a respective subset of the allocated resources to carry a respective combination of signals satisfying a respective set of second concatenation constraints which is a subset of the first set of concatenation constraints.

41. A method as claimed in claim 40, wherein the combination of signals associated with each higher layer connection has a total capacity not exceeding the first capacity.

42. A method as claimed in claim 40, wherein the lower layer connection is associated with a first route having end points and wherein each higher layer connection is associated with a respective second route having respective end points, wherein at least one second route is longer than the first route.

43. A method as claimed in claim 40, wherein the method further comprises:

at the end points of the second route, altering the respective composition of the transmitted combination of signals, wherein the altered transmitted combination of signals still satisfies the respective second set of concatenation constraints.