Zuqing Zhu

Bio: Zuqing Zhu is an academic researcher from University of Science and Technology of China. The author has contributed to research in topics: Network topology & Provisioning. The author has an hindex of 44, co-authored 294 publications receiving 6492 citations. Previous affiliations of Zuqing Zhu include University of California, Davis & University of California, Berkeley.

Dynamic Service Provisioning in Elastic Optical Networks With Hybrid Single-/Multi-Path Routing

Abstract: Empowered by the optical orthogonal frequency-division multiplexing (O-OFDM) technology, flexible online service provisioning can be realized with dynamic routing, modulation, and spectrum assignment (RMSA). In this paper, we propose several online service provisioning algorithms that incorporate dynamic RMSA with a hybrid single-/multi-path routing (HSMR) scheme. We investigate two types of HSMR schemes, namely HSMR using online path computation (HSMR-OPC) and HSMR using fixed path sets (HSMR-FPS). Moreover, for HSMR-FPS, we analyze several path selection policies to optimize the design. We evaluate the proposed algorithms with numerical simulations using a Poisson traffic model and two mesh network topologies. The simulation results have demonstrated that the proposed HSMR schemes can effectively reduce the bandwidth blocking probability (BBP) of dynamic RMSA, as compared to two benchmark algorithms that use single-path routing and split spectrum. Our simulation results suggest that HSMR-OPC can achieve the lowest BBP among all HSMR schemes. This is attributed to the fact that HSMR-OPC optimizes routing paths for each request on the fly with considerations of both bandwidth utilizations and lengths of links. Our simulation results also indicate that the HSMR-FPS scheme that use the largest slots-over-square-of-hops first path-selection policy obtains the lowest BBP among all HSMR-FPS schemes. We then investigate the proposed algorithms' impacts on other network performance metrics, including network throughput and network bandwidth fragmentation ratio. To the best of our knowledge, this is the first attempt to consider dynamic RMSA based on both online path computation and offline path computation with various path selection policies for multipath provisioning in O-OFDM networks.

Highly efficient data migration and backup for big data applications in elastic optical inter-data-center networks

Abstract: This article discusses the technologies for realizing highly efficient data migration and backup for big data applications in elastic optical inter-data-center (inter-DC) networks. We first describe the impacts of big data applications on underlying network infrastructure and introduce the concept of flexible-grid elastic optical inter-DC networks. Then we model the data migration in such networks as dynamic anycast and propose several efficient algorithms. Joint resource defragmentation is also discussed to further improve network performance. For efficient data backup, we leverage a mutual backup model and investigate how to avoid the prolonged negative impacts on DCs’ normal operation by minimizing the DC backup window.

Virtual Optical Network Embedding (VONE) Over Elastic Optical Networks

Abstract: Based on the concept of infrastructure as a service, optical network virtualization can facilitate the sharing of physical infrastructure among different users and applications. In this paper, we design algorithms for both transparent and opaque virtual optical network embedding (VONE) over flexible-grid elastic optical networks. For transparent VONE, we first formulate an integer linear programming (ILP) model that leverages the all-or-nothing multi-commodity flow in graphs. Then, to consider the continuity and consecutiveness of substrate fiber links' (SFLs') optical spectra, we propose a layered-auxiliary-graph (LAG) approach that decomposes the physical infrastructure into several layered graphs according to the bandwidth requirement of a virtual optical network request. With LAG, we design two heuristic algorithms: one applies LAG to achieve integrated routing and spectrum assignment in link mapping (i.e., local resource capacity (LRC)-layered shortest-path routing LaSP), while the other realizes coordinated node and link mapping using LAG (i.e., layered local resource capacity(LaLRC)-LaSP). The simulation results from three different substrate topologies demonstrate that LaLRC-LaSP achieves better blocking performance than LRC-LaSP and an existing benchmark algorithm. For the opaque VONE, an ILP model is also formulated. We then design a LRC metric that considers the spectrum consecutiveness of SFLs. With this metric, a novel heuristic for opaque VONE, consecutiveness-aware LRC-K shortest-path-first fit (CaLRC-KSP-FF), is proposed. Simulation results show that compared with the existing algorithms, CaLRC-KSP-FF can reduce the request blocking probability significantly.

Efficient resource allocation for all-optical multicasting over spectrum-sliced elastic optical networks

Abstract: Recently, optical orthogonal frequency-division multiplexing technology has attracted intensive research interest because spectrum-sliced elastic optical networks (EONs) can be constructed based on it. In this paper, we investigate how to serve multicast requests over EONs with multicast-capable routing, modulation level, and spectrum assignment (RMSA). Both EON planning with static multicast traffic and EON provisioning with dynamic traffic are studied. For static EON planning, we formulate two integer linear programming (ILP) models, i.e., the joint ILP and the separate ILP. The joint ILP optimizes all multicast requests together, while the separate ILP optimizes one request each time in a sequential way. We also propose a highly efficient heuristic that is based on an adaptive genetic algorithm (GA) with minimum solution revisits. The simulation results indicate that the ILPs and the GA provide more efficient EON planning than the existing multicast-capable RMSA algorithms that use the shortest path tree (SPT) and the minimal spanning tree (MST). The results also show that the GA obtains more efficient EON planning results than the separate ILP with much less running time, as it can optimize all multicast requests together in a highly efficient manner. For the dynamic EON provisioning, we demonstrate that the GA is also applicable, and it achieves lower request blocking probabilities than the benchmark algorithms using SPTand MST.

On Dynamic Service Function Chain Deployment and Readjustment

Abstract: Network function virtualization (NFV) is a promising technology to decouple the network functions from dedicated hardware elements, leading to the significant cost reduction in network service provisioning. As more and more users are trying to access their services wherever and whenever, we expect the NFV-related service function chains (SFCs) to be dynamic and adaptive, i.e., they can be readjusted to adapt to the service requests’ dynamics for better user experience. In this paper, we study how to optimize SFC deployment and readjustment in the dynamic situation. Specifically, we try to jointly optimize the deployment of new users’ SFCs and the readjustment of in-service users’ SFCs while considering the trade-off between resource consumption and operational overhead. We first formulate an integer linear programming (ILP) model to solve the problem exactly. Then, to reduce the time complexity, we design a column generation (CG) model for the optimization. Simulation results show that the proposed CG-based algorithm can approximate the performance of the ILP and outperform an existing benchmark in terms of the profit from service provisioning.

Data Center Energy Consumption Modeling: A Survey

Abstract: Data centers are critical, energy-hungry infrastructures that run large-scale Internet-based services. Energy consumption models are pivotal in designing and optimizing energy-efficient operations to curb excessive energy consumption in data centers. In this paper, we survey the state-of-the-art techniques used for energy consumption modeling and prediction for data centers and their components. We conduct an in-depth study of the existing literature on data center power modeling, covering more than 200 models. We organize these models in a hierarchical structure with two main branches focusing on hardware-centric and software-centric power models. Under hardware-centric approaches we start from the digital circuit level and move on to describe higher-level energy consumption models at the hardware component level, server level, data center level, and finally systems of systems level. Under the software-centric approaches we investigate power models developed for operating systems, virtual machines and software applications. This systematic approach allows us to identify multiple issues prevalent in power modeling of different levels of data center systems, including: i) few modeling efforts targeted at power consumption of the entire data center ii) many state-of-the-art power models are based on a few CPU or server metrics, and iii) the effectiveness and accuracy of these power models remain open questions. Based on these observations, we conclude the survey by describing key challenges for future research on constructing effective and accurate data center power models.

On Global Electricity Usage of Communication Technology: Trends to 2030

Abstract: This work presents an estimation of the global electricity usage that can be ascribed to Communication Technology (CT) between 2010 and 2030. The scope is three scenarios for use and production of consumer devices, communication networks and data centers. Three different scenarios, best, expected, and worst, are set up, which include annual numbers of sold devices, data traffic and electricity intensities/efficiencies. The most significant trend, regardless of scenario, is that the proportion of use-stage electricity by consumer devices will decrease and will be transferred to the networks and data centers. Still, it seems like wireless access networks will not be the main driver for electricity use. The analysis shows that for the worst-case scenario, CT could use as much as 51% of global electricity in 2030. This will happen if not enough improvement in electricity efficiency of wireless access networks and fixed access networks/data centers is possible. However, until 2030, globally-generated renewable electricity is likely to exceed the electricity demand of all networks and data centers. Nevertheless, the present investigation suggests, for the worst-case scenario, that CT electricity usage could contribute up to 23% of the globally released greenhouse gas emissions in 2030.

6G and Beyond: The Future of Wireless Communications Systems

Abstract: 6G and beyond will fulfill the requirements of a fully connected world and provide ubiquitous wireless connectivity for all. Transformative solutions are expected to drive the surge for accommodating a rapidly growing number of intelligent devices and services. Major technological breakthroughs to achieve connectivity goals within 6G include: (i) a network operating at the THz band with much wider spectrum resources, (ii) intelligent communication environments that enable a wireless propagation environment with active signal transmission and reception, (iii) pervasive artificial intelligence, (iv) large-scale network automation, (v) an all-spectrum reconfigurable front-end for dynamic spectrum access, (vi) ambient backscatter communications for energy savings, (vii) the Internet of Space Things enabled by CubeSats and UAVs, and (viii) cell-free massive MIMO communication networks. In this roadmap paper, use cases for these enabling techniques as well as recent advancements on related topics are highlighted, and open problems with possible solutions are discussed, followed by a development timeline outlining the worldwide efforts in the realization of 6G. Going beyond 6G, promising early-stage technologies such as the Internet of NanoThings, the Internet of BioNanoThings, and quantum communications, which are expected to have a far-reaching impact on wireless communications, have also been discussed at length in this paper.

Routing and Spectrum Allocation in Elastic Optical Networks: A Tutorial

Abstract: Flexgrid technology is now considered to be a promising solution for future high-speed network design. In this context, we need a tutorial that covers the key aspects of elastic optical networks. This tutorial paper starts with a brief introduction of the elastic optical network and its unique characteristics. The paper then moves to the architecture of the elastic optical network and its operation principle. To complete the discussion of network architecture, this paper focuses on the different node architectures, and compares their performance in terms of scalability and flexibility. Thereafter, this paper reviews and classifies routing and spectrum allocation (RSA) approaches including their pros and cons. Furthermore, various aspects, namely, fragmentation, modulation, quality-of-transmission, traffic grooming, survivability, energy saving, and networking cost related to RSA, are presented. Finally, the paper explores the experimental demonstrations that have tested the functionality of the elastic optical network, and follows that with the research challenges and open issues posed by flexible networks.