Based on the interval type-2 fuzzy (IT2F) approach, this article investigates the fault detection filter design problem for a class of nonhomogeneous higher level Markov jump systems with uncertain transition probabilities. Considering that the mode information of the system cannot be obtained synchronously by the filter, the hidden Markov model can be seen as a detector to handle this asynchronous problem, and the parameter uncertainty can be processed by the IT2F approach with the lower and upper membership functions. Then, the asynchronous IT2F filter is designed to deal with the fault detection problem. Furthermore, the Gaussian transition probability density function is introduced to describe the uncertainty transition probabilities of the system and the filter. Based on the Lyapunov theory, the existence of the designed asynchronous IT2F filter and the dissipativity of the filter error system can be well ensured. In this article, the simulation study on a quarter-car suspension system verifies that the designed asynchronous IT2F filter can detect faults without error alarms.
1 September 2019 in Journal of Differential Equations
The ever-increasing mobile traffic has inspired deployment of capacity and performance enhancing network services within mobile networks. Owing to recent advances in network function virtualization, such network services can be flexibly and cost-efficiently deployed in the mobile network as software components, avoiding the need for costly hardware deployment. Nevertheless, this complicates network planning by bringing the need for service function chaining. In this paper, we study mobile network planning through a software-defined approach, considering both quality-of-service and reliability of different classes of traffic. We define and formulate the traffic steering problem for service function chaining in mobile networks, which turns out to be $\mathcal {NP}$ -hard. We then develop a fast approximation scheme for the problem, and evaluate its performance via extensive simulation experiments. The results show that our algorithm is near-optimal, and achieves much better performance compared with baseline algorithms.
26 January 2011 in Communications in Mathematical Physics