Network Reliability Modeling Based on a Geometric Counting Process
AbstractIn this paper, we investigate the reliability and stochastic properties of an n-component network under the assumption that the components of the network fail according to a counting process called a geometric counting process (GCP). The paper has two parts. In the first part, we consider a two-state network (with states up and down) and we assume that its components are subjected to failure based on a GCP. Some mixture representations for the network reliability are obtained in terms of signature of the network and the reliability function of the arrival times of the GCP. Several aging and stochastic properties of the network are investigated. The reliabilities of two different networks subjected to the same or different GCPs are compared based on the stochastic order between their signature vectors. The residual lifetime of the network is also assessed where the components fail based on a GCP. The second part of the paper is concerned with three-state networks. We consider a network made up of n components which starts operating at time
Share & Cite This Article
Zarezadeh, S.; Ashrafi, S.; Asadi, M. Network Reliability Modeling Based on a Geometric Counting Process. Mathematics 2018, 6, 197.
Zarezadeh S, Ashrafi S, Asadi M. Network Reliability Modeling Based on a Geometric Counting Process. Mathematics. 2018; 6(10):197.Chicago/Turabian Style
Zarezadeh, Somayeh; Ashrafi, Somayeh; Asadi, Majid. 2018. "Network Reliability Modeling Based on a Geometric Counting Process." Mathematics 6, no. 10: 197.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.