Next Article in Journal
System of Extended General Variational Inequalities for Relaxed Cocoercive Mappings in Hilbert Space
Next Article in Special Issue
Stochastic Comparisons and Dynamic Information of Random Lifetimes in a Replacement Model
Previous Article in Journal
Adaptive System for Steering a Ship Along the Desired Route
Previous Article in Special Issue
Fractional Queues with Catastrophes and Their Transient Behaviour
Article Menu
Issue 10 (October) cover image

Export Article

Open AccessFeature PaperArticle
Mathematics 2018, 6(10), 197;

Network Reliability Modeling Based on a Geometric Counting Process

Department of Statistics, Shiraz University, Shiraz 71454, Iran
Department of Statistics, University of Isfahan, Isfahan 81744, Iran
School of Mathematics, Institute of Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran
Author to whom correspondence should be addressed.
Received: 4 August 2018 / Revised: 28 September 2018 / Accepted: 8 October 2018 / Published: 11 October 2018
(This article belongs to the Special Issue Stochastic Processes with Applications)
Full-Text   |   PDF [552 KB, uploaded 11 October 2018]   |  


In 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 t = 0 . It is assumed that, at any time t > 0 , the network can be in one of three states up, partial performance or down. The components of the network are subjected to failure on the basis of a GCP, which leads to change of network states. Under these scenarios, we obtain several stochastic and dependency characteristics of the network lifetime. Some illustrative examples and plots are also provided throughout the article. View Full-Text
Keywords: two-dimensional signature; multi-state network; totally positive of order 2; stochastic order; stochastic process two-dimensional signature; multi-state network; totally positive of order 2; stochastic order; stochastic process

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Zarezadeh, S.; Ashrafi, S.; Asadi, M. Network Reliability Modeling Based on a Geometric Counting Process. Mathematics 2018, 6, 197.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Mathematics EISSN 2227-7390 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top