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

Ashutosh Sharma and Rajiv Kumar

International Journal of Reliability and Safety, 2019, vol. 13, issue 1/2, 96-124

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.

Keywords: green communications; risk-energy constraints; QPP; quickest path problem; SLA; requested service level agreements. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=97019 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijrsaf:v:13:y:2019:i:1/2:p:96-124

Access Statistics for this article

More articles in International Journal of Reliability and Safety from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().