A path constrained approach to dynamic network routing : integrating virtual clustering and flow deviation algorithms
Hakan Golbasi · 1996
We propose a new routing algorithm for telecommunication networks which attempts to integrate both static and dynamic routing principles by integrating virtual clustering and flow-deviation algorithms. Virtual clustering reconfigures the network topology periodically based on traffic requirements between nodes of the network. This configuration imposes path constraints for inter-cluster routing to balance and regulate the global network traffic. The inter-cluster routing is carried out by a flow deviation algorithm. Within each cluster, dynamic routing algorithm is applied which handles dynamic traffic fluctuations. The proposed routing algorithm is especially designed for nonstationary traffic pattern between source-destination pairs which represents real-life network traffic where traffic rates could change significantly during the course of a day. Intensive testing of the proposed routing scheme was conducted on randomly generated networks. The results are compared with a traditional dynamic routing algorithm [8] and a static routing algorithm.