论文标题
通过最快的路径对确切网络可靠性评估的替代方法
An alternative approach to the exact network reliability assessment through the quickest path
论文作者
论文摘要
将最快的路径问题扩展到网络可靠性，出现了一个新问题，旨在评估网络的可靠性，以通过在给定时间单位内通过一个最小路径（MP）将至少D单位数据从源节点传输到接收器节点。文献中的许多提出的方法检查网络的所有议员进行工作，然后根据公认的MP构建所需的系统状态向量。因此，他们需要提前拥有网络的所有国会议员。在这里，我们提出了一种简单的方法，该方法不需要提前任何MP。该算法已显示为纠正，并通过示例进行了说明。
Extending the quickest path problem to the network reliability, a new problem emerged which aims to assess the network reliability for transmitting at least d units of data from a source node to a sink node through one minimal path (MP) within given T units of time. Many of the proposed approaches in the literature check all the MPs of the network for doing the job and then construct desired system state vectors based on the accepted MPs. Hence, they need to have all the MPs of the network in advance. Here, we propose a simple approach that does not need any MP in advance. The algorithm is shown to be corrected and is illustrated through an example.
