Hana Khamfroush

TL;DR: A constant-factor approximation algorithm for the homogeneous case and efficient heuristics for the general case are developed, which show that while the problem is polynomial-time solvable without storage constraints, it is NP-hard even if each edge cloud has unlimited communication or computation resources.

TL;DR: This work develops a polynomial-time algorithm that achieves a constant-factor approximation under certain conditions and proposes a two-time-scale framework that jointly optimizes service (data & code) placement and request scheduling, under storage, communication, computation, and budget constraints.

TL;DR: In this article, a two-time-scale framework that jointly optimizes service (code and data) placement and request scheduling, while considering storage, communication, computation, and budget constraints is proposed.

TL;DR: This paper addresses ongoing cascading failures involving the power grid and its communication network with imprecision in failure assessment with a twofold approach: once a cascading failure is detected, it is limited further propagation by redispatching generation and shedding loads and a recovery plan is formulated to maximize the total amount of load served during the recovery intervention.

TL;DR: Measurements show that enabling cooperation only among pairs of devices can decrease the completion time by up to 4.75 times, while delivering 100% of the 10000 generations transmitted, as compared to RLNC broadcast delivering only 88% of them in the authors' tests.