62 citations · 91 across the 8 of their papers we have counts for
8 papers
Optimal Network Control in Partially-Controllable Networks
Qingkai Liang, Eytan Modiano
The effectiveness of many optimal network control algorithms (e.g., BackPressure) relies on the premise that all of the nodes are fully controllable. However, these algorithms may…
Celer Network: Bring Internet Scale to Every Blockchain
Mo Dong, Qingkai Liang, Xiaozhou Li +1
Off-chain scaling techniques allow mutually distrustful parties to execute a contract locally among themselves instead of on the global blockchain. Parties involved in the transact…
Accelerated Primal-Dual Policy Optimization for Safe Reinforcement Learning
Qingkai Liang, Fanyu Que, Eytan Modiano
Constrained Markov Decision Process (CMDP) is a natural framework for reinforcement learning tasks with safety constraints, where agents learn a policy that maximizes the long-term…
Network Utility Maximization in Adversarial Environments
Qingkai Liang, Eytan Modiano
Stochastic models have been dominant in network optimization theory for over two decades, due to their analytical tractability. However, these models fail to capture non-stationary…
Delay versus Stickiness Violation Trade-offs for Load Balancing in Large-Scale Data Centers
Qingkai Liang, Sem Borst
Most load balancing techniques implemented in current data centers tend to rely on a mapping from packets to server IP addresses through a hash value calculated from the flow five-…
Coflow Scheduling in Input-Queued Switches: Optimal Delay Scaling and Algorithms
Qingkai Liang, Eytan Modiano
A coflow is a collection of parallel flows belonging to the same job. It has the all-or-nothing property: a coflow is not complete until the completion of all its constituent flows…
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…
Survivability in Time-varying Networks
Qingkai Liang, Eytan Modiano
Time-varying graphs are a useful model for networks with dynamic connectivity such as vehicular networks, yet, despite their great modeling power, many important features of time-v…