z-logo
Premium
Analysis of instantaneous availability of communication system based on the influence of support equipment
Author(s) -
Yang Yi,
Chen Yang,
Wen Meilin
Publication year - 2017
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.3480
Subject(s) - computer science , queueing theory , exponential distribution , exponential function , markov chain , communications system , transmission (telecommunications) , function (biology) , service (business) , process (computing) , reliability engineering , real time computing , distributed computing , telecommunications , computer network , machine learning , mathematical analysis , statistics , mathematics , economy , evolutionary biology , engineering , economics , biology , operating system
Summary Taking into account the influence of support equipment, in this paper, we propose an instantaneous availability (IA) model based on the Markov process and queuing theory. Using big data technique, we analyze the massive data of a communication system and generate its main features. We propose a new method to design system, by using these features in the proposed IA model. Two typical fault modes in communication system are studied. Firstly, an IA model considering repair equipment failure in the maintenance of one electronic unit is proposed. Then, we further enhance the IA model by exploring the queuing problem of multiple electronic units. M/G/1 queuing system is used to analyze the distribution function of waiting and service time. Simulations are performed to illustrate the validity of the model when parameters are under exponential distribution. In addition, we investigate the effect of parameters on IA. As a case study, we analyze the proposed IA model on an optical fiber transmission system and show the validity and applicability of the model.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here