Low complexity bandwidth guaranteed routing algorithms using path holding time

This paper introduces new bandwidth guaranteed routing algorithms using remaining path holding time. The idea is to combine residual bandwidths with future available band-widths which are calculated based on holding time of routing paths to select next routes. The proposed algorithms have low complexity because only link bandwidths are considered and no critical computation is needed. They are tested against other popular traffic engineering (TE) routing algorithms, i.e. Minimum Hop Algorithm (MHA), Minimum Interference Routing Algorithm (MIRA), and Random Race based Algorithm for TE (RRATE). Experimental results indicate that the proposed algorithms not only accept more number of routing requests but also achieve lower computation time than all the others.