Abstract
Currently, mobile edge computing (MEC) is one of the most popular techniques used to respond to real-time services from a wide range of mobile terminals. Compared with single-phase systems, commercial services in MEC can be modeled as phased-mission systems (PMS) and are much more complex, because of the dependencies across the phases. Over the past decade, researchers have proposed a set of new algorithms based on BDD for fault tree analysis of a wide range of PMS with various mission requirements and failure behaviors. The analysis to be performed on a fault tree can be either qualitative or quantitative. For the quantitative fault tree analysis of PMS by means of BDD, much work has been conducted. However, for the qualitative fault tree analysis of PMS by means of BDD, no much related work can be found. In this paper, we have presented some efficient methods to calculate the MCS encoding by a PMS BDD. Firstly, three kinds of redundancy relations-inclusive relation, internal-implication relation, and external-implication relation-within the cut set are identified, which prevent the cut set from being minimal cut set. Then, three BDD operations, IncRed, InImpRed, and ExImpRed, are developed, respectively, for the elimination of these redundancy relations. Using some proper combinations of these operations, MCS can be calculated correctly. As an illustration, some experimental results on a benchmark MEC system are given.
Highlights
Mobile edge computing (MEC) is one of the most popular techniques used to respond to real-time services from a wide range of mobile terminals [1,2,3,4]
A mobile edge computing (MEC) phased-mission systems (PMS) is defined as a commercial service, which is subject to multiple, consecutive, nonoverlapping phases of operation
For the qualitative fault tree analysis of MEC PMS by means of binary decision diagram (BDD), no much related work can be found. We focus on this line of research, that is, calculating the MCS encoding by a PMS BDD. e major contributions of our work are the following ones: (1) Different kinds of redundancy relations within the cut set encoding by a PMS BDD are identified, and it is these relations that prevent the cut set from being minimal cut set
Summary
Mobile edge computing (MEC) is one of the most popular techniques used to respond to real-time services from a wide range of mobile terminals [1,2,3,4]. Qualitative analysis of commercial services in MEC as phased-mission systems is much more complex, because of the dependencies across the phases. Researchers have proposed a set of new algorithms based on the binary decision diagram (BDD) for fault tree analysis of a wide range of PMS with various. Qualitative analysis involves calculating the minimal cut set (MCS), that is, listing all possible smallest combinations of basic events, which cause the top event. For the qualitative fault tree analysis of MEC PMS by means of BDD, no much related work can be found.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
