Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation

Yi-Kuei Lin, Cheng-Fu Huang () and Chin-Chia Chang
Additional contact information
Yi-Kuei Lin: National Chiao Tung University
Cheng-Fu Huang: Feng Chia University
Chin-Chia Chang: National Taiwan University of Science and Technology

Annals of Operations Research, 2022, vol. 312, issue 1, No 17, 345-368

Abstract: Abstract A stochastic flow network composed of multistate arcs can be utilized to describe several practical systems such as computer networks, where transmission time taken for sending data to a sink is an important index. Determining a path with minimum transmission time is known as the quickest path problem (QPP). All algorithms addressing the QPP assume that the determined minimal paths (MPs) are disjoint. Further, for the general case of intersectional MPs, if a congestion phenomenon occurs during the transmission process, these algorithms will lead to an incorrect outcome. Moreover, in practical scenarios, as a budget limit is considered, spare routing is applied to consolidate the system. The objective is to develop an algorithm based on Monte Carlo simulations (MCSs) for evaluating the system reliability while considering the congestion phenomenon. The system reliability is the probability that a specific amount of data can be transmitted successfully through multiple MPs under both time and budget constraints. Furthermore, spare routing to increase the system reliability is established in advance to specify the main and spare MPs. Experiments validate the evaluation of system reliability based on MCSs. The credibility and efficiency of the proposed algorithm are also discussed.

Keywords: Spare routing; Budget; Monte Carlo simulation; Reliability; Intersectional minimal paths (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-020-03923-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:312:y:2022:i:1:d:10.1007_s10479-020-03923-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-020-03923-y

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().