Minimum-interference routing based on flow maximisation

Abstract

A new on-line routing algorithm based on the notion of minimum-interference is presented. The algorithm maximises the sum of residual flows of ingress-egress pairs, using a simple heuristic method. It achieves good results in terms of total bandwidth routed.