An improved vectorial labelling scheme for QoS-guaranteed routing algorithm of ATM networks

The paper proposes an improved vectorial labelling routing algorithm for ATM networks. It is known that the shortest path problem with one or more constraints is NP-complete. The proposed algorithm can find an approximate optimal path subject to multiple constraints with arbitrary accuracy in polynomial time-scale. The numerical results show that the algorithmic loops are reduced to about 1/3 of the original multi-label algorithm.