433 citations · 1.3k across the 96 of their papers we have counts for
32 papers · 1 filter
Biased Backpressure Routing for Multihop Wireless Networks with Heterogeneous Interfaces
Yujun Ming, Zhongyuan Zhao, Fikadu Dagefu +5
Heterogeneous-interface multihop wireless networks (Het-MuNets) are emerging as a promising paradigm for tactical networks and for infrastructure-light applications such as vehicul…
Ant Backpressure Routing for Dynamic Wireless Multi-hop Networks with Mixed Traffic Patterns
Negar Erfaniantaghvayi, Zhongyuan Zhao, Kevin Chan +2
Backpressure (BP) routing and its shortest-path biased variant (SP-BP) provide powerful congestion-aware multipath resource allocation for wireless multi-hop networks, but they rel…
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…
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…
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…
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…
Ant Backpressure Routing for Wireless Multi-hop Networks with Mixed Traffic Patterns
Negar Erfaniantaghvayi, Zhongyuan Zhao, Kevin Chan +3
A mixture of streaming and short-lived traffic presents a common yet challenging scenario for Backpressure routing in wireless multi-hop networks. Although state-of-the-art shortes…
Biased Backpressure Routing Using Link Features and Graph Neural Networks
Zhongyuan Zhao, Bojan Radojičić, Gunjan Verma +2
To reduce the latency of Backpressure (BP) routing in wireless multi-hop networks, we propose to enhance the existing shortest path-biased BP (SP-BP) and sojourn time-based backlog…
Enhanced Backpressure Routing Using Wireless Link Features
Zhongyuan Zhao, Gunjan Verma, Ananthram Swami +1
Backpressure (BP) routing is a well-established framework for distributed routing and scheduling in wireless multi-hop networks. However, the basic BP scheme suffers from poor end-…
Learnable Digital Twin for Efficient Wireless Network Evaluation
Boning Li, Timofey Efimov, Abhishek Kumar +4
Network digital twins (NDTs) facilitate the estimation of key performance indicators (KPIs) before physically implementing a network, thereby enabling efficient optimization of the…
HTNet: Dynamic WLAN Performance Prediction using Heterogenous Temporal GNN
Hongkuan Zhou, Rajgopal Kannan, Ananthram Swami +1
Predicting the throughput of WLAN deployments is a classic problem that occurs in the design of robust and high performance WLAN systems. However, due to the increasingly complex c…
Failure Localization Capability: Theorem Proof and Evaluation
Liang Ma, Ting He, Ananthram Swami +2
This is a technical report, containing all the theorem proofs and additional evaluations in paper "Network Capability in Localizing Node Failures via End-to-end Path Measurements"…
Link Identifiability with Two Monitors: Proof of Selected Theorems
Liang Ma, Ting He, Kin K. Leung +2
This is a technical report, containing all the theorem proofs in paper "Link Identifiability in Communication Networks with Two Monitors" by Liang Ma, Ting He, Kin K. Leung, Ananth…
Identification of Additive Link Metrics: Proof of Selected Theorems
Liang Ma, Ting He, Kin K. Leung +2
This is a technical report, containing all the theorem proofs in the following two papers: (1) Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, and Don Towsley, "Identifiability o…
Additive Link Metrics Identification: Proof of Selected Lemmas and Propositions
Liang Ma, Ting He, Kin K. Leung +2
This is a technical report, containing all the lemma and proposition proofs in paper "Topological Constraints on Identifying Additive Link Metrics via End-to-end Paths Measurements…
Efficient Identification of Additive Link Metrics: Theorem Proof and Evaluations
Liang Ma, Ting He, Kin K. Leung +2
This is a technical report, containing all the theorem proofs and additional evaluations in paper "Efficient Identification of Additive Link Metrics via Network Tomography" by Lian…
Partial Network Identifiability: Theorem Proof and Evaluation
Liang Ma, Ting He, Kin K. Leung +2
This is a technical report, containing all the theorem proofs and additional evaluations in paper "Monitor Placement for Maximal Identifiability in Network Tomography" by Liang Ma,…
Fundamental Theories in Node Failure Localization
Liang Ma, Ting He, Ananthram Swami +3
This is a technical report, containing all the theorem proofs in paper "Node Failure Localization in Communication Networks via Network Tomography" by Liang Ma, Ting He, Ananthram…
Node Failure Localization: Theorem Proof
Liang Ma, Ting He, Ananthram Swami +2
This is a technical report, containing all the theorem proofs in paper "On Optimal Monitor Placement for Localizing Node Failures via Network Tomography" by Liang Ma, Ting He, Anan…
Let's Share: A Game-Theoretic Framework for Resource Sharing in Mobile Edge Clouds
Faheem Zafari, Kin K. Leung, Don Towsley +3
Mobile edge computing seeks to provide resources to different delay-sensitive applications. This is a challenging problem as an edge cloud-service provider may not have sufficient…
MACS: Deep Reinforcement Learning based SDN Controller Synchronization Policy Design
Ziyao Zhang, Liang Ma, Konstantinos Poularakis +3
In distributed software-defined networks (SDN), multiple physical SDN controllers, each managing a network domain, are implemented to balance centralised control, scalability, and…
Joint Data Compression and Caching: Approaching Optimality with Guarantees
Jian Li, Faheem Zafari, Don Towsley +2
We consider the problem of optimally compressing and caching data across a communication network. Given the data generated at edge nodes and a routing path, our goal is to determin…