Risk-energy aware service level agreement assessment for computing quickest path in computer networks

Abstract

In this paper, a new variant of the Quickest Path Problem (QPP) is addressed with additional factors of risk and energy which leads to the evaluation of Risk-Energy Constrained Quickest Path Problem (REQPP) computation. In REQPP, risk is based on lag-time or delay and energy necessary for the transmission between two adjacent nodes. The formulation of this problem presents a realistic path computation for critical applications. The success of REQPP is measured by defining a Service Level Agreement (SLA). The proposed algorithm is able to solve the risk-energy constrained REQPP for the continuity of communication. SLA fulfills the needs of multi-constrained path whereas its time-complexity is of the order of Dijkstra’s algorithm. Finally, in the end, variation of penalty time and risk variation helps to find the high-performance value of the allowed delay time toward success of SLA.