Main Article Content
Abstract
In this paper, a novel approach has been given on the most reliable quickest tuned data path. (MRTDP)., which gives the mobility or freedom get scaling down the delay capacity constrained to the path to be lie in the feasible reason. Let network, which consists of no of vertex and no of edges. The QoS parameters used are capacity , delay and reliability i.e. Probability of link failure of the edge . We have to find the QoS path that is feasible and lies in the performance envelope. In this letter we present the MRTDP with time algorithm.