当前位置: X-MOL 学术Comput. Electr. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Risk-aware optimized quickest path computing technique for critical routing services
Computers & Electrical Engineering ( IF 4.0 ) Pub Date : 2021-09-10 , DOI: 10.1016/j.compeleceng.2021.107436
Ashutosh Sharma 1 , Piotr Cholda 2 , Rajiv Kumar 3 , Gaurav Dhiman 4
Affiliation  

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.



中文翻译:

用于关键路由服务的风险感知优化最快路径计算技术

在本文中,提出了一种新的模型,用于计算具有链路可靠性、延迟和容量的优化路径。已经为具有单个链路权重的优化数据路径提出了算法,它由两个主要部分组成:(i)最佳优化路径的网络表征,以及(ii)用于预测/验证的网络参数调整最佳优化路径,根据给定的数据流。在在线计算期间它也需要很少的先验信息,因为计算出的优化路径需要较少的计算开销,因为每个数据流都应分配有预先计算和优化的链路权重。现在,借助这种优化的链接权重,只需采用 Dijkstra 算法,就可以在在线方法中找到关于风险和滞后时间的最佳路径。在本文中,借助针对从单个源到单个目的地的不同数据流值的两种不同拓扑,对这种方法进行了说明。已经提出了基于该数学模型的算法。还可以观察到,所提出的算法能够计算出具有Dijkstra算法复杂度的优化路径,当计算机在一起时。这项研究可以声称所提出的算法是自给自足的,即使没有关于要分配的路径的任何先验信息,也可以提供具有风险意识的最快路径路由。人们可以很容易地将它扩展到许多源节点到许多目标节点的情况以及未来工作中的软件定义网络(SDN)。

更新日期:2021-09-10
down
wechat
bug