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;
generating a link state advertisement at a first node in the client layer as if the link state advertisement were generated by the pseudo node, the link state advertisement including information about a link between the first node and the pseudo node;
broadcasting the link state advertisement from the first node in the client layer to other nodes in the client layer; and
enabling routing between a pair of nodes in the client layer via the pseudo node.
2. The method of claim 1 , wherein enabling routing between the pair of nodes in the client layer via the pseudo node includes enabling routing between a pair of 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 generating the link state advertisement includes omitting details of connectivity of the server layer.
5. The method of claim 1 wherein broadcasting the link state advertisements involves using distributed flooding protocols.
6. The method of claim 1 wherein broadcasting the link state advertisement includes providing information about connectivity between pairs of nodes in the client layer without providing details of connectivity of the server layer to the pairs of nodes.
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 and the client layer are unaware of connectivity available within other layers.
11. 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;
generating a link state advertisement at a first node in the client layer, the link state advertisement including information about a link between the first node and the pseudo node and omitting information pertaining to coordination between proxy advertisers, the proxy advertisers being nodes in the client layer that generate link state advertisements including information about links with the pseudo node;
broadcasting the link state advertisement from the first node in the client layer to other nodes in the client layer; and
enabling routing between a pair of nodes in the client layer via the pseudo node.
12. 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;
generate a link state advertisement at a first node in the client layer as if the link state advertisement were generated by the pseudo node, the link state advertisement including information about a link between the first node and the pseudo node;
broadcast the link state advertisement from the first node in the client layer to other nodes in the client layer; and
enable routing between a pair of nodes in the client layer via the pseudo node.
13. The computer readable medium of claim 12 , wherein the code is further operable to:
enable routing between the pair of nodes in the client layer via the pseudo node by enabling routing between a pair of nodes that cannot otherwise be connected to each other in the client layer.
14. The computer readable medium of claim 12 , 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.
15. The computer readable medium of claim 12 , wherein the code is further operable to:
omit details of connectivity of the server layer from the link state advertisement.
16. The computer readable medium of claim 12 , wherein the code is further operable to:
use distributed flooding protocols to broadcast the link state advertisements.
17. The computer readable medium of claim 12 , wherein the code is further operable to:
provide information about connectivity between pairs of nodes in the client layer without providing details of connectivity of the server layer to the pairs of nodes.
18. The computer readable medium of claim 12 , wherein the code is further operable to:
calculate a route from the first node to a second node via the pseudo node.
19. The computer readable medium of claim 12 , 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.
20. The computer readable medium of claim 12 , 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.
21. The computer readable medium of claim 12 , wherein the server layer and the client layer are unaware of connectivity available within other layers.
22. 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;
generate a link state advertisement at a first node in the client layer, the link state advertisement including information about a link between the first node and the pseudo node and omit information from the link state advertisement pertaining to coordination between proxy advertisers, the proxy advertisers being nodes in the client layer that generate link state advertisements including information about links with the pseudo node;
broadcast the link state advertisement from the first node in the client layer to other nodes in the client layer; and
enable routing between a pair of nodes in the client layer via the pseudo node.