Routing in a private network with compression
AssigneeAlcatel
InventorsCao Thanh Phan, Lahcen Bennai
Life of this patent
Estimating the term…
Loading patent…
AssigneeAlcatel
InventorsCao Thanh Phan, Lahcen Bennai
Estimating the term…
The invention concerns a method of routing between a source node and a destination node in a network having nodes connected by links, compression being used on at least one of said links, the method comprising at least two routing calculation steps for a given number of compressions, i.e. in a plane P(v). A routing calculation step for a given number of compressions uses information obtained during a routing calculation step for a number of compressions less than said given number. In this way a cost function can be minimized whilst assuring that in the route obtained the total number of compressions remains less than a maximum value. The route can be calculated for a given number of compressions using the Dijkstra algorithm and verifying the number of compressions when adding a node to the route. In this case, on reaching a link for which the given number of compressions is exceeded, the distance to the source node is saved for a subsequent calculation step.
A method of routing between a source node and a destination node in a network having nodes connected by links, wherein at least one link uses signal compression and the remaining links do not use signal compression, wherein the method comprises:
A method of routing between a source node and a destination node in a network having nodes connected by links, wherein at least one link uses signal compression and the remaining links do not use signal compression and the network further comprises overflow links to an external network, wherein the method comprises:
A method of routing between a source node and a destination node in a network having nodes connected by links, wherein at least one link uses signal compression and the remaining links do not use signal compression, wherein the method comprises:
A method of routing between a source node and a destination node in a network having nodes connected by links, wherein at least one link uses signal compression and the remaining links do not use signal compression and the network further comprises overflow links to an external network, wherein the method comprises:
Dependencies are inferred from the claim text.