Abstract
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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call