Chengzong Peng

Chengdu University of Information Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Xiaojun Cao

University of Science and Technology of China

Danyang Zheng

Southwest Jiaotong University

Ling Tian

University of Electronic Science and Technology of China

Guangchun Luo

University of Electronic Science and Technology of China

Yimin Zhou

Harbin Institute of Technology

Xueting Liao

Georgia State University

Ben Wang

Collaborative Innovation Center of Advanced Microstructures

Siqi Yang

Jiangsu Province Hospital

Yihan Zhong

Georgia State University

Yao Meng

University of Electronic Science and Technology of China

Cooperative Institutions

University of Electronic Science and Technology of China

Chinese Academy of Sciences

Chengdu University of Information Technology

Georgia State University

Nanjing University

Institute of Electronics

Soochow University

University of Chinese Academy of Sciences

National University of Singapore

Tsinghua University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Toward Optimal Hybrid Service Function Chain Embedding in Multiaccess Edge Computing

IEEE Internet of Things Journal (2019)

Danyang Zheng Chengzong Peng Xueting Liao Xiaojun Cao

The emerging multiaccess edge computing (MEC) architecture brings the needed computing resource to the network edge. Many 5G and Internet of Things (IoT) applications are latency sensitive and computation intensive in MEC systems. To flexibly provide and manage the network service requests in MEC systems, network function virtualization (NFV) can be employed to create a chain of service functions (SFs), namely, SF chain (SFC). Through SFC, the customer forwards user data to the edge server/cloud, and the edge server/cloud may return the processed results/models to the customer. When the forward and backward traffic is carrying different content, different SFs may be required for the forward and backward traffic, which requires a hybrid SFC (h-SFC). In this article, we study how to minimize the latency cost when embedding an h-SFC in MEC systems. We define a new problem called minimum latency hybrid SFC embedding (ML-HSFCE) and propose an algorithm, namely, optimal hybrid SFC embedding (Opt-HSFCE) to optimally embed a given h-SFC in MEC systems. Our extensive simulations and analysis show that the proposed Opt-HSFCE needs much less runtime compared with the brutal force algorithm and significantly outperforms the schemes that are directly extended from the existing techniques.

Mobile Edge Computing

10.1109/jiot.2019.2957961

Cite

Citations (40)

Macroscale intrinsic dynamics are associated with microcircuit function in focal and generalized epilepsies

Communications Biology (2024)

Siqi Yang Yimin Zhou Chengzong Peng Yao Meng Huafu Chen

Abstract Epilepsies are a group of neurological disorders characterized by abnormal spontaneous brain activity, involving multiscale changes in brain functional organizations. However, it is not clear to what extent the epilepsy-related perturbations of spontaneous brain activity affect macroscale intrinsic dynamics and microcircuit organizations, that supports their pathological relevance. We collect a sample of patients with temporal lobe epilepsy (TLE) and genetic generalized epilepsy with tonic-clonic seizure (GTCS), as well as healthy controls. We extract massive temporal features of fMRI BOLD time-series to characterize macroscale intrinsic dynamics, and simulate microcircuit neuronal dynamics used a large-scale biological model. Here we show whether macroscale intrinsic dynamics and microcircuit dysfunction are differed in epilepsies, and how these changes are linked. Differences in macroscale gradient of time-series features are prominent in the primary network and default mode network in TLE and GTCS. Biophysical simulations indicate reduced recurrent connection within somatomotor microcircuits in both subtypes, and even more reduced in GTCS. We further demonstrate strong spatial correlations between differences in the gradient of macroscale intrinsic dynamics and microcircuit dysfunction in epilepsies. These results emphasize the impact of abnormal neuronal activity on primary network and high-order networks, suggesting a systematic abnormality of brain hierarchical organization.

Abnormality

Dynamics

10.1038/s42003-024-05819-0

Cite

Citations (1)

A Cross-Chain Mechanism for Agricultural Engineering Document Management Blockchain in the Context of Big Data

Big Data Research (2024)

Lei Shi Yimin Zhou Wei Wang Juan Wang Yang Bai

Traceability

Smart contract

10.1016/j.bdr.2024.100459

Cite

Citations (2)

Minimum Cost Hybrid Node Protection in NFV

2021 7th International Conference on Computer and Communications (ICCC) (2021)

Chengzong Peng Danyang Zheng Xiaojun Cao

In network function virtualization (NFV), the customer's service requests are delivered by going through a set of deployed service functions (SFs). To accommodate customer's requests, service providers have to install the required SFs onto a physical network (PN) and route the traffic through the installed SFs to form a traffic forwarding path called the service function path (SFP). Any failures of physical nodes or SF instances can significantly impact the service delivery. In the literature, existing work has focused on how to protect the PN from physical node failures. Few research attention has been paid to efficiently protecting the network while jointly taking physical and virtual node failures into consideration. In this work, we investigate a novel minimum cost hybrid node protection (MC-HOP) problem, which is proved to be an NP-hard problem. We propose an efficient algorithm called minimum cost pairwise node assistance (NOTION) to optimize the MC-HOP problem with latency requirements. Extensive simulations and analysis show that the proposed scheme significantly outperforms the algorithms that are directly extended from the existing work.

Virtual network

Network service

Network Functions Virtualization

10.1109/iccc54389.2021.9674656

Cite

Citations (3)

Latency-Bounded Off-Site Virtual Node Protection in NFV

IEEE Transactions on Network and Service Management (2021)

Chengzong Peng Danyang Zheng Sumesh J. Philip Xiaojun Cao

In network function virtualization (NFV), the client's service requests will go through multiple service functions (SFs). The instances of the required SFs will be hosted on the geographically-distributed physical nodes in physical networks (PNs). The failure of any physical nodes or virtual nodes (i.e., SF instances) will impact the delivery of services and the client's experience. It is essential for service providers to take the node failure and network reliability into account. Different from physical node failures that will affect the PN's topology and connectivity, virtual node failures impact the services delivery of certain clients. As a result, applying traditional backup schemes that are designed for physical node failures may not efficiently provide protection for virtual node failures. In this work, we define and mathematically formulate a new latency-bounded off-site virtual node protection (LOVNP) problem in NFV. After proving the NP-hardness of the LOVNP problem, we introduce a novel shared protection technique called pairwise node protection to effectively facilitate the protection of node failures in NFV. Then, we propose an efficient heuristic algorithm called protection centrality based pairwise node protection (PC-PNP) to optimize the LOVNP problem and prove that PC-PNP has a logarithm-approximation boundary. Our extensive simulations and analysis show that the proposed algorithm significantly outperforms the algorithms that are extended from the existing work.

Network Virtualization

Virtual network

10.1109/tnsm.2021.3096477

Cite

Citations (16)

Hybrid Service Chain Deployment in Networks with Unique Function

Danyang Zheng Chengzong Peng Evrim Güler Guangchun Luo Ling Tian

In Network Function Virtualization (NFV), Service Function Chain (SFC) is composed of Virtual Network Function (VNF) nodes that are chained via VNF links. SFCs can be specified as unidirectional or bidirectional. A unidirectional SFC (u-SFC) demands the traffic being forwarded via the VNFs in one direction, while a bidirectional SFC (b-SFC) requires bidirectional traffic flows. In this paper, for the first time, we investigate the problem of how to efficiently deploy a hybrid SFC (h-SFC), whereas some VNF nodes are required to process bidirectional traffic while others only handle unidirectional traffic. We define a new problem called hybrid SFC Deployment (h-SFCD). When each substrate node provides one unique VNF, we prove the NP-hardness of the h-SFCD problem and propose an approximate algorithm, namely, 2-approximation Hybrid Service function chain Deployment in Unique function networks (2-HSD-U). Our experimental results show that the proposed 2-HSD-U algorithm significantly outperforms the heuristic algorithm based on the traditional Nearest-Neighbor technique.

Virtual network

10.1109/icc.2019.8761210

Cite

Citations (15)

A cost-provable solution for reliable in-network computing-enabled services deployment

Computer Networks (2024)

Xiaorong Liu Danyang Zheng Huanlai Xing Li Feng Chengzong Peng

10.1016/j.comnet.2024.110997

Cite

Citations (0)

Parallelism-aware Service Function Chaining and Embedding for 5G Networks

Danyang Zheng Chengzong Peng Xueting Liao Xiaojun Cao

The ultra-fast speed and massive capacity in 5G networks push huge amounts of data to networks. With network function virtualization, these data will go through multiple service functions (SFs) and big data processing/analysis. As a result, the processing delay from such SFs and data processing/analysis can significantly impact the delivery of latency-sensitive services. To reduce the processing delay, network function parallelism techniques are introduced to allow multiple SFs running parallelly for the same request. In this work, we study how to apply network function parallelism into SF chaining and embedding to optimize the latency. When physical nodes have unlimited computing resource, we propose the mixed integer programming based parallelism-aware SFC optimization (MIP-PS) algorithm. Our analysis proves the proposed MIP-PS is integer-approximation. When physical nodes have limited computing resource, we propose the latency factor based parallelism-aware SFC optimization (LF-PS) algorithm. Our extensive simulations demonstrate that our proposed schemes outperform the approaches extended directly from the existing work.

Chaining

10.1109/icccn52240.2021.9522271

Cite

Citations (4)

Off-site protection against service function forwarder failures in NFV

Computer Networks (2022)

Chengzong Peng Danyang Zheng Yihan Zhong Xiaojun Cao

10.1016/j.comnet.2022.109510

Cite

Citations (6)

Video big data in smart city: Background construction and optimization for surveillance video processing

Future Generation Computer Systems (2018)

Ling Tian Hongyu Wang Yimin Zhou Chengzong Peng

Transforming infrastructures, buildings and services with the sensed data from the Internet of Things (IoT) technique has drawn wide attention. Enormous video data from city surveillance cameras poses huge challenges of transmission, storage and analysis, which necessitates new video compression technologies. The fusion of video data generated from smart city could be used to support city management and urban policy. Based on the specific characteristics of surveillance video, which are successive pictures have very strong correlations and each picture can be divided into background and foreground, this work proposes a block-level background modeling (BBM) algorithm to support long-term reference structure for efficient surveillance video coding. A rate–distortion optimization for surveillance source (SRDO) algorithm is also developed to improve the coding performance. Experimental results show that the proposed BBM and SRDO can significantly improve the compression performance, which can effectively support diverse video applications in smart city.

Smart City

Rate–distortion optimization

10.1016/j.future.2017.12.065

Cite

Citations (61)