Szczegóły publikacji
Opis bibliograficzny
Risk-aware optimized quickest path computing technique for critical routing services / Ashutosh Sharma, Piotr CHOŁDA, Rajiv Kumar, Gaurav Dhiman // Computers and Electrical Engineering ; ISSN 0045-7906. — 2021 — vol. 95 art. no. 107436, s. 1-11. — Bibliogr. s. 10-11, Abstr. — Publikacja dostępna online od: 2021-09-10
Autorzy (4)
- Sharma Ashutosh
- AGHChołda Piotr
- Kumar Rajiv
- Dhiman Gaurav
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 136162 |
|---|---|
| Data dodania do BaDAP | 2021-09-20 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.compeleceng.2021.107436 |
| Rok publikacji | 2021 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Computers & Electrical Engineering |
Abstract
In this paper, a novel model has been proposed for the computation of optimized path with link reliability, delay and capacity. Algorithms have been proposed for the optimized data path with a single link-weight and it constitutes two main parts: (i) characterization of the network for the best optimized path, and (ii) tuning of the network parameters for the prediction/validation for the Best Optimized Path, according to a given data flow. It also needs very little a priori information during the online computation as the computed optimized path requires less computational overhead as each data flow shall be assigned with a precomputed and optimized link weight. Now, with the help of this optimized link weight one can find the optimum path with respect to both risk and lag-time in an online approach simply by adopting the Dijkstra's algorithm. This approach has been illustrated here in this paper with the help of two different topologies for different values of data flow from single source to single destination. Algorithms have been proposed based on this mathematical model. It also can be observed that proposed algorithms are able to compute the optimized path with having complexity of Dijkstra's algorithm when computer together. This study can be claimed that the proposed algorithms are self-sufficient to provide the risk-aware quickest path routing, even without having any prior information on the path to be allocated. One can easily extend it for the case of many source nodes to the many destination nodes as well as for the software defined networking (SDN) in the future work.
