Accurate and interval estimates of the probability of network service availability for communication networks. (English) Zbl 1484.90024
Vishnevskiy, Vladimir M. (ed.) et al., Distributed computer and communication networks. 22nd international conference, DCCN 2019, Moscow, Russia, September 23–27, 2019. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1141, 15-26 (2019).
Summary: One of the important and universal characteristics of the network performance for both a user and a network owner is the probability of the network service availability at any time. To obtain an accurate estimate of the probability of a particular network service availability in the class of binary stochastic models, effective methods of structure function decomposition are used. The paper discusses the issues of obtaining accurate estimates of the probability of network service availability for arbitrary pairs of network nodes. Lower bound and upper bound estimates for the probability of network service availability are constructed for large dimension networks with a complex structure.
For the entire collection see [Zbl 1470.68030].
For the entire collection see [Zbl 1470.68030].
MSC:
| 90B18 | Communication networks in operations research |
| 90B25 | Reliability, availability, maintenance, inspection in operations research |
Keywords:
binary stochastic model; availability of network services; alternating renewal process; Boolean algebra; isomorphism of properties and classes algebraReferences:
| [1] | Beichelt, F., Franken, P.: Zuverlässigkeit und Instandhaltung. Mathematische Methoden. Verlag Technik, Berlin (1983) |
| [2] | Zaychenko, Yu., Vasyliev, V., Vishtal, D., Khotyachuk, R.: Analysis of the viability of the DTS at the design stage. In: International Scientific and Practical Conference on Decision Making Systems and Information Technologies, Chernivtsi, pp. 48-49 (2004) |
| [3] | Rocco, C.M., Zio, E.: Solving advanced network reliability problems by means of cellular automata and Monte Carlo sampling. Reliab. Eng. Syst. Saf. 89, 219-226 (2005) · doi:10.1016/j.ress.2004.08.025 |
| [4] | Wood, R.K.: Factoring algorithms for computing k-terminal network reliability. IEEE Trans. Reliab. 35, 269-278 (1986) · Zbl 0602.90064 · doi:10.1109/TR.1986.4335431 |
| [5] | Wilson, J.M.: An improved minimizing algorithm for sum of disjoint products. IEEE Trans. Reliab. 39, 42-45 (1990) · Zbl 0703.90037 · doi:10.1109/24.52639 |
| [6] | Shier, D.R.: Network Reliability and Algebraic Structures. Clarendon Press, Oxford (1991) · Zbl 0729.90033 |
| [7] | Volkanovski, A., Cepin, M., Mavko, B.: Application of the fault tree analysis for assessment of power system reliability. Reliab. Eng. Syst. Saf. 94, 1116-1127 (2009) · doi:10.1016/j.ress.2009.01.004 |
| [8] | Zio, E.: Reliability engineering: old problems and new challenges. Reliab. Eng. Syst. Saf. 6, 128-133 (2008) |
| [9] | Lin, Y.K.: Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliab. Eng. Syst. Saf. 75, 41-46 (2002) · doi:10.1016/S0951-8320(01)00110-7 |
| [10] | Zio, E., Podofillini, L., Zille, V.: A combination of Monte Carlo simulation and cellular automata for computing the availability of complex network systems. Reliab. Eng. Syst. Saf. 91, 181-190 (2006) · doi:10.1016/j.ress.2004.12.002 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
