MULTIHOUR ENGINEERING AND TRAFFIC ROUTING OPTIMIZATION IN HIERARCHICAL TELEPHONE NETWORKS

Classical hierarchical routing in telephone networks is extended to a wider class called out-of-chain routing in such a way that some useful properties of hierarchical routing are retained. This new routing pattern offers more potential paths than the fixed hierarchical one and can be introduced as a dynamic routing where the fixed alternate sequences change at some predetermined instants during the day. The effect of this new routing pattern on the network performances is examined. The main topic of this paper is to present heuristic methods used to optimise such routings in large networks. We show on artificial networks that the throughput of a given network can be significantly improved by suitable routing choices. We demonstrate that the integration of routing changes within a multihour dimensioning process is possible but the lack of realistic data does not permit at this time to quantify the value of routing optimization on real networks.