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 2024Show all

6 papers · 1 filter

cs.NI2024

An Ordinary Differential Equation Framework for Stability Analysis of Networks with Finite Buffers

Xinyu Wu, Dan Wu, Eytan Modiano

We consider the problem of network stability in finite-buffer systems. We observe that finite buffer may affect stability even in simplest network structure, and we propose an ordi…

cs.NI2024

Fundamental Limits of Routing Attack on Network Overload

Xinyu Wu, Eytan Modiano

We quantify the threat of network adversaries to inducing \emph{network overload} through \emph{routing attacks}, where a subset of network nodes are hijacked by an adversary. We d…

cs.NI2024

Achieving AoI Fairness in Spatially Distributed Wireless Networks: From Theory to Implementation

Nicholas Jones, Joshua Wornell, Chao Li +1

We design and implement two variants of a practical random access protocol called WiFair, based on IEEE 802.11 and designed to mitigate spatial unfairness in Age of Information (Ao…

eess.SY2024★ 14 cited

Power Failure Cascade Prediction using Graph Neural Networks

Sathwik Chadaga, Xinyu Wu, Eytan Modiano

We consider the problem of predicting power failure cascades due to branch failures. We propose a flow-free model based on graph neural networks that predicts grid states at every…

cs.AI2024

Intervention-Assisted Policy Gradient Methods for Online Stochastic Queuing Network Optimization: Technical Report

Jerrod Wigmore, Brooke Shrader, Eytan Modiano

Deep Reinforcement Learning (DRL) offers a powerful approach to training neural network control policies for stochastic queuing networks (SQN). However, traditional DRL methods rel…

cs.NI2024

Optimal Slicing and Scheduling with Service Guarantees in Multi-Hop Wireless Networks

Nicholas Jones, Eytan Modiano

We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees. Using network slicing to decouple the queueing dynamics between flows, we show that…