We study management of transport networks based on virtual paths, i.e. rearrangable end-to-end transport network \highways". Among its main advantages are found cost savings, network op- eration simplification and enhanced network management capabilities. Virtual paths networks are readily implemented in any network using the synchronous digital hierarchy and/or the asyn- chronous transfer mode. Algorithms for virtual path designs are reviewed and found to have a few shortcomings. A new algorithm is therefore proposed and it is found to compare favourably with the algorithm providing the most similar features. Applying the proposed algorithm to a large number of networks, we discuss operational con- siderations associated with reconfigurable networks and investigate simple traffic estimation pro- cedures and their performance in this context. Finally, the choice of reconfiguration parameters such as updating frequency, and the impact of network design time are examined.