Ziyu Shao

Ziyu Shao
ShanghaiTech University · School of Information Science and Technology

PhD

About

74
Publications
4,456
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
772
Citations
Citations since 2016
56 Research Items
587 Citations
2016201720182019202020212022020406080100120140
2016201720182019202020212022020406080100120140
2016201720182019202020212022020406080100120140
2016201720182019202020212022020406080100120140
Additional affiliations
December 2012 - December 2013
The Chinese University of Hong Kong
Position
  • PostDoc Position

Publications

Publications (74)
Article
In satellite-terrestrial integrated networks, it is a common practice to schedule real-time tasks from low Earth orbit (LEO) satellites to ground stations (GSs) for data processing. However, the joint task scheduling and resource allocation under unknown environment dynamics (e.g., transmission latency) remains to be a challenging problem. First, t...
Article
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. However, the design of online energy-efficient scheme is still an open problem because of various uncertainties in system dynamics such as processing capacities and transmissio...
Article
For NFV systems, the key design space includes the function chaining for network requests and the resource scheduling for servers. The problem is challenging since NFV systems usually require multiple (often conflicting) design objectives and the computational efficiency of real-time decision making with limited information. Furthermore, the benefi...
Article
In fog-assisted Internet-of-Things systems, it is a common practice to cache popular content at the network edge to achieve high quality of service. Due to uncertainties, in practice, such as unknown file popularities, the cache placement scheme design is still an open problem with unresolved challenges: 1) how to maintain time-averaged storage cos...
Article
In fog computing systems, each fog node often maintains multiple interfaces to achieve simultaneous communications with end devices. To maximize the utilization of network capacities and avoid interference, a critical mission for each fog node is to allocate distinct channels to its interfaces, also known as multi-interface channel allocation , t...
Article
For systems that are based on network function virtualization (NFV), it remains a key challenge to conduct effective service chain composition with the lowest request latency and the minimum network congestion. In such an NFV system, users are usually non-cooperative, i.e., they compete with each other to optimize their own benefits. However, exi...
Article
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 plane. However, in such systems the decision-making for joint switch-controller association and control devolution often involves various uncertainties, e.g., the tempor...
Article
For wireless caching networks, the scheme design for content delivery is non-trivial in the face of the following tradeoff. On one hand, to optimize overall throughput, users can associate their nearby APs with great channel capacities; however, this may lead to unstable queue backlogs on APs and prolong request delays. On the other hand, to ensure...
Article
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 Heron, often adopt naive scheduling schemes to distribute data streams (in the units of tuples) among processing instances, which may result in workload imbalance and sys...
Article
For software-defined networking (SDN) systems, to enhance the scalability and reliability of control plane, existing solutions adopt either multi-controller design with static switch-controller association, or static control devolution by delegating certain request processing back to switches. Such solutions can fall short in face of temporal varia...
Preprint
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. However, the design of online energy-efficient scheme is still an open problem because of various uncertainties in system dynamics such as processing capacities and transmissio...
Preprint
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) with ultra-low request latencies and minimum network congestion. To this end, existing solutions often require full knowledge of the network state, while ignoring the priv...
Preprint
In Fog-assisted IoT systems, it is a common practice to cache popular content at the network edge to achieve high quality of service. Due to uncertainties in practice such as unknown file popularities, cache placement scheme design is still an open problem with unresolved challenges: 1) how to maintain time-averaged storage costs under budgets, 2)...
Preprint
In multi-tiered fog computing systems, to accelerate the processing of computation-intensive tasks for real-time IoT applications, resource-limited IoT devices can offload part of their workloads to nearby fog nodes, %with greater computation capacities, whereafter such workloads may be offloaded to upper-tier fog nodes with greater computation cap...
Preprint
In fog computing systems, one key challenge is online task scheduling, i.e., to decide the resource allocation for tasks that are continuously generated from end devices. The design is challenging because of various uncertainties manifested in fog computing systems; e.g., tasks' resource demands remain unknown before their actual arrivals. Recent w...
Preprint
For software-defined networking (SDN) systems, to enhance the scalability and reliability of control plane, existing solutions adopt either multi-controller design with static switch-controller associations, or static control devolution by delegating certain request processing back to switches. Such solutions can fall short in face of temporal vari...
Preprint
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 with streams flowing through pipelined instances of various processing units. One key challenge that emerges is instance placement, i.e., to decide the placement of insta...
Preprint
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 Heron, often adopt naive scheduling schemes to distribute data streams (in the units of tuples) among processing instances, which may result in workload imbalance and sys...
Preprint
For wireless caching networks, the scheme design for content delivery is non-trivial in the face of the following tradeoff. On one hand, to optimize overall throughput, users can associate their nearby APs with great channel capacities; however, this may lead to unstable queue backlogs on APs and prolong request delays. On the other hand, to ensure...
Preprint
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 require multiple (often conflicting) design objectives and the computational efficiency of real-time decision making with limited information. Furthermore, the benefits o...
Preprint
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 plane. However, in such systems, the decision-making for joint switch-controller association and control devolution often involves various uncertainties, e.g., the tempo...
Article
Fog computing (FC) has the potential to process computation-intensive tasks in Industrial Internet of Things (IIoT) systems. In parallel with the development of FC, non-orthogonal multiple access (NOMA) has been recognized as a promising technique to significantly improve the spectrum efficiency. In this paper, a NOMA-based FC framework for IIoT sy...
Article
Fog computing has been promoted to support delay-sensitive applications in future Internet of Things (IoT). For a general heterogeneous fog network consisting of many dispersive Fog Nodes (FNs), it may well happen that some of them have delay-sensitive tasks to process, i.e., Task Nodes (TNs), and some have spare resources to help the TNs to proces...
Chapter
This chapter presents a predictive scheduling model and develops the predictive multi‐tier operations scheduling (PMOS) algorithm, where the fog control node is assumed to be aware of users' future request information within a limited future time window. In addition, it addresses a cost model and the resulting cost‐minimization user‐scheduling prob...
Article
Full-text available
In this letter, a linear precoding scheme is proposed for downlink (DL) multi-user (MU) generalized spatial modulation (GSM) systems. The proposed precoding scheme achieves, not only inter-user interference (IUI) free, but also maximum signal-to-noise ratio (SNR). The former achievement leads to higher multiplexing gain, while the later results in...
Article
In multi-tiered fog computing systems, to accelerate the processing of computation-intensive tasks for real-time IoT applications, resource-limited IoT devices can offload part of their workloads to nearby fog nodes, whereafter such workloads may be offloaded to upper-tier fog nodes with greater computation capacities. Such hierarchical offloading,...
Article
Fog computing has the potential to liberate the computation-intensive mobile devices by task offloading. In this paper, we propose an online learning based task offloading algorithm for delay-sensitive applications in dynamic fog networks, which combines with the Combinatorial Multi-Armed Bandits (CMAB) framework. First, the proposed algorithm lear...
Conference Paper
In software-defined networking (SDN) systems, the scalability and reliability of the control plane still remain as major concerns. Existing solutions adopt either multi-controller designs or control devolution back to the data plane. The former requires a flexible yet efficient switch-controller association mechanism to adapt to workload changes an...
Article
Fog computing has recently emerged as a promising technique in content delivery wireless networks to alleviate the heavy bursty traffic burdens on backhaul connections. In order to improve the overall system performance, in terms of network throughput, service delay and fairness, it is very crucial and challenging to jointly optimize node assignmen...
Article
Full-text available
In software-defined networking (SDN), as data plane scale expands, scalability and reliability of the control plane has become major concerns. To mitigate such concerns, two kinds of solutions have been proposed separately. One is multi-controller architecture, i.e., a logically centralized control plane with physically distributed controllers. The...
Article
Wireless interference management through continuous power control has been extensively studied in the literature. However, practical systems often adopt discrete power control with a limited number of power levels and MCSs (Modulation Coding Schemes). In general, discrete power control is NP-hard due to its combinatorial nature. To tackle this chal...
Article
Wireless interference management through continuous power control has been extensively studied in the literature. However, practical systems often adopt discrete power control with a limited number of power levels and MCSs (Modulation Coding Schemes). In general, discrete power control is NP-hard due to its combinatorial nature. To tackle this chal...
Conference Paper
Network coding has been applied widely in wireless networks. In this paper, we focus on the cross-layer optimization of wireless networks with multiple unicast sessions and network coding. By exploiting broadcast advantage and one hop opportunistic listening, we develop a fully distributed solution including primal-dual flow control, Markov chain b...
Conference Paper
Today's data centers are shared among multiple tenants running a wide range of applications. These applications require a network with a scalable and robust layer-2 network management solution that enables load-balancing and QoS provisioning. Ensemble routing was proposed to achieve management scalability and robustness by using Virtual Local Area...
Conference Paper
We present a general framework for a distributed VoD content distribution problem by formulating an optimization problem yielding a highly distributed implementation that is highly scalable and resilient to changes in demand. Our solution takes into account several individual node resource constraints including disk space, network link bandwidth, a...
Article
Full-text available
In this paper we understand BitTorrent protocol from a Markov approximation perspective. We show that together with the underlying rate control algorithm, the rarest first algorithm and choking algorithm in BitTorrent protocol implicitly solve a cooperative combinatorial network utility maximization problem in a distributed manner. This understandi...
Article
Full-text available
Existing work on cross-layer optimization for wireless networks adopts simple physical-layer models, i.e., treating interference as noise. In this paper, we adopt a deterministic channel model proposed in [11, 12], a simple abstraction of the physical layer that effectively captures the effect of channel strength, broadcast and superposition in wir...
Conference Paper
Full-text available
Many network design cases with network coding can be formulated as combinatorial optimization problems, which are NP-hard and hard to approximate even in a centralized manner. In this paper, guided by Markov approximation framework, we provide a unified distributed solution for one important sub-category of combinatorial network coding problems: co...
Article
Peer-to-peer (P2P) systems have provided a scalable and cost effective way for file sharing and multimedia streaming in the past decade. The implementation of P2P systems usually involves two transmission schemes: routing (store-and-forward), and network coding. In this paper, we make a theoretical investigation of the rate that can be achieved by...
Article
Full-text available
Network coding is a new paradigm in data transport that combines coding with data propagation over a network. Theory of linear network coding (LNC) adopts a linear coding scheme at every node of the network and promises the optimal data transmission rate from the source to all receivers. Linearity enhances the theoretic elegance and engineering sim...
Conference Paper
We study the problem of neighbor selection in BitTorrent-like peer-to-peer (P2P) systems, and propose a "soft-worst-neighbor-choking" algorithm that is provably optimal. In practical P2P systems, peers often keep a large set of potential neighbors, but only simultaneously upload/download to/from a small subset of them, which we call active neighbor...
Article
Full-text available
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under \emph{node degree bounds}, i.e., the number of neighbors a node can simultaneously connect to is upper-bounded. The problem is critical for supporting high-quality video streaming in P2P systems, and is challenging due to its combinatorial nature. In this pape...
Conference Paper
Full-text available
Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distributed algorithms. The Markov approximation framework studied in this paper is a general technique for synthesizing distributed algorithms. We show that when using the log-sum-...
Conference Paper
Full-text available
Existing work on cross-layer optimization for wireless networks adopts simple physical-layer models, i.e., treating interference as noise. In this paper, we adopt a deterministic channel model proposed in, a simple abstraction of the physical layer that effectively captures the effect of channel strength, broadcast and superposition in wireless cha...
Conference Paper
Network coding (NC) is a new paradigm in data transport and promises to change many aspects of networking. Starting with an introduction to basic NC concepts and results, this paper reviews the state of the art on a number of topics and points out promising research directions.
Article
Full-text available
Node-capacitated networks are networks in which the capacity constraint is put on every node. They have recently attract attention as a good model for peer-to-peer (P2P) overlay networks. Existing work gives results on networks with constraints of node upload capacities. In this paper, we consider networks with constraints on both node upload and n...
Article
How to compute the blocking probability of optical networks quickly and exactly is an open problem. Thus many exact and approximate methods are proposed to tackle this problem. In this paper, we introduce the factor graph model approach . The relationship between network topology and corresponding factor graph representation is also discussed. Simu...
Conference Paper
Future operators of core networks will use Optical Burst Switching (OBS). Therefore it is necessary to evaluate TCP congestion inside the optical core network. In this paper, we investigate the performance of TCP variants over TSL-OBS network. Simulation results show that TCP variants such as XCP and HS-TCP have a better performance than standard T...

Network

Cited By

Projects

Project (1)
Project
An Optimize Distributed Video-On-Demand Streaming System: Theory and Design