# A Framework for Risk-Energy Aware Service-Level Agreement Provisioning (RESP) for Computing the Quickest Path

Authors: Ashutosh Sharma; Rajiv Kumar
Journal: Journal of Computer Networks and Communications
 (2019)

---

## Abstract

This paper involved the computation of quickest paths with the help of service-level agreement (SLA) and energy constraints. The consideration of these constraints helps to propose a novel system model which computes the path to strengthen the continuity and criticality of the data transmission. The proposed risk-energy aware SLA provisioning (RESP) system model incorporates the research gaps of the existing risk assessment models in the literature without any increase in time complexity. The formulation of RESP shows the usefulness in the critical applications. The results show that the computation of risk-provisioned path gives the SLA satisfied paths and has a great impact of variations in the data traffic. The performance of the proposed algorithm has been indicated in terms of different performance parameters such as means−t paths, average hop counts, and average energy efficiency. Simulation result implies that as data traffic increases, the number of the risk‐provisioned s−t paths decreases whereas corresponding average hop counts and average energy efficiency increases.


---

## Body

## 1. Introduction

Due to the advancements in the technology of the computer networks, the applications associated with network have been provided by the service providers. These applications have a great impact on the life of human beings [1]. Therefore, a dependable network has to be requested for the network applications [2, 3]. In this regard, the concerns of environmentalists have been raised for the consumption of minimum energy for the design of dependable network [4]. Recently, the concept of dependability and energy has been considered together to address performability engineering [5]. The performance of a computer network relies mainly on the reliability, bandwidth, delay, and energy of the links which participate during data transmission. In this paper, an attempt has been performed to consider these parameters for computing the quickest path problem between two specific ends, i.e., source and destination.With evolution of network services, quickest path problem (QPP) was proposed by the authors in [6] for the data transmission. A polynomial algorithm was proposed for the data transmission to find a solution for QPP in the generalized computer network. Later, this problem got attention from several researchers, and authors in [7] modified the problem by considering the idea of bicriterion for the range of different data. This problem extends for the single-pair QPP to all-pair QPP as shown by the authors in [8]. Several extensions have been made for the QPP as the k-QPP was introduced in [9–12]. For general network, it is very important to design a routing protocol for high availability so that critical services may get completed. To design a routing protocol for high availability, the parameters like energy, delay, and bandwidth are the major factors which play an important role [13, 14]. This QPP model was also extended toward the building evacuation problem by Hamacher and Tjandra [15] who propose a building evacuation problem. The QPP model was also extended toward the continuity of critical applications where it has been considered as an important figure of merit [16].The network is associated with certain uncertainties which may lead to service failure, and to deal with these failures, reliability theory has been used in [17] and the reliable QPP model has been proposed. This model was later extended for different models in [12, 18–20]. Also, authors in [19] extend the reliable QPP by considering a threshold value of reliability for quality-of-service (QoS) routing. Later, the reliable model was extended for risk analysis by considering service-level agreement (SLA) [21–25].Recently, QoS routing has been provided by considering the amount of energy used for the data transmission services by considering parameters like reliability, risk, and availability. [26, 27]. The reliable QPP problem further extended with energy constraint for the continuity of data transmission [28]. The discussion made in the above paragraphs leads us to work for continuity of critical data transmission services by provisioning SLA and energy. Recently, risk-energy problem in data transmission services has been discussed for minimization in the risk and energy consumption [29].


### 1.1. Research Significance

Here, in this paper, the authors have made an attempt to provision the risk-free path computation model with consideration of SLA and energy constraints. The main contributions of this paper are presented as follows: (i) A novel system model has been presented with the risk-provisioned mechanism which is the upgraded version of the existing REQPP risk assessment system model in the existing literature. (ii) The contribution can also be seen with the reference to SLA violation factor. The proposed system model gives the full SLA satisfaction as compared to the existing REQPP system model.The rest of the paper is organized into sections. Section2 presents the preliminaries to develop the strong base for the development of the system model. A novel system model is proposed in Section 3. To implement the proposed system model, an algorithm and its complexity analysis are presented in Section 4. Section 5 presents the results and discussion of the proposed problem. In Section 6, conclusion is presented.


## 1.1. Research Significance

Here, in this paper, the authors have made an attempt to provision the risk-free path computation model with consideration of SLA and energy constraints. The main contributions of this paper are presented as follows: (i) A novel system model has been presented with the risk-provisioned mechanism which is the upgraded version of the existing REQPP risk assessment system model in the existing literature. (ii) The contribution can also be seen with the reference to SLA violation factor. The proposed system model gives the full SLA satisfaction as compared to the existing REQPP system model.The rest of the paper is organized into sections. Section2 presents the preliminaries to develop the strong base for the development of the system model. A novel system model is proposed in Section 3. To implement the proposed system model, an algorithm and its complexity analysis are presented in Section 4. Section 5 presents the results and discussion of the proposed problem. In Section 6, conclusion is presented.


## 2. Preliminaries

To explain the QPP model, let us consider the directed loop-less graphG=N,E, where N and E are the set of number of nodes and set of number of links u,v, respectively. This network is associated with several resources such as link delays du,v>0 and link capacities cu,v>0. Assume a data σ transmission has been considered between two consecutive links with a connection-oriented approach having no buffer, i.e., seamless flow of data. To aid the seamless flow, capacity of a s−t path has to be least and is defined as the data sent over a link per unit time.Let us assume thatσ amount of data is being transmitted between two specific ends, namely, source s and destination (t). While data are being transferred between these two specific ends, a s−t path is formed with the sequence of the number of links without any loop to manage the resources efficiently.To transmitσ unit’s data over a s−t path, the delay experienced at a link u,v can be expressed as Tσu,v=du,v+σ/cu,v. Let a path P=s=u1,u2,u3,…,uk=t where ui∈N,i=1,…,k and ui,ui+1∈E,i=1,…,k−1 be the loop-free s−t path. Therefore, the minimum transmission delay experienced to transmit σ unit’s data along a s−t path is(1)TσP=dP+σcP,where first term in the right hand side is known as the delay of path dP calculated as dP=∑i=1i=k−1dui,ui+1 and the numerator of the second term is known as the minimum capacity for the s−t path cP=mini=1k−1cui,ui+1.Hence, the minimum transmission time is given as(2)TσP=∑i=1i=k−1dui,ui+1+σmini=1k−1cui,ui+1.The quickest path problem (QPP) is formulated as(3)minTσP,s.t.Pisans−tpathinnetworkGN,E.In the beginning, when QPP was conceptualized [6–11, 14, 15, 30, 31], no special care was maintained for the energy consumption during data transmission. Nowadays, without the consideration of energy [26], any one cannot afford transmission [27, 28, 32]. In addition to this, the bar on usage of energy resources put a constraint for data transmission [33–39]. To consider the concept energy consumption, the topic of green computing was explored in [40, 41] for data transmission.To deal with energy, various authors tried to incorporate them in QPP. Let us assume that each link is allied with energy rateωu,v>0 to transmit σ unit data from node u along with the link u,v. In networks, each node is endowed with limited amount of power Pu which is available at nodes for data transmission. The amount of energy required at the node is calculated as ωu,vσ/cu,v.To compete with successful data transmission, the following has to be proved:(4)Pu−ωu,vσcu,v≥0.For data transmission without any disruption, find minimum link capacity used for transmission ofσ unit data between nodes u and v having energy rate ωu,v. The minimum capacity of link is given as follows:(5)cminEu,v=mini=1,…,rci;Pu−ωu,vσci≥0.In the given network, each link follows the following equation for the path capacity pathcP:(6)cu,v≥cj≥cminu,v,wherej=1,…,r.The residual energy of pathPuσ,P is(7)Puσ,P=Pu−ωui,ui+1σcP,ifu=ui,i=1,…,k−1,Pu,otherwise.Hence, constrained QPP has been formulated by using above equations as(8)minPTσP,s.t.Puσ,P≥0,u∈P,Pisans−tpathinnetworkG.The above-discussed model has been proposed by several authors [28, 42, 43] to incorporate energy in QPP.The availability of sufficient amount of energy is not only the factor for the continuity in data transmission. The link reliabilities are also helpful for the continuity of data transmission [44, 45].Recently, the authors in [42] tried to adopt the above constraints in their proposed model, but they have incorporated these parameters for the assessment of risk unless provisioning for the risk. In the proposed framework, the authors have made an attempt to deal with the provisioning of risk.


## 3. Proposed System Model

### 3.1. Assumptions

The proposed system model for the RESP required some assumptions for better understanding and they are given as follows:(1)
There are no parallel and duplicate links in the network graph [46](2)
Capacities of links are generated randomly with the uniform distribution and are statistically independent [47](3)
Bifurcation of data is not allowed, and also, flow of conservation is followed by data transmission [47]Let us take the performance reliability which constitutes the link reliabilityRlu,v and performance factor of a link RDu,v. The reliability of a link is related to the failure in the connectivity (i.e., hard failure), and the performance factor of a link is related to the performance parameters such as delay and capacity (i.e., soft failure) [42].Let us assume that link reliability is ideal, i.e.,Rlu,v=1 and performance of data transmission depends mainly on the performance factor. The requested service-level agreement (SLA) is drawn for the critical data transmission. The requested SLA is defined as a,tp where a is the requested SLA availability and tp is the penalty period. By using these SLA parameters, the allowed time TA.D. has been computed as [21, 42](9)TA.D.=1−a×tp.The link performance factor constitutes the service-level agreements (SLAs) and link delays; therefore, along a path, the performance factor is calculated as(10)RDP=∏i=1k−1e−Tσui,ui+1/TA.D..Equation (10) is known as the performance reliability due to delayRD, and by expanding equation (10), performance reliability is calculated as(11)RDP=e−∑i=1k−1Tσui,ui+1/TA.D.,RDP=e−TσP/TA.D..In equation (11), if minimum transmission delay TσP is very large as compared to TA.D., then the value of performance delay RDP is equal to zero and if minimum transmission delay TσP is small as compared to TA.D., then the value of performance delay RDP is equal to 1. The above study shows that the minimum transmission delay has a great impact on the performance of the data transmission.Here, in this paper, the authors have tried to incorporate the research gaps of the existing risk assessment REQPP model proposed in [42]. In the REQPP model, the authors performed only the assessment of risk and not the provisioning. In the present paper, following this research gap, the authors have tried to incorporate risk provisioning by satisfying the SLAs and proposed the novel system model for risk provisioning.A pathP is formed either by combination of several links or a single link. Therefore, it is more realistic to satisfy the SLA piecewise or between two consecutive links other than satisfying the SLA after completion of data transmission service among the path. The SLAs are considered for mission-critical applications; therefore, each node is endowed with the requested amount of reliability Ru. To deal with SLA constraint, the following expression has to follow:(12)e−du,v+σ/cu,v/TA.D.≥Ru,∀u,v∈E,where Ru is the reliability at nodes and has to be maintained equal or more to this value.The minimum SLA aware link capacity is shown as follows:(13)cminSLAu,v=mini=1,…,re−du,v+σ/ci/TA.D.−Ru≥0.To incorporate both parameters (energy and SLA) for sorting, the minimum link capacity has been given as follows:(14)cminu,v=mincminEu,v≥ca≥cu,v∩cminSLAu,v≥cb≥cu,v,where ca is the capacity lying between the minimum energy cooperative capacity and link capacity. The capacity cb lies between the minimum SLA cooperative capacity and link capacity Equation (14) provides the label of minimum link capacity to support the continuity and criticality in data transmission if cminSLAu,v and cminEu,v>0. A s−t path P is feasible if cP≥cminu,v. The above equations sort the minimum capacity which incorporates both the critical and continuous data transmission by considering the AND rule.The remaining value of performance reliability is termed as residual-requested performance reliability.Ruσ,P along the path P gives feasibility of path P, i.e., Ruσ,P≥0,∀u∈P as(15)Ruσ,P=−lnRu−−lne−dui,ui+1+σ/cP/TA.D.,ifu=ui,i=1,2,…,k−1,−lnRu,otherwise.The SLA-energy awareness allows us to combine the characteristics of the both models (energy and SLA) and formulate the constraint model of the risk-energy aware SLA provisioning (RESP) given as follows:(16)minPTσP,s.t.Ruσ,P≥0,u∈P,Puσ,P≥0,u∈P,Pisans−tpathinnetworkG.Here, problem has been used to transmit the data with continuity and criticality using shortest path problem (SPP). The energy and SLA have been used as a constraint for the SPP. The working of SPP lies on Dijkstra’s algorithm with the link delay as a cost value in the different subnetworks [48]:(17)SPPj:minPdP,s.t.Pisas−tpathinthenetworkGj.By following this, Algorithm1 has been proposed in Section 4 to perform the computations.Algorithm 1:RESP algorithm.
Input: GN,E,σ,ωu,v,cu,v,du,v,a,Ru,Puandtp
Output: risk-energy aware SLA-provisioned (RESP) route
BEGIN{
Initialization:
j ⟵ 1,
Procedure:
STEP 0: variable declaration
G ⟵ directed network
N ⟵ set of nodes
E ⟵ set of links
c
u
,
v ⟵ capacity of the link u,v
d
u
,
v ⟵ delay of link the u,v
ω
u
,
v ⟵ energy rate of link the u,v
P
u ⟵ endowed energy at node u
R
u ⟵ requested reliability at node u
σ ⟵ data
t
p ⟵ penalty time
a ⟵ availability
STEP 1: pruner different capacities of links corresponds to critical-continuous service and label of minimum capacity:
(i)c1<c2<c3<⋯<cr
(ii)cminu,vwithANDrule
STEP 2: solve SPPj w.r.t delay time du,v in Gj with capacities cj
Forj ⟵ 1 : r
Setj ⟵ 1
SolveSPPj
If Nos−t path in Gj with capacities cj
go to STEP 3
else
LetPj is an optimal solution for SPPj with capacity cPj=cj
end
end
STEP 3:
Forj ⟵ r
go to STEP 4
else
setj=j+1 and go to STEP 2
end
STEP 4: find the solution
Find indexh∈1,2,…,r of path array Pj such that
T
σ
P
h
=
min
j
=
1
,
…
,
r
T
σ
P
j
P
h is an optimal solution of the RESP
}END


## 3.1. Assumptions

The proposed system model for the RESP required some assumptions for better understanding and they are given as follows:(1)
There are no parallel and duplicate links in the network graph [46](2)
Capacities of links are generated randomly with the uniform distribution and are statistically independent [47](3)
Bifurcation of data is not allowed, and also, flow of conservation is followed by data transmission [47]Let us take the performance reliability which constitutes the link reliabilityRlu,v and performance factor of a link RDu,v. The reliability of a link is related to the failure in the connectivity (i.e., hard failure), and the performance factor of a link is related to the performance parameters such as delay and capacity (i.e., soft failure) [42].Let us assume that link reliability is ideal, i.e.,Rlu,v=1 and performance of data transmission depends mainly on the performance factor. The requested service-level agreement (SLA) is drawn for the critical data transmission. The requested SLA is defined as a,tp where a is the requested SLA availability and tp is the penalty period. By using these SLA parameters, the allowed time TA.D. has been computed as [21, 42](9)TA.D.=1−a×tp.The link performance factor constitutes the service-level agreements (SLAs) and link delays; therefore, along a path, the performance factor is calculated as(10)RDP=∏i=1k−1e−Tσui,ui+1/TA.D..Equation (10) is known as the performance reliability due to delayRD, and by expanding equation (10), performance reliability is calculated as(11)RDP=e−∑i=1k−1Tσui,ui+1/TA.D.,RDP=e−TσP/TA.D..In equation (11), if minimum transmission delay TσP is very large as compared to TA.D., then the value of performance delay RDP is equal to zero and if minimum transmission delay TσP is small as compared to TA.D., then the value of performance delay RDP is equal to 1. The above study shows that the minimum transmission delay has a great impact on the performance of the data transmission.Here, in this paper, the authors have tried to incorporate the research gaps of the existing risk assessment REQPP model proposed in [42]. In the REQPP model, the authors performed only the assessment of risk and not the provisioning. In the present paper, following this research gap, the authors have tried to incorporate risk provisioning by satisfying the SLAs and proposed the novel system model for risk provisioning.A pathP is formed either by combination of several links or a single link. Therefore, it is more realistic to satisfy the SLA piecewise or between two consecutive links other than satisfying the SLA after completion of data transmission service among the path. The SLAs are considered for mission-critical applications; therefore, each node is endowed with the requested amount of reliability Ru. To deal with SLA constraint, the following expression has to follow:(12)e−du,v+σ/cu,v/TA.D.≥Ru,∀u,v∈E,where Ru is the reliability at nodes and has to be maintained equal or more to this value.The minimum SLA aware link capacity is shown as follows:(13)cminSLAu,v=mini=1,…,re−du,v+σ/ci/TA.D.−Ru≥0.To incorporate both parameters (energy and SLA) for sorting, the minimum link capacity has been given as follows:(14)cminu,v=mincminEu,v≥ca≥cu,v∩cminSLAu,v≥cb≥cu,v,where ca is the capacity lying between the minimum energy cooperative capacity and link capacity. The capacity cb lies between the minimum SLA cooperative capacity and link capacity Equation (14) provides the label of minimum link capacity to support the continuity and criticality in data transmission if cminSLAu,v and cminEu,v>0. A s−t path P is feasible if cP≥cminu,v. The above equations sort the minimum capacity which incorporates both the critical and continuous data transmission by considering the AND rule.The remaining value of performance reliability is termed as residual-requested performance reliability.Ruσ,P along the path P gives feasibility of path P, i.e., Ruσ,P≥0,∀u∈P as(15)Ruσ,P=−lnRu−−lne−dui,ui+1+σ/cP/TA.D.,ifu=ui,i=1,2,…,k−1,−lnRu,otherwise.The SLA-energy awareness allows us to combine the characteristics of the both models (energy and SLA) and formulate the constraint model of the risk-energy aware SLA provisioning (RESP) given as follows:(16)minPTσP,s.t.Ruσ,P≥0,u∈P,Puσ,P≥0,u∈P,Pisans−tpathinnetworkG.Here, problem has been used to transmit the data with continuity and criticality using shortest path problem (SPP). The energy and SLA have been used as a constraint for the SPP. The working of SPP lies on Dijkstra’s algorithm with the link delay as a cost value in the different subnetworks [48]:(17)SPPj:minPdP,s.t.Pisas−tpathinthenetworkGj.By following this, Algorithm1 has been proposed in Section 4 to perform the computations.Algorithm 1:RESP algorithm.
Input: GN,E,σ,ωu,v,cu,v,du,v,a,Ru,Puandtp
Output: risk-energy aware SLA-provisioned (RESP) route
BEGIN{
Initialization:
j ⟵ 1,
Procedure:
STEP 0: variable declaration
G ⟵ directed network
N ⟵ set of nodes
E ⟵ set of links
c
u
,
v ⟵ capacity of the link u,v
d
u
,
v ⟵ delay of link the u,v
ω
u
,
v ⟵ energy rate of link the u,v
P
u ⟵ endowed energy at node u
R
u ⟵ requested reliability at node u
σ ⟵ data
t
p ⟵ penalty time
a ⟵ availability
STEP 1: pruner different capacities of links corresponds to critical-continuous service and label of minimum capacity:
(i)c1<c2<c3<⋯<cr
(ii)cminu,vwithANDrule
STEP 2: solve SPPj w.r.t delay time du,v in Gj with capacities cj
Forj ⟵ 1 : r
Setj ⟵ 1
SolveSPPj
If Nos−t path in Gj with capacities cj
go to STEP 3
else
LetPj is an optimal solution for SPPj with capacity cPj=cj
end
end
STEP 3:
Forj ⟵ r
go to STEP 4
else
setj=j+1 and go to STEP 2
end
STEP 4: find the solution
Find indexh∈1,2,…,r of path array Pj such that
T
σ
P
h
=
min
j
=
1
,
…
,
r
T
σ
P
j
P
h is an optimal solution of the RESP
}END


## 4. Algorithm

### 4.1. Algorithm for Risk-Energy Aware SLA Provisioned (RESP) Route

### 4.2. Complexity Analysis

Theorem 1.
The time complexity of the proposed RESP algorithm isOrm+nlogn.Proof.
The complexity of RESP is explained using the time complexity ofOm+nlogn [49] which has been run for r times.


## 4.1. Algorithm for Risk-Energy Aware SLA Provisioned (RESP) Route

## 4.2. Complexity Analysis

Theorem 1.
The time complexity of the proposed RESP algorithm isOrm+nlogn.Proof.
The complexity of RESP is explained using the time complexity ofOm+nlogn [49] which has been run for r times.


## 5. Results and Discussion

### 5.1. Experimental Setup

The experiment for the performance evaluation of the proposed RESP algorithm has been performed over the personal computer having the configuration of Intel(R) CoreTMi5–7400, CPU@ 3.00 GHz, 8 GB RAM, and Windows 10 operating system. All simulations have been performed in MATLAB R2010a environment platform. The simulations show that the proposed RESP algorithm is solvable in polynomial time using Dijkstra’s algorithm which used binary heap data structure. The illustrations of results have been explained with the help of standard network topologies as shown in Figure 1(a) and 1(b).Figure 1
(a) 24-node US-directed mesh network withs=1 and t=24. (b) 14-node NSF-directed mesh network with s=1 and t=14.
(a)
(b)The associated values of link parameters like delay and capacities are taken from the uniform distribution range [1, 1000]. As discussed in the previous sections, the amount of fixed powers at each node and amount of energy rate at each link is given byPu=3×107 and 10−4cu,vd2u,v, respectively. The requested reliability at nodes is generated uniformly within the range [0, 1]. For the risk provisioning, requested SLA is defined by considering the availability and the penalty time a,tp. The value of requested availability is taken as a=0.92, and the penalty time is considered as (tp=40000secs). To visualize the performance of the proposed algorithm, three different amounts of data σ1=100,σ2=1000,andσ3=10000inMb are taken. This variation in the amount of data to be transmitted shows the trend in the various SLAs and energy-provisioned shortest paths.


### 5.2. Performance Analysis

The quantitative performance analysis of the proposed algorithm has been shown in Tables1 and 2. The different simulations have been performed for different data sizes. The set of different number of s−t paths has been commutated from the different subgraphs which are equal to distinct capacities present in the network. Further, from the set of s−t paths, the shortest path has been computed. The performance of proposed RESP algorithm has been seen in other parameters also such as average hop counts, average capacity, and energy efficiency of risk-provisioned s−t shortest path. The results for both standard topologies have been taken for the discussion to show the effectiveness of the RESP.Table 1
Number ofs−t paths, hop counts, capacity, and energy efficiency of the shortest s−t path.
Sr. no.
Traffic
s
−
t paths
Hop counts of shortests−t path
Capacity of shortests−t path
Energy efficiency of shortests−t path (×106)
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
1
13
10
4
7
8
8
12
20
12
1.0933 MJ
0.2727
0.1968
2
8
9
6
8
10
8
7
25
29
0.2539 MJ
0.2846
0.2339
3
9
10
11
7
6
6
25
38
69
0.3633 MJ
0.4422
0.3351
4
5
8
5
7
7
6
12
16
29
0.1174
0.2571
0.4326
5
5
12
10
7
8
7
7
11
48
0.1455
0.1021
0.3536
6
10
9
4
7
7
6
12
38
27
0.2531
0.7795
0.5594
7
11
7
6
7
7
7
3
12
19
0.00375
0.4081
0.1346
8
13
8
10
7
7
7
2
33
45
0.0557
0.4670
0.5593
9
7
6
10
7
7
7
29
15
35
0.5187
0.1670
0.8984
10
9
9
8
7
8
8
4
49
30
0.0915
0.4998
0.6006
Mean
9
8.8
7.4
7.1
7.5
7
11.3
25.7
34.3
0.289615
0.36801
0.43043Table 2
Number ofs−t paths, hop counts, capacity, and energy efficiency of the shortest s−t path.
Sr. no.
Traffic
s
−
t paths
Hop counts of shortests−t path
Capacity of shortests−t path
Energy efficiency of shortests−t path (×106)
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
1
6
6
4
3
4
4
9
37
47
0.1264
0.9527
1.1781
2
7
3
2
3
3
4
15
22
16
0.3360
2.6999
0.3110
3
3
7
3
4
4
4
19
35
22
1.3800
2.1949
0.5721
4
5
3
5
4
3
4
24
23
39
0.3952
0.2289
0.4877
5
3
5
5
5
4
3
7
19
24
0.2209
0.6922
0.4690
6
6
6
6
4
3
4
16
27
27
0.3795
0.3887
0.9240
7
2
6
3
3
3
4
7
14
34
0.1651
0.7255
0.8131
8
5
3
2
5
3
4
10
15
18
0.7991
0.2552
0.8775
9
6
3
4
4
5
4
14
19
27
1.1382
0.9686
0.3725
10
9
6
2
4
4
3
53
33
28
0.9906
0.2891
0.5150
Mean
5.2
4.8
3.6
3.9
3.6
3.8
17.4
24.4
28.2
0.5931
0.93957
0.652


#### 5.2.1. 24-Node US Network

The results for the standard topology as shown in Figure1(a) show the mean number of s−t shortest paths computed for the ten runs. Table 1 shows the results for risk-provisioned s−t paths in second, third, and fourth columns for different data traffics σ1,σ2, and σ3. The mean value of risk-provisioned s−t paths shows that as data traffic is varied, the number of s−t paths got reduced. This trend has been shown because for the large amount of data, the links in the network topology are not capable to provide the energy and SLA provisioning. Also, hop counts in fifth, sixth, and seventh columns of Table 1 shows very little variation with respect to different data traffics.The trend in the adopted capacity of path is increased as the data traffic increases as shown in the eighth, ninth, and tenth columns of Table1, respectively. This trend has been found because for the large amount of data, the capacity of link should be maintained maximum.


#### 5.2.2. 14-Node NSF Network

The experiment conducted for the Figure1(a) has been repeated for the Figure 1(b) also to see the performance of the proposed RESP algorithm. The results for the 14-node NSF topology are shown in Table 2. The results for this topology depict that the same trend of the performance has been followed.The variation of data traffic has high impact on the energy efficiency (bits/sec/joule) of s−t path in the given topology. The results for the energy efficiency have been shown in the eleventh to thirteenth columns. The value of energy efficiency increased as data traffic increases. This is because the energy constraints have to be qualified to be part of a subnetworks, so as data traffic increases, energy efficiency also increases.The illustrative results show that the proposed RESP algorithm is outperforming over the REQPP algorithm [42] with reference to risk provisioning, resource wastage, and computation time.


## 5.1. Experimental Setup

The experiment for the performance evaluation of the proposed RESP algorithm has been performed over the personal computer having the configuration of Intel(R) CoreTMi5–7400, CPU@ 3.00 GHz, 8 GB RAM, and Windows 10 operating system. All simulations have been performed in MATLAB R2010a environment platform. The simulations show that the proposed RESP algorithm is solvable in polynomial time using Dijkstra’s algorithm which used binary heap data structure. The illustrations of results have been explained with the help of standard network topologies as shown in Figure 1(a) and 1(b).Figure 1
(a) 24-node US-directed mesh network withs=1 and t=24. (b) 14-node NSF-directed mesh network with s=1 and t=14.
(a)
(b)The associated values of link parameters like delay and capacities are taken from the uniform distribution range [1, 1000]. As discussed in the previous sections, the amount of fixed powers at each node and amount of energy rate at each link is given byPu=3×107 and 10−4cu,vd2u,v, respectively. The requested reliability at nodes is generated uniformly within the range [0, 1]. For the risk provisioning, requested SLA is defined by considering the availability and the penalty time a,tp. The value of requested availability is taken as a=0.92, and the penalty time is considered as (tp=40000secs). To visualize the performance of the proposed algorithm, three different amounts of data σ1=100,σ2=1000,andσ3=10000inMb are taken. This variation in the amount of data to be transmitted shows the trend in the various SLAs and energy-provisioned shortest paths.


## 5.2. Performance Analysis

The quantitative performance analysis of the proposed algorithm has been shown in Tables1 and 2. The different simulations have been performed for different data sizes. The set of different number of s−t paths has been commutated from the different subgraphs which are equal to distinct capacities present in the network. Further, from the set of s−t paths, the shortest path has been computed. The performance of proposed RESP algorithm has been seen in other parameters also such as average hop counts, average capacity, and energy efficiency of risk-provisioned s−t shortest path. The results for both standard topologies have been taken for the discussion to show the effectiveness of the RESP.Table 1
Number ofs−t paths, hop counts, capacity, and energy efficiency of the shortest s−t path.
Sr. no.
Traffic
s
−
t paths
Hop counts of shortests−t path
Capacity of shortests−t path
Energy efficiency of shortests−t path (×106)
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
1
13
10
4
7
8
8
12
20
12
1.0933 MJ
0.2727
0.1968
2
8
9
6
8
10
8
7
25
29
0.2539 MJ
0.2846
0.2339
3
9
10
11
7
6
6
25
38
69
0.3633 MJ
0.4422
0.3351
4
5
8
5
7
7
6
12
16
29
0.1174
0.2571
0.4326
5
5
12
10
7
8
7
7
11
48
0.1455
0.1021
0.3536
6
10
9
4
7
7
6
12
38
27
0.2531
0.7795
0.5594
7
11
7
6
7
7
7
3
12
19
0.00375
0.4081
0.1346
8
13
8
10
7
7
7
2
33
45
0.0557
0.4670
0.5593
9
7
6
10
7
7
7
29
15
35
0.5187
0.1670
0.8984
10
9
9
8
7
8
8
4
49
30
0.0915
0.4998
0.6006
Mean
9
8.8
7.4
7.1
7.5
7
11.3
25.7
34.3
0.289615
0.36801
0.43043Table 2
Number ofs−t paths, hop counts, capacity, and energy efficiency of the shortest s−t path.
Sr. no.
Traffic
s
−
t paths
Hop counts of shortests−t path
Capacity of shortests−t path
Energy efficiency of shortests−t path (×106)
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
σ
1
σ
2
σ
3
1
6
6
4
3
4
4
9
37
47
0.1264
0.9527
1.1781
2
7
3
2
3
3
4
15
22
16
0.3360
2.6999
0.3110
3
3
7
3
4
4
4
19
35
22
1.3800
2.1949
0.5721
4
5
3
5
4
3
4
24
23
39
0.3952
0.2289
0.4877
5
3
5
5
5
4
3
7
19
24
0.2209
0.6922
0.4690
6
6
6
6
4
3
4
16
27
27
0.3795
0.3887
0.9240
7
2
6
3
3
3
4
7
14
34
0.1651
0.7255
0.8131
8
5
3
2
5
3
4
10
15
18
0.7991
0.2552
0.8775
9
6
3
4
4
5
4
14
19
27
1.1382
0.9686
0.3725
10
9
6
2
4
4
3
53
33
28
0.9906
0.2891
0.5150
Mean
5.2
4.8
3.6
3.9
3.6
3.8
17.4
24.4
28.2
0.5931
0.93957
0.652


### 5.2.1. 24-Node US Network

The results for the standard topology as shown in Figure1(a) show the mean number of s−t shortest paths computed for the ten runs. Table 1 shows the results for risk-provisioned s−t paths in second, third, and fourth columns for different data traffics σ1,σ2, and σ3. The mean value of risk-provisioned s−t paths shows that as data traffic is varied, the number of s−t paths got reduced. This trend has been shown because for the large amount of data, the links in the network topology are not capable to provide the energy and SLA provisioning. Also, hop counts in fifth, sixth, and seventh columns of Table 1 shows very little variation with respect to different data traffics.The trend in the adopted capacity of path is increased as the data traffic increases as shown in the eighth, ninth, and tenth columns of Table1, respectively. This trend has been found because for the large amount of data, the capacity of link should be maintained maximum.


### 5.2.2. 14-Node NSF Network

The experiment conducted for the Figure1(a) has been repeated for the Figure 1(b) also to see the performance of the proposed RESP algorithm. The results for the 14-node NSF topology are shown in Table 2. The results for this topology depict that the same trend of the performance has been followed.The variation of data traffic has high impact on the energy efficiency (bits/sec/joule) of s−t path in the given topology. The results for the energy efficiency have been shown in the eleventh to thirteenth columns. The value of energy efficiency increased as data traffic increases. This is because the energy constraints have to be qualified to be part of a subnetworks, so as data traffic increases, energy efficiency also increases.The illustrative results show that the proposed RESP algorithm is outperforming over the REQPP algorithm [42] with reference to risk provisioning, resource wastage, and computation time.


## 5.2.1. 24-Node US Network

The results for the standard topology as shown in Figure1(a) show the mean number of s−t shortest paths computed for the ten runs. Table 1 shows the results for risk-provisioned s−t paths in second, third, and fourth columns for different data traffics σ1,σ2, and σ3. The mean value of risk-provisioned s−t paths shows that as data traffic is varied, the number of s−t paths got reduced. This trend has been shown because for the large amount of data, the links in the network topology are not capable to provide the energy and SLA provisioning. Also, hop counts in fifth, sixth, and seventh columns of Table 1 shows very little variation with respect to different data traffics.The trend in the adopted capacity of path is increased as the data traffic increases as shown in the eighth, ninth, and tenth columns of Table1, respectively. This trend has been found because for the large amount of data, the capacity of link should be maintained maximum.


## 5.2.2. 14-Node NSF Network

The experiment conducted for the Figure1(a) has been repeated for the Figure 1(b) also to see the performance of the proposed RESP algorithm. The results for the 14-node NSF topology are shown in Table 2. The results for this topology depict that the same trend of the performance has been followed.The variation of data traffic has high impact on the energy efficiency (bits/sec/joule) of s−t path in the given topology. The results for the energy efficiency have been shown in the eleventh to thirteenth columns. The value of energy efficiency increased as data traffic increases. This is because the energy constraints have to be qualified to be part of a subnetworks, so as data traffic increases, energy efficiency also increases.The illustrative results show that the proposed RESP algorithm is outperforming over the REQPP algorithm [42] with reference to risk provisioning, resource wastage, and computation time.


## 6. Conclusion and Future Work

This paper has proposed the concept of risk-energy aware SLA provisioning (RESP) for the planning of critical routing where continuity of data transmission is given utmost priority. Continuity of transmission in this paper has been quantified in terms of performance of the link in a data transmission path considered as energy required for the link connectivity. The link delay has also been considered for the risk provisioning. The result shows an improvement in energy efficiency and capacity of path. The proposed RESP algorithm is able to compute the paths without any risk in terms of SLA. Present work is considering only energy of the link in path computation. In future work, the proposed algorithm can be extended with incorporating the security paradigms which enable the computation of paths in presence of any malicious activities.



---

*Source: 4109453-2019-05-06.xml*