Title :
Minimum-interference routing based on flow maximisation
Author_Institution :
IBM Res., IBM Zurich Res. Lab., Ruschlikon, Switzerland
fDate :
4/11/2002 12:00:00 AM
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
Keywords :
flow graphs; telecommunication network routing; bandwidth; directed graph; flow maximisation; heuristic method; ingress-egress pairs; minimum-interference routing; online routing algorithm;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20020254
