Analysis of rerouting in circuit-switched networks

Dynamic routing has been adopted in circuit-switched networks in many parts of the world. Most of the routing algorithms used are least loaded routing (LLR) based for its simplicity and efficiency. Rerouting is the practice of routing calls on alternate paths back to direct paths or to other less congested alternate paths. It allows the continuous redistribution of network loads for the relief of the congestion on direct paths. In this paper, we present an original analysis of an LLR-based rerouting scheme. Through numerical examples and confirmation by computer simulation, the throughput gain of rerouting is established.