SearcharxivSearch

arXiv subjects

Patrick Kreidl

Publications and source records attributed to Patrick Kreidl.

3 recordsLinked to original sources

Sensor Management in Multi-Stage Stochastic Control Problems with Imperfect State Information

Technological advancements in miniaturization and wireless communications are yielding more affordable and versatile sensors and, in turn, more applications in which a network of sensors can be actively managed to best support overall decision-making objectives. We propose modeling the opportunity for sensor management within multi-stage stochastic control problems with imperfect state information. Such formulations inherently assume the state of the modeled environment cannot be accessed directly but instead the controller can observe only noisy measurements of the state and, therefore, at each decision stage some form of state estimation is required before a control is actuated. The notion of sensor management arises when the modeled controls not only affect the subsequent evolution of the state but can also affect the nature of future measurements and, hence, the quality of state estimates that drive future control decisions. In principle, the optimal strategy for any appropriately modeled multi-stage stochastic control problem with imperfect state information (with or without opportunity for sensor management) is the solution to a dynamic program; in practice, the computational requirements are typically prohibitive yet dynamic programming methods are still useful to guide the development of effective suboptimal strategies. In this spirit, we model the opportunity for sensor management within small-scale examples of two well-studied dynamic programming formulations, namely (1) the finite-state/finite-action Partially-Observable Markov Decision Process (PO-MDP) and (2) the Linear-Quadratic-Gaussian Regulator (LQGR). These examples admit solvable dynamic programs and confirm how the interplay between sensing and acting is a natural by-product of a dynamic programming solution.

eess.SY

A Markov Decision Process Model for Intrusion Tolerance Problems

We formulate and analyze a simplest Markov decision process model for intrusion tolerance problems, assuming that (i) each attack proceeds through one or more steps before the system's security fails, (ii) defensive responses that target these intermediate steps may only sometimes thwart the attack and (iii) reset responses that are sensible upon discovering an attack's completion may not always recover from the security failure. The analysis shows that, even in the ideal case of perfect detectors, it can be sub-optimal in the long run to employ defensive responses while under attack; that is, depending on attack dynamics and response effectiveness, the total overhead of ongoing defensive countermeasures can exceed the total risk of intermittent security failures. The analysis similarly examines the availability loss versus the risk reduction of employing preemptive resets, isolating key factors that determine whether system recovery is best initiated reactively or proactively. We also discuss model extensions and related work looking towards intrusion tolerance applications with (i) imperfect or controllable detectors, (ii) multiple types of attacks, (iii) continuous-time dynamics or (iv) strategic attackers.

eess.SY

Admission Control for Inelastic Traffic on a Link Shared by Deadline-Driven Elastic Traffic

Consider a (logical) link between two distributed data centers with available bandwidth designated for both deadline-driven elastic traffic, such as for scheduled synchronization services, and profitable inelastic traffic, such as for real-time streaming services. Admission control in this setting is cast as a stochastic shortest path problem, with state space derived from (discretization of) the elastic flow's size/deadline and action space corresponding to alternative subsets of admitted inelastic flows: the probabilistic model expresses uncertainty in both the link's available bandwidth and the inelastic flows' offered loads, while the objective function captures both congestion avoidance and the option to specify a desired minimum elastic rate. Its solution is shown to (i) balance the accumulation of instantaneous inelastic reward with the risk of missing the elastic deadline and (ii) exhibit a degree of robustness to link & flow modeling errors that is tunable via choice of the desired minimum elastic rate. Also discussed are state augmentations that befit urgent or non-interruptible inelastic traffic.

eess.SY