Method and system for multi-layer network routing
View Patent ↗Each node of a telecommunications network determines a connection type attributes available for each signal type supported by the node. Each signal type represents a different connection routing layer within the telecommunications network. Adaptation costs involved in traversing from one connection routing layer to another connection routing layer in the node are calculated. The connection type attributes and adaptation costs are included in a link state advertisement broadcasted by each node in the telecommunications network. A route calculation is performed for a desired signal to determine a route through the telecommunications network for the signal. The route calculation takes into account the various connection type attributes, availability, and adaptation costs in determining the shortest route for the signal through the telecommunications network.
1. A computer-implemented method for routing in a network, the method comprising:
establishing a pseudo node that represents potential connectivity provided by a server layer among nodes in a client layer of a multi-layer network;
creating one or more link state advertisements at a first node in the client layer as if the one or more link state advertisements were generated by the pseudo node itself, the one or more link state advertisements including information about a link between the first node and the pseudo node;
transmitting the one or more link state advertisements from the first node in the client layer to at least one other node in the client layer; and
enabling one or more connections among two or more nodes in the client layer via the pseudo node.
2. The method of claim 1 , wherein enabling the one or more connections among the two or more nodes in the client layer via the pseudo node includes enabling the one or more connections among the two or more nodes that cannot otherwise be connected to each other in the client layer.
3. The method of claim 1 further including:
assigning a node identifier to the pseudo node, the node identifier serving to correlate all the links advertised relative to the pseudo node as having a common switching point through which signals can be routed.
4. The method of claim 1 , wherein creating the one or more link state advertisements includes omitting details of connectivity of the server layer.
5. The method of claim 1 , wherein transmitting the one or more link state advertisements involves using distributed flooding protocols.
6. The method of claim 1 , wherein transmitting the one or more link state advertisements includes providing information about connectivity among the two or more nodes in the client layer without providing details of connectivity of the server layer to the two or more nodes in the client layer.
7. The method of claim 1 further including:
calculating a route from the first node to a second node via the pseudo node.
8. The method of claim 1 further including:
routing a signal from the first node to a second node in the client layer via the pseudo node, the second node being isolated from the first node in the client layer.
9. The method of claim 1 further including:
establishing the server layer and the client layer in the multi-layer network, the server layer providing trunk capability for the client layer.
10. The method of claim 1 , wherein the server layer is unaware of connectivity available within the client layer and the client layer is unaware of connectivity available within the server layer.
11. A non-transitory computer readable medium including code for determining a route calculation in a multi-layer network, the code to be executed by a computer operable to:
establish a pseudo node that represents potential connectivity provided by a server layer among nodes in a client layer of a multi-layer network;
create one or more link state advertisements at a first node in the client layer as if the one or more link state advertisements were generated by the pseudo node itself, the one or more link state advertisements including information about a link between the first node and the pseudo node;
transmit the one or more link state advertisements from the first node in the client layer to at least one other node in the client layer; and
enable one or more connections among two or more nodes in the client layer via the pseudo node.
12. The computer readable medium of claim 11 , wherein the code is further operable to:
enable the one or more connections among the two or more nodes in the client layer via the pseudo node by enabling the one or more connections among the two or more nodes that cannot otherwise be connected to each other in the client layer.
13. The computer readable medium of claim 11 , wherein the code is further operable to:
assign a node identifier to the pseudo node, the node identifier serving to correlate all the links advertised relative to the pseudo node as having a common switching point through which signals can be routed.
14. The computer readable medium of claim 11 , wherein the code is further operable to:
omit details of connectivity of the server layer from the one or more link state advertisements.
15. The computer readable medium of claim 11 , wherein the code is further operable to:
use distributed flooding protocols to transmit the one or more link state advertisements.
16. The computer readable medium of claim 11 , wherein the code is further operable to:
provide information about connectivity among the two or more nodes in the client layer without providing details of connectivity of the server layer to the two or more nodes in the client layer.
17. The computer readable medium of claim 11 , wherein the code is further operable to:
calculate a route from the first node to a second node via the pseudo node.
18. The computer readable medium of claim 11 , wherein the code is further operable to:
route a signal from the first node to a second node in the client layer via the pseudo node, the second node being isolated from the first node in the client layer.
19. The computer readable medium of claim 11 , wherein the code is further operable to:
establish the server layer and the client layer in the multi-layer network, the server layer providing trunk capability for the client layer.
20. The computer readable medium of claim 11 , wherein the server layer is unaware of connectivity available within the client layer and the client layer is unaware of connectivity available within the server layer.
21. A system for routing in a network, the system comprising:
means for establishing a pseudo node that represents potential connectivity provided by a server layer among nodes in a client layer of a multi-layer network;
means for creating one or more link state advertisements at a first node in the client layer as if the one or more link state advertisements were generated by the pseudo node itself, the one or more link state advertisements including information about a link between the first node and the pseudo node;
means for transmitting the one or more link state advertisements from the first node in the client layer to at least one other node in the client layer; and
means for enabling one or more connections among two or more nodes in the client layer via the pseudo node.
22. The system of claim 21 further including:
means for assigning a node identifier to the pseudo node, the node identifier serving to correlate all the links advertised relative to the pseudo node as having a common switching point through which signals can be routed.
23. The system of claim 21 further including:
means for calculating a route from the first node to a second node via the pseudo node.
24. The system of claim 21 further including:
means for routing a signal from the first node to a second node in the client layer via the pseudo node, the second node being isolated from the first node in the client layer.
25. The system of claim 21 further including:
means for establishing the server layer and the client layer in the multi-layer network, the server layer providing trunk capability for the client layer.
26. The method of claim 1 , wherein the pseudo node is defined by one or more nodes in the server layer, and the pseudo node is located at a different node in a topology from the nodes in the client layer.
27. The method of claim 1 , wherein the pseudo node is defined by a plurality of nodes in the server layer.
28. The method of claim 1 , wherein the server layer and the client layer use different signal types.
29. The method of claim 1 , wherein transmitting the one or more link state advertisements from the first node in the client layer to the at least one other node in the client layer is achieved through broadcasting.
30. The method of claim 1 , wherein enabling the one or more connections among the two or more nodes in the client layer via the pseudo node is achieved through routing between a pair of nodes.
31. A computer-implemented network, comprising:
a pseudo node, the pseudo node being configured to:
represent potential connectivity provided by a server layer among nodes in a client layer of a multi-layer network;
receive one or more link state advertisements created at a first node in the client layer as if the one or more link state advertisements were generated by the pseudo node itself, the one or more link state advertisements including information about a link between the first node and the pseudo node;
transmit the one or more link state advertisements from the first node in the client layer to at least one other node in the client layer; and
enable one or more connections among two or more nodes in the client layer.