Online robust optimization framework for QoS guarantees in distributed soft real-time systems

Lee, Jinkyu; Shin, Insik; Easwaran, Arvind

http://hdl.handle.net/10400.22/3905

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ART_JLee_2010_CISTER.pdf		507.29 KB	Adobe PDF	Download

Send Feedback

Authors

Lee, Jinkyu

Shin, Insik

Easwaran, Arvind

Abstract(s)

In distributed soft real-time systems, maximizing the aggregate quality-of-service (QoS) is a typical system-wide goal, and addressing the problem through distributed optimization is challenging. Subtasks are subject to unpredictable failures in many practical environments, and this makes the problem much harder. In this paper, we present a robust optimization framework for maximizing the aggregate QoS in the presence of random failures. We introduce the notion of K-failure to bound the effect of random failures on schedulability. Using this notion we define the concept of K-robustness that quantifies the degree of robustness on QoS guarantee in a probabilistic sense. The parameter K helps to tradeoff achievable QoS versus robustness. The proposed robust framework produces optimal solutions through distributed computations on the basis of Lagrangian duality, and we present some implementation techniques. Our simulation results show that the proposed framework can probabilistically guarantee sub-optimal QoS which remains feasible even in the presence of random failures.