SLA Constraint Quickest Path Problem for Data Transmission Services in Capacitated Networks

Abstract

In this paper, an extension has been made on the quickest path problem (QPP) with a constraint of service level agreements and energy required for the data transmission services. This new variant of QPP strengthens the applicability of QPP with criticality of data transmission service. The criticality of service is measured in terms of the requested service completion time and mean time of failure of service. The selection of the values of the constraint plays an important role in the computation of the SLA constraint quickest path problem (SLAQPP) for the data transmission services. The variation of SLA has been analysed to obtain the pattern of selection of number of SLAQPP paths. The proposed algorithm is tested on serval benchmark networks and random networks, providing results after computation of SLAQPP. The results show that the proposed algorithm outperforms several existing algorithms in terms of selection of paths and computation time.