Browsing by Subject "Alarm systems"

Now showing 1 - 3 of 3

Open Access
ALACA: a platform for dynamic alarm collection and alert notification in network management systems
(John Wiley and Sons Ltd., 2017) Solmaz, S. E.; Gedik, B.; Ferhatosmanoğlu, H.; Sözüer, S.; Zeydan, E.; Etemoğlu, Ç. Ö.
Mobile network operators run Operations Support Systems that produce vast amounts of alarm events. These events can have different significance levels and domains and also can trigger other ones. Network operators face the challenge to identify the significance and root causes of these system problems in real time and to keep the number of remedial actions at an optimal level, so that customer satisfaction rates can be guaranteed at a reasonable cost. In this paper, we propose a scalable streaming alarm management system, referred to as Alarm Collector and Analyzer, that includes complex event processing and root cause analysis. We describe a rule mining and root cause analysis solution for alarm event correlation and analyses. The solution includes a dynamic index for matching active alarms, an algorithm for generating candidate alarm rules, a sliding window–based approach to save system resources, and a graph-based solution to identify root causes. Alarm Collector and Analyzer is used in the network operation center of a major mobile telecom provider. It helps operators to enhance the design of their alarm management systems by allowing continuous analysis of data and event streams and predict network behavior with respect to potential failures by using the results of root cause analysis. We present experimental results that provide insights on performance of real-time alarm data analytics systems. Copyright © 2017 John Wiley & Sons, Ltd.
Open Access
Sequential sensor installation for wiener disorder detection
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2016) Dayanik, S.; Sezer, S. O.
We consider a centralized multisensor online quickest disorder detection problem where the observation from each sensor is a Wiener process gaining a constant drift at a common unobservable disorder time. The objective is to detect the disorder time as quickly as possible with small probability of false alarms. Unlike the earlier work on multisensor change detection problems, we assume that the observer can apply a sequential sensor installation policy. At any time before a disorder alarm is raised, the observer can install new sensors to collect additional signals. The sensors are statistically identical, and there is a fixed installation cost per sensor. We propose a Bayesian formulation of the problem. We identify an optimal policy consisting of a sequential sensor installation strategy and an alarm time, which minimize a linear Bayes risk of detection delay, false alarm, and new sensor installations. We also provide a numerical algorithm and illustrate it on examples. Our numerical examples show that significant reduction in the Bayes risk can be attained compared to the case where we apply a static sensor policy only. In some examples, the optimal sequential sensor installation policy starts with 30% less number of sensors than the optimal static sensor installation policy and the total percentage savings reach to 12%.
Open Access
Wiener disorder problem with observations at fixed discrete time epochs
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2010) Dayanik, S.
Suppose that a Wiener process gains a known drift rate at some unobservable disorder time with some zero-modified exponential distribution. The process is observed only at known fixed discrete time epochs, which may not always be spaced in equal distances. The problem is to detect the disorder time as quickly as possible by means of an alarm that depends only on the observations of Wiener process at those discrete time epochs. We show that Bayes optimal alarm times, which minimize expected total cost of frequent false alarms and detection delay time, always exist. Optimal alarms may in general sound between observation times and when the space-time process of the odds that disorder happened in the past hits a set with a nontrivial boundary. The optimal stopping boundary is piecewise-continuous and explodes as time approaches from left to each observation time. On each observation interval, if the boundary is not strictly increasing everywhere, then it irst decreases and then increases. It is strictly monotone wherever it does not vanish. Its decreasing portion always coincides with some explicit function. We develop numerical algorithms to calculate nearly optimal detection algorithms and their Bayes risks, and we illustrate their use on numerical examples. The solution of Wiener disorder problem with discretely spaced observation times will help reduce risks and costs associated with disease outbreak and production quality control, where the observations are often collected and/or inspected periodically.