AJAS Cover
Frequency: Continuous
ISSN: 1546-9239 (Print)
ISSN: 1554-3641 (Online)
Research Article Open Access

Minimizing Transmission Time under Required System Capacity Constraint in Stochastic-Flow Networks

Moatamad Refaat Hassan1
  • 1 Computer Science Branch, Department of Mathematics, Faculty of Science, Aswan University, Aswan, Egypt

Abstract

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.

American Journal of Applied Sciences
Volume 15 No. 5, 2018, 251-260

DOI: https://doi.org/10.3844/ajassp.2018.251.260

Submitted On: 6 December 2017 Published On: 5 May 2018

How to Cite: Hassan, M. R. (2018). Minimizing Transmission Time under Required System Capacity Constraint in Stochastic-Flow Networks. American Journal of Applied Sciences, 15(5), 251-260. https://doi.org/10.3844/ajassp.2018.251.260

Open AccessCopyright: © 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.

  • 3,837 Views
  • 1,918 Downloads
  • 0 Citations

Download

Keywords

  • Quickest Path Problem
  • Disjoint Paths
  • Stochastic-Flow Network (SFN)