Centralized routing algorithm based on flow permutations

Abstract

This paper describes a centralized routing algorithm based on permutation of M traffic flows entering the network. The proposed approach is significantly less complex than combinatorial approach and can be used as load-balancing tool. The main advantage of such approach is that many non-perspective flow permutations could be eliminated from the calculation very early. If a new flow enters the network the algorithm offers one or more routing solutions, including the path migration for the existing flows. Of course, path migration will be performed only if it is necessary. Proposed heuristic algorithm significantly reduces the complexity, solving efficiently the problems with huge number of flows. In the sense of TE (Traffic Engineering) this routing technique looks like a very perspective load-balancing tool.