The communication networks are complex and considered a stochastic flow network. This throws enormous challenges for the service provider to provide a desired Quality of Service (QoS) to the customer. Due to the stochastic behavior of the network, ensuring QoS requires serious efforts to make the entire system work within the given time constraint, cost, and failure rate. When the communication problem is time-bound, providing a quick and reasonable solution with a permissible error rate is of great importance. Therefore, in this paper, fast solutions to data communication problems are proposed to send the required $d$ units of user’s data from the desired source node to the destination node within some constraints such as permissible error rate $ϵ$, time constraint $T$ and maintenance budget constraints $B$. System reliability and the performance of the proposed approaches are evaluated using minimal paths. All the minimal flow vectors evaluated from minimal paths that satisfy all the above-mentioned constraints are considered for network reliability evaluation. Further, the proposed approaches are observed as faster concerning computation time than the existing approaches.

通信网络很复杂，被认为是一个随机流网络。这给服务提供商向客户提供所需的服务质量 (QoS) 带来了巨大挑战。由于网络的随机行为，确保 QoS 需要认真努力，使整个系统在给定的时间限制、成本和故障率内工作。当通信问题有时间限制时，提供具有允许错误率的快速合理的解决方案非常重要。因此，在本文中，提出了数据通信问题的快速解决方案，以发送所需的$d$ 在某些限制条件（例如允许的错误率）内，从所需的源节点到目标节点的用户数据单元 $\epsilon$， 时间限制 $吨$ 和维护预算限制 $乙$. 系统可靠性和所提出方法的性能使用最小路径进行评估。从满足所有上述约束的最小路径评估的所有最小流向量都被考虑用于网络可靠性评估。此外，观察到所提出的方法在计算时间方面比现有方法更快。