{"title":"计算机网络中计算最快路径的风险能量感知服务水平协议评估","authors":"Ashutosh Sharma, Rajiv Kumar","doi":"10.1504/IJRS.2019.10017893","DOIUrl":null,"url":null,"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.","PeriodicalId":39031,"journal":{"name":"International Journal of Reliability and Safety","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"73","resultStr":"{\"title\":\"Risk-energy aware service level agreement assessment for computing quickest path in computer networks\",\"authors\":\"Ashutosh Sharma, Rajiv Kumar\",\"doi\":\"10.1504/IJRS.2019.10017893\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":39031,\"journal\":{\"name\":\"International Journal of Reliability and Safety\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"73\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Reliability and Safety\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJRS.2019.10017893\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Reliability and Safety","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJRS.2019.10017893","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
Risk-energy aware service level agreement assessment for computing quickest path in computer networks
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.