A Framework for Pre-Computated Multi-Constrained Quickest QoS Path Algorithm

Abstract

The era of advance computer networks and advance communication leads the technology to new heights and the algorithms used for the routing needs to be updated side by side parallel with the advancement. This paper presents the new multi-constrained routing algorithm which gives quality of service full-fill the service level agreements with the user. Finding a multi-constrained path is a NP-complete problem, but still the presented algorithm gives the feasible path for the routing in a given polynomial time. Furthermore the performance comparison shows the best results with presented approach and existed approach.