Device and a method for determining routing paths in a communication network in the presence of selection attributes
First Claim
1. A method of determining data routing paths in a communication network including a multiplicity of nodes (Nn), which method is characterized in that it includes the following steps:
- a) ensuring that at least a portion of said multiplicity of nodes (Nn) are connected, b) for said nodes of said portion, calculating possible paths (r*) between a departure node (Ns) and an arrival node (Nt), allowing for at least two chosen criteria, and then deducing an ideal solution (Z()) from performances (Z(r*)) of said possible paths (r*) based on said criteria, c) assigning each possible path (r*) a value of interest (U(r)) allowing for said ideal solution (Z()), and then classifying said possible paths allowing for their respective values of interest, and d) selecting from said classified possible paths the k best classified paths, in order to route data via one of said k paths.
1 Assignment
0 Petitions
Accused Products
Abstract
A device (D) for determining data routing paths in a communication network including a multiplicity of nodes (Nn) includes processing means (M) adapted i) to ensure that at least a portion of said multiplicity of nodes are connected, ii) for said nodes of said portion, to calculate possible paths between a departure node and an arrival node, allowing for at least two chosen criteria, and then to deduce an ideal solution (Z()) from performances (Z(r*)) of said possible paths (r*) based on said criteria, iii) to assign each possible path a value of interest allowing for the ideal solution, and then to classify the possible paths allowing for their respective values of interest, and iv) to select from the classified possible paths the k best classified paths, in order to route data via one of said k paths.
-
Citations
40 Claims
-
1. A method of determining data routing paths in a communication network including a multiplicity of nodes (Nn), which method is characterized in that it includes the following steps:
-
a) ensuring that at least a portion of said multiplicity of nodes (Nn) are connected, b) for said nodes of said portion, calculating possible paths (r*) between a departure node (Ns) and an arrival node (Nt), allowing for at least two chosen criteria, and then deducing an ideal solution (Z()) from performances (Z(r*)) of said possible paths (r*) based on said criteria, c) assigning each possible path (r*) a value of interest (U(r)) allowing for said ideal solution (Z()), and then classifying said possible paths allowing for their respective values of interest, and d) selecting from said classified possible paths the k best classified paths, in order to route data via one of said k paths. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 26, 39, 40)
-
-
20. A device for determining data routing paths (D) in a communication network including a multiplicity of nodes (Nn), which device is characterized in that it includes processing means (M) adapted to:
-
a) ensure that at least a portion of said multiplicity of nodes (Nn) are connected, b) for said nodes of said portion, calculate possible paths (r*) between a departure node (Ns) and an arrival node (Nt), allowing for at least two chosen criteria, and then deducing an ideal solution (Z()) from performances (Z(r*)) of said possible paths (r*) based on said criteria, c) assign each possible path (r*) a value of interest (U(r)) allowing for said ideal solution (Z()), and then classifying said possible paths allowing for their respective values of interest, and d) select from said classified possible paths the k best classified paths, in order to route data via one of said k paths. - View Dependent Claims (21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38)
-
Specification