433 citations · 1.3k across the 96 of their papers we have counts for
11 papers · 1 filter
A Differentiable Digital Twin of Distributed Link Scheduling for Contention-Aware Networking
Zhongyuan Zhao, Yujun Ming, Kevin Chan +2
Many routing and flow optimization problems in wired networks can be solved efficiently using minimum cost flow formulations. However, this approach does not extend to wireless mul…
Topology Identification and Inference over Graphs
Gonzalo Mateos, Yanning Shen, Georgios B. Giannakis +1
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and inform…
Link-Sharing Backpressure Routing In Wireless Multi-Hop Networks
Zhongyuan Zhao, Yujun Ming, Ananthram Swami +3
Backpressure (BP) routing and scheduling is an established resource allocation method for wireless multi-hop networks, noted for its fully distributed operation and maximum queue s…
Mitigating Participation Imbalance Bias in Asynchronous Federated Learning
Xiangyu Chang, Manyi Yao, Srikanth V. Krishnamurthy +5
In Asynchronous Federated Learning (AFL), the central server immediately updates the global model with each arriving client's contribution. As a result, clients perform their local…
NOMAD -- Navigating Optimal Model Application to Datastreams
Ashwin Gerard Colaco, Sharad Mehrotra, Michael J De Lucia +5
NOMAD (Navigating Optimal Model Application for Datastreams) is an intelligent framework for data enrichment during ingestion that optimizes realtime multiclass classification by d…
Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)
Zhongyuan Zhao, Gunjan Verma, Ananthram Swami +1
In wireless networks characterized by dense connectivity, the significant signaling overhead generated by distributed link scheduling algorithms can exacerbate issues like congesti…
SeLR: Sparsity-enhanced Lagrangian Relaxation for Computation Offloading at the Edge
Negar Erfaniantaghvayi, Zhongyuan Zhao, Kevin Chan +2
This paper introduces a novel computational approach for offloading sensor data processing tasks to servers in edge networks for better accuracy and makespan. A task is assigned wi…
Generalizing Biased Backpressure Routing and Scheduling to Wireless Multi-hop Networks with Advanced Air-interfaces
Zhongyuan Zhao, Yujun Ming, Ananthram Swami +3
Backpressure (BP) routing and scheduling is a well-established resource allocation method for wireless multi-hop networks, known for its fully distributed operations and proven max…
To Offload or Not To Offload: Model-driven Comparison of Edge-native and On-device Processing In the Era of Accelerators
Nathan Ng, David Irwin, Ananthram Swami +2
Computational offloading is a promising approach for overcoming resource constraints on client devices by moving some or all of an application's computations to remote servers. Wit…
When not to target negative ties? Studying competitive influence maximisation in signed networks
Sukankana Chakraborty, Markus Brede, Sebastian Stein +1
We explore the influence maximisation problem in networks with negative ties. Where prior work has focused on unsigned networks, we investigate the need to consider negative ties i…
Joint Task Offloading and Routing in Wireless Multi-hop Networks Using Biased Backpressure Algorithm
Zhongyuan Zhao, Jake Perazzone, Gunjan Verma +3
A significant challenge for computation offloading in wireless multi-hop networks is the complex interaction among traffic flows in the presence of interference. Existing approache…