Abstract: A method for routing traffic in a network comprising a plurality of nodes and a plurality of data lines that extend between adjacent ones of said nodes, the traffic being formed of traffic connections between pairs of nodes referred to as terminal nodes, comprises the steps of a) selecting a pair of said terminal nodes and determining a shortest path between them (S1-S4); b) selecting (S6) a new node from said plurality which is not part of the path and inserting (S8) the new node between two adjacent nodes of the path; c) repeating step b) until at least all terminal nodes are included in the path; d) routing at least part of said traffic on said path (S11-S14).