Risk-energy aware service level agreement assessment for computing quickest path in computer networks
by Ashutosh Sharma; Rajiv Kumar
International Journal of Reliability and Safety (IJRS), Vol. 13, No. 1/2, 2019

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.

Online publication date: Fri, 14-Dec-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reliability and Safety (IJRS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com