Refinements to Minimum Interference Routing for Traffic Engineering

Minimum interference routing algorithm has been proposed earlier for explicit constraint-based routing of flows in networks between specified ingress and egress nodes. In this paper, the limitations of this algorithm are reviewed, and two refinements are presented which take into account the effects of (i) interference of a routed flow with future flows between the same ingress-egress pair, and (ii) degree of criticality of a link for a particular ingress-egress pair. The performance of the proposed algorithms is benchmarked against the original minimum interference routing algorithm, and also against two other algorithms proposed in literature, with encouraging results.