Patent ID: 6628618
Filing Date: 2003-09-30
Classification: H04L

Abstract:
A method of producing a telecommunication network, comprising the steps:a) determining geographical locations of m network exchange nodes N1 to Nm, m being a positive integer; b) determining equivalent distances D(i,j) between all pairs Ni, Nj of said nodes based on the relative geographical locations of the nodes Ni, Nj of each pair wherein i,j &egr;{1 , . . . , m} and i&ap;j; c) determining traffic capacities T (i,j) between all pairs of nodes Ni, Nj based on the expected amount of traffic to be carried between node Ni and node Nj; d) for all node pairs Ni, Nj, evaluating an expression S(i,j) which is a strictly monotonic increasing function of D(i,j) and a strictly monotonic decreasing finction of T(i,j); e) ordering the node pairs Ni, Nj such that S(i,j) is non decreasing; and f) selecting in said order f or each node pair Ni, Nj among all possible paths each consisting of at least one link connecting two nodes, a path P between node Ni and Nj for implementation, for which path P C&it;(P)=T&it;(i,j)&CenterDot;&Sum;k&it;â€ƒ&it;C2&CenterDot;Dk+&Sum;n&it;â€ƒ&it;C1&CenterDot;Dnâ€ƒis minimum, k being an index for all links of the path; n being an index for all links not yet selected for implementation in any previous step, of the path, C1 being a positive real number selected in accordance with link implementation costs per unit distance, C2 being a positive real number selected in accordance with link implementation costs per unit distance and per unit traffic capacity; Dk and Dn, respectively, being the equivalent distance for the pair of nodes associated with link k, and link n, respectively.