activity
20102026
most citedRobustness of Interdependent Networks: The case of communication networks and the power grid

110 citations · 445 across the 82 of their papers we have counts for

collaborators
Showing 2016Show all

9 papers · 1 filter

cs.NI2016★ 4 cited

A Distributed Algorithm for Throughput Optimal Routing in Overlay Networks

Anurag Rai, Rahul Singh, Eytan Modiano

We address the problem of optimal routing in overlay networks. An overlay network is constructed by adding new overlay nodes on top of a legacy network. The overlay nodes are capab…

math.OC2016

Optimal Control for Generalized Network-Flow Problems

Abhishek Sinha, Eytan Modiano

We consider the problem of throughput-optimal packet dissemination, in the presence of an arbitrary mix of unicast, broadcast, multicast and anycast traffic, in a general wireless…

cs.SI2016★ 3 cited

Robustness of Bidirectional Interdependent Networks: Analysis and Design

Marzieh Parandehgheibi, Eytan Modiano

We study the robustness of interdependent networks where two networks are said to be interdependent if the operation of one network depends on the operation of the other one, and v…

eess.SY2016

Distributed Frequency Control in Power Grids Under Limited Communication

Marzieh Parandehgheibi, Konstantin Turitsyn, Eytan Modiano

In this paper, we analyze the impact of communication failures on the performance of optimal distributed frequency control. We consider a consensus-based control scheme, and show t…

cs.NI2016

Robust Design of Spectrum-Sharing Networks

Qingkai Liang, Hyang-Won Lee, Eytan Modiano

In spectrum-sharing networks, primary users have the right to preempt secondary users, which significantly degrades the performance of underlying secondary users. In this paper, we…

cs.IT2016

Throughput-Optimal Broadcast in Wireless Networks with Dynamic Topology

Abhishek Sinha, Leandros Tassiulas, Eytan Modiano

We consider the problem of throughput-optimal broadcast- ing in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). Previous b…