Minimizing Transmission Time under Required System Capacity Constraint in Stochastic-Flow Networks
- 1 Computer Science Branch, Department of Mathematics, Faculty of Science, Aswan University, Aswan, Egypt
In the case of an existing limited capacity of the system called required system capacity, in this study a new method is presented to determine the disjoint paths to send data from the source to the sink. System reliability is evaluated as the probability that a specified amount of data can be transmitted from a source to a sink through two disjoint paths, subject to a time threshold and a required capacity. In addition, we study the effect of using the proposed method on the reliability evaluation in comparison with other previous methods.
Copyright: © 2018 Moatamad Refaat Hassan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 2,365 Views
- 1,305 Downloads
- 0 Citations
- Quickest Path Problem
- Disjoint Paths
- Stochastic-Flow Network (SFN)