most citedMIPS: Instance Placement for Stream Processing Systems based on Monte Carlo Tree Search

1 citations · 2 across the 7 of their papers we have counts for

collaborators

7 papers

cs.NI2020

Online VNF Chaining and Predictive Scheduling: Optimality and Trade-offs

Xi Huang, Simeng Bian, Xin Gao +4

For NFV systems, the key design space includes the function chaining for network requests and resource scheduling for servers. The problem is challenging since NFV systems usually…

cs.NI2020

Joint Switch-Controller Association and Control Devolution for SDN Systems: An Integration of Online Control and Online Learning

Xi Huang, Yinxu Tang, Ziyu Shao +2

In software-defined networking (SDN) systems, it is a common practice to adopt a multi-controller design and control devolution techniques to improve the performance of the control…

cs.NI2020

Service Chain Composition with Failures in NFV Systems: A Game-Theoretic Perspective

Simeng Bian, Xi Huang, Ziyu Shao +2

For state-of-the-art network function virtualization (NFV) systems, it remains a key challenge to conduct effective service chain composition for different network services (NSs) w…

cs.NI2020

Green Offloading in Fog-Assisted IoT Systems: An Online Perspective Integrating Learning and Control

Xin Gao, Xi Huang, Ziyu Shao +1

In fog-assisted IoT systems, it is a common practice to offload tasks from IoT devices to their nearby fog nodes to reduce task processing latencies and energy consumptions. Howeve…

cs.NI20201 cited

POTUS: Predictive Online Tuple Scheduling for Data Stream Processing Systems

Xi Huang, Ziyu Shao, Yang Yang

Most online service providers deploy their own data stream processing systems in the cloud to conduct large-scale and real-time data analytics. However, such systems, e.g., Apache…

cs.NI20201 cited

MIPS: Instance Placement for Stream Processing Systems based on Monte Carlo Tree Search

Xi Huang, Ziyu Shao, Yang Yang

Stream processing engines enable modern systems to conduct large-scale analytics over unbounded data streams in real time. They often view an application as a direct acyclic graph…