Indian Journal of Science and Technology
Year: 2019, Volume: 12, Issue: 22, Pages: 1-8
M. R. Hassan1* and H. Abdou1,2
1Department of Mathematics, Computer Science Branch, Mathematics Department, Aswan University, Aswan, Egypt; [email protected]
2Department Applied Natural Sciences, Qassim University, Buraydah, Saudi Arabia; [email protected]
*Author for correspondence
M. R. Hassan
Department of Mathematics, Computer Science Branch, Mathematics Department, Aswan University, Aswan, Egypt; [email protected]
Objectives: This study is centered on four issues related to the reliability evaluation in multi-source multi-sink networks. Each issue discusses the reliability evaluation under different condition. These conditions play an important role in determining the quickest paths used in transmitting data between source and sink nodes, with the condition that the transmission time of the quickest path does not surpass a predetermined upper bound T. Methods/Statistical Analysis: Proposed algorithms used in each issue designed based on approaches taken from previous literatures to evaluate the reliability. Findings: The reliability ( RdwjT ) evaluated when each source transmits the demand dwj (the demand for resource w at sink node tj ) separately to the distinct sink, this is the first issue. The second issue deals with transmitting demands request by sink nodes from one source via a group of disjoint paths. In the case of transmitting demands through a gathering of joint paths, share one or more common arc, this is the third one. The last issue investigates the problem of sending demands requested by all sinks from all sources via joint paths. Application/Improvements: Examples are presented to illustrate how to evaluate the reliability of a multi-source multi-sink networking each case under time constraint.
Keywords: Joint and Disjoint Paths, Multi-Source Multi-Sink Stochastic-Flow Networks, Time Constraint, Quickest Path, System Reliability
Subscribe now for latest articles and news.