| **Input**: |

| **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 |

| ⟵ capacity of the link |

| ⟵ delay of link the |

| ⟵ energy rate of link the |

| ⟵ endowed energy at node *u* |

| ⟵ requested reliability at node *u* |

| ⟵ data |

| *t*_{p} ⟵ penalty time |

| *a* ⟵ availability |

| **STEP 1: prune ***r* different capacities of links corresponds to critical-continuous service and label of minimum capacity: |

| (i) |

| (ii) |

| **STEP 2: solve **** w.r.t delay time **** in **** with capacities ** |

| For *j* ⟵ 1 : *r* |

| Set *j* ⟵ 1 |

| Solve |

| If No path in with capacities |

| go to STEP 3 |

| else |

| Let is an optimal solution for with capacity |

| end |

| end |

| **STEP 3**: |

| For *j* ⟵ *r* |

| go to STEP 4 |

| else |

| set and go to STEP 2 |

| end |

| **STEP 4: find the solution** |

| Find index of path array such that |

| |

| is an optimal solution of the RESP |

| }**END** |