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

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.

This is a preview of subscription content, access via your institution.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Abbreviations

QPP:

Quickest path problem

SFN:

Stochastic flow network

MP:

Minimal path

MCS:

Monte Carlo simulation

ADF:

Allocation of data flow

TANET:

Taiwan academic network

n; n′ :

Number of arcs in SFN; number of arcs in the simplified SFN

q; q′ :

Number of nodes in SFN; number of nodes in the simplified SFN

a i; a i :

Component i in SFN, i = 1, 2, …, n + q; component i in the simplified SFN, i = 1, 2, …, n′ + q′

A; A′ :

{ai|1 ≤ i ≤ n}: the set of arcs in SFN; {ai|1 ≤ i ≤ n′}: the set of arcs in the simplified SFN

N; N′ :

{ai|n + 1 ≤ i ≤ n + q}: the set of nodes in SFN; {ai|n′ + 1 ≤ i ≤ n′ + q′}: the set of nodes in the simplified SFN

M i; M i :

Maximal capacity of ai, i = 1, 2,…, n; maximal capacity of ai, i = 1, 2, …, n′

M; M′ :

{Mi|1 ≤ i ≤ n}; {Mi|1 ≤ i ≤ n′}

l i; l i :

Lead time of ai, i = 1, 2,…, n; lead time of ai′, i = 1, 2, …, n

L; L′ :

{li|1 ≤ i ≤ n}; {li|1 ≤ i ≤ n′}

c i; c i :

Transmission cost on ai, i = 1, 2,…, n; lead time of ai′, i = 1, 2, …, n

C; C′ :

{ci|1 ≤ i ≤ n}; {ci|1 ≤ i ≤ n′}

G; G′ :

(A, N, L, M, C): a SFN; (A′, N′, L′, M′, C′): a simplified SFN

G :

Number of MPs in a group

P j :

jth MP in SFN, j = 1, 2, …, g

V e :

eth group of g MPs in SFN, e = 1, 2,…, u

N s :

number of successes

N r :

Number of runs

d :

Total amount of data

P j :

jth MP in the simplified SFN, j = 1, 2, …, g

d j :

Amount of data assigned to Pj, j = 1, 2, …, g

s i :

Current capacity of ai, i = 1, 2, …, n′

S :

(s1, s2, …, sn′): a system state

t :

Point in time

T :

Time constraint

B :

Budget limit

d j(t):

Amount of data assigned to Pj in data buffer at t, j = 1, 2, …, g, t = 1, 2, …, T

m j :

Number of components on Pj

\( a_{k}^{j} \) :

kth component on Pj, j = 1, 2, …, g, k = 1, 2, …, mj

\( s_{k}^{j} \) :

Capacity of \( a_{k}^{j} \), j = 1, 2, …, g, k = 1, 2, …, mj

\( l_{k}^{j} \) :

Lead time of \( a_{k}^{j} \), j = 1, 2, …, g, k = 1, 2, …, mj

\( X_{k}^{j} (t) \) :

Amount of data assigned to Pj on \( a_{k}^{j} \) at t, t = 1, 2, …, T, j = 1, 2, …, g, k = 1, 3, …, mj (odd number)

\( Y_{k}^{j,c} (t) \) :

Amount of data assigned to Pj at cth position inside \( a_{k}^{j} \) at t, t = 1, 2, …, T, j = 1, 2, …, g, k = 2, 4, …, mj – 1 (even number), c = 1, 2, …, \( l_{k}^{j} \) – 1

\( q_{k}^{j} \) :

Maximum available capacity of \( a_{k}^{j} \)

References

  1. Ata, M. Y. (2007). A convergence criterion for the Monte Carlo estimates. Simulation Modelling Practice and Theory, 15(3), 237–246.

    Article  Google Scholar 

  2. Bai, G., Tian, Z., & Zuo, M. J. (2016). An improved algorithm for finding all minimal paths in a network. Reliability Engineering & System Safety, 150, 1–10.

    Article  Google Scholar 

  3. Benkamra, Z., Terbeche, M., & Tlemcani, M. (2011). Tow stage design for estimating the reliability of series/parallel systems. Mathematics and Computers in Simulation, 81(10), 2062–2072.

    Article  Google Scholar 

  4. Borowik, P., Thobel, J. L., & Adamowicz, L. (2017). Modified Monte Carlo method for study of electron transport in degenerate electron gas in the presence of electron–electron interactions, application to graphene. Journal of Computational Physics, 341, 397–405.

    Article  Google Scholar 

  5. Calvete, H. I., del-Pozo, L., & Iranzo, J. A. (2012). Algorithms for the quickest path problem and the reliable quickest path problem. Computational Management Science, 9(2), 255–272.

    Article  Google Scholar 

  6. Chang, P. C. (2019). Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute. Annals of Operations Research. https://doi.org/10.1007/s10479-019-03427-4.

    Article  Google Scholar 

  7. Chang, P. C., & Lin, Y. K. (2015). Reliability analysis for an apparel manufacturing system applying fuzzy multistate network. Computers & Industrial Engineering, 88, 458–469.

    Article  Google Scholar 

  8. Chen, Y. L. (1993). An algorithm for finding the k quickest paths in a network. Computers & Operations Research, 20(1), 59–65.

    Article  Google Scholar 

  9. Chen, Y. L. (1994). Finding the k quickest simple paths in a network. Information Processing Letters, 50(2), 89–92.

    Article  Google Scholar 

  10. Chen, Y. L., & Chin, Y. H. (1990). The quickest path problem. Computers & Operations Research, 17(2), 153–161.

    Article  Google Scholar 

  11. Chen, G. H., & Hung, Y. C. (1993). On the quickest path problem. Information Processing Letters, 46(3), 125–128.

    Article  Google Scholar 

  12. Chen, S. G., & Lin, Y. K. (2012). Search for all minimal paths in a general large flow network. IEEE Transactions on Reliability, 61(4), 949–956.

    Article  Google Scholar 

  13. Clímaco, J. C., & Pascoal, M. M. (2012). Multicriteria path and tree problems: discussion on exact algorithms and applications. International Transactions in Operational Research, 19(1–2), 63–98.

    Article  Google Scholar 

  14. Duque, D., Lozano, L., & Medaglia, A. L. (2015). An exact method for the biobjective shortest path problem for large-scale road networks. European Journal of Operational Research, 242(3), 788–797.

    Article  Google Scholar 

  15. Fang, Z., Mo, H., Wang, Y., & Xie, M. (2017). Performance and reliability improvement of cyber-physical systems subject to degraded communication networks through robust optimization. Computers & Industrial Engineering, 114, 166–174.

    Article  Google Scholar 

  16. Fishman, G. S. (1986a). A comparison of four Monte Carlo methods for estimating the probability of s-t connectedness. IEEE Transactions on Reliability, 35(2), 145–155.

    Article  Google Scholar 

  17. Fishman, G. S. (1986b). A Monte Carlo sampling plan for estimating network reliability. Operations Research, 34(4), 581–594.

    Article  Google Scholar 

  18. Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton U. Press.

    Google Scholar 

  19. Forghani-elahabad, M., & Mahdavi-Amiri, N. (2016). An improved algorithm for finding all upper boundary points in a stochastic-flow network. Applied Mathematical Modelling, 40(4), 3221–3229.

    Article  Google Scholar 

  20. Han, D. H., Kim, Y. D., & Lee, J. Y. (2014). Multiple-criterion shortest path algorithms for global path planning of unmanned combat vehicles. Computers & Industrial Engineering, 71, 57–69.

    Article  Google Scholar 

  21. Hung, Y. C., & Chen, G. H. (1992). Distributed algorithms for the quickest path problem. Parallel Computing, 18(7), 823–834.

    Article  Google Scholar 

  22. Janssen, H. (2013). Monte-Carlo based uncertainty analysis: Sampling efficiency and sampling convergence. Reliability Engineering & System Safety, 109, 123–132.

    Article  Google Scholar 

  23. Kim, B., & Kim, T. W. (2017). Monte Carlo simulation for offshore transportation. Ocean Engineering, 129, 177–190.

    Article  Google Scholar 

  24. Lee, D. T., & Papadopoulou, E. (1993). The all-pairs quickest path problem. Information Processing Letters, 45(5), 261–267.

    Article  Google Scholar 

  25. Levitin, G., & Lisnianski, A. (2001). A new approach to solving problems of multi-state system reliability optimization. Quality and reliability engineering international, 17(2), 93–104.

    Article  Google Scholar 

  26. Lin, Y. K. (2001). A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Computers & Operations Research, 28(13), 1277–1285.

    Article  Google Scholar 

  27. Lin, Y. K. (2010a). Spare routing reliability for a stochastic flow network through two minimal paths under budget constraint. IEEE Transactions on Reliability, 59(1), 2–10.

    Article  Google Scholar 

  28. Lin, Y. K. (2010b). System reliability of a stochastic-flow network through two minimal paths under time threshold. International Journal of Production Economics, 124(2), 382–387.

    Article  Google Scholar 

  29. Lin, Y. K. (2011a). Transmission reliability of k minimal paths within time threshold. Computers & Industrial Engineering, 61(4), 1160–1165.

    Article  Google Scholar 

  30. Lin, Y. K. (2011b). Stochastic flow networks via multiple paths under time threshold and budget constraint. Computers & Mathematics with Applications, 62(6), 2629–2638.

    Article  Google Scholar 

  31. Lin, Y. K. (2011c). Spare routing problem with p minimal paths for time-based stochastic flow networks. Applied Mathematical Modelling, 35(3), 1427–1438.

    Article  Google Scholar 

  32. Lin, Y. K. (2011d). Network reliability of a time-based multistate network under spare routing with p minimal paths. IEEE Transactions on Reliability, 60(1), 61–69.

    Article  Google Scholar 

  33. Lin, Y. K., & Huang, C. F. (2015). Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability. International Journal of Systems Science, 46(6), 1020–1035.

    Article  Google Scholar 

  34. Lin, C. H., & Yang, W. N. (2011). A simple and efficient importance sampling scheme for stochastic network unreliability estimation. Simulation Modelling Practice and Theory, 19(3), 924–935.

    Article  Google Scholar 

  35. Lin, Y. K., Yeh, C. T., & Huang, C. F. (2013). Reliability evaluation of a stochastic-flow distribution network with delivery spoilage. Computers & Industrial Engineering, 66, 352–359.

    Article  Google Scholar 

  36. Lin, Y. K., Huang, D. H., & Huang, C. F. (2016). Estimated network reliability evaluation for a stochastic flexible flow shop network with different types of jobs. Computers & Industrial Engineering, 98, 352–359.

    Article  Google Scholar 

  37. Martins, E. D. Q. V., & Dos Santos, J. L. E. (1997). An algorithm for the quickest path problem. Operations Research Letters, 20(4), 195–198.

    Article  Google Scholar 

  38. Melchiori, A., & Sgalambro, A. (2018). A matheuristic approach for the Quickest Multicommodity k-splittable flow problem. Computers & Operations Research, 92, 111–129.

    Article  Google Scholar 

  39. Nguyen, T. P. (2020). Evaluation of network reliability for stochastic-flow air transportation network considering discounted fares from airlines. Annals of Operations Research, 1-21.

  40. Ramirez-Marquez, J. E., & Coit, D. W. (2005). A Monte-Carlo simulation approach for approximating multi-state two-terminal reliability. Reliability Engineering & System Safety, 87(2), 253–264.

    Article  Google Scholar 

  41. Ramirez-Marquez, J. E., & Coit, D. W. (2007). Multi-state component criticality analysis for reliability improvement in multi-state systems. Reliability Engineering & System Safety, 92(12), 1608–1619.

    Article  Google Scholar 

  42. Ruzika, S., & Thiemann, M. (2012). Min-Max quickest path problems. Networks, 60(4), 253–258.

    Article  Google Scholar 

  43. Tse, S. K., & Ding, C. (2018). Accelerated life test sampling plans under progressive type II interval censoring with random removals. International Journal of Statistics and Probability, 7(1), 26–38.

    Article  Google Scholar 

  44. Walȩdzik, K., & Mańdziuk, J. (2018). Applying hybrid Monte Carlo tree search methods to risk-aware project scheduling problem. Information Sciences, 460, 450–468.

    Article  Google Scholar 

  45. Yeh, W. C. (2016). New method in searching for all minimal paths for the directed acyclic network reliability problem. IEEE Transactions on Reliability, 65(3), 1263–1270.

    Article  Google Scholar 

  46. Zenklusen, R., & Laumanns, M. (2011). High-confidence estimation of small s-t reliabilities in directed acyclic networks. Networks, 57(4), 376–388.

    Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Cheng-Fu Huang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Lin, YK., Huang, CF. & Chang, CC. Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation. Ann Oper Res (2021). https://doi.org/10.1007/s10479-020-03923-y

Download citation

Keywords

  • Spare routing
  • Budget
  • Monte Carlo simulation
  • Reliability
  • Intersectional minimal paths