Wenting Wei

Prof. Dr. Wenting Wei

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 August 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Wenting WeiWenting Wei
Wenting Wei
RYRuying Yang
Ruying Yang
HGHuaxi Gu
Huaxi Gu
WZWeike Zhao
Weike Zhao
Chen ChenChen Chen
Chen Chen
Shaohua WanShaohua Wan
Shaohua Wan
Modern transportation is associated with considerable challenges related to safety, mobility, the environment and space limitations. Vehicular networks are widely considered to be a promising approach for improving satisfaction and convenience in transportation. However, with the exploding popularity among vehicle users and the growing diverse demands of different services, ensuring the efficient use of resources and meeting the emerging needs remain challenging. In this paper, we focus on resource allocation in vehicular cloud computing (VCC) and fill the gaps in the previous research by optimizing resource allocation from both the provider's and users' perspectives. We model this problem as a multi-objective optimization with constraints that aims to maximize the acceptance rate and minimize the provider's cloud cost. To solve such an NP-hard problem, we improve the nondominated sorting genetic algorithm II (NSGA-II) by modifying the initial population according to the matching factor, dynamic crossover probability and mutation probability to promote excellent individuals and increase population diversity. The simulation results show that our proposed method achieves enhanced performance compared to the previous methods.

28 August 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Wenting WeiWenting Wei
Wenting Wei
HGHuaxi Gu
Huaxi Gu
KWKun Wang
Kun Wang
XYXiaoshan Yu
Xiaoshan Yu
XLXuanzhang Liu
Xuanzhang Liu
With the boom of Internet of Things (IoT), an increasing amount of data from IoT applications is moved to geo-distributed data centers (DCs) for data analysis. Massive compute-demanding applications call for a more flexible and efficient resource allocation for uncertain and heterogeneous traffic in geo-distributed multi-DC systems. Virtual network embedding, a major part of network virtualization, facilitates to provide different kinds of businesses or services by resource sharing. Moreover, due to their elasticity, elastic optical networks (EONs) are viewed as a very promising solution to support inter-DC networks. This paper focuses on the effectiveness and spectrum fragmentation problem for virtual optical network embedding (VONE) in elastic optical inter-DC networks by employing multi-dimensional resources and a topological attribute. In the node mapping, betweenness of a physical node is considered together with multi-dimensional resource carrying capacity to identify proper matching. Specifically, to reduce the influence of a spectrum fragment, the available spectrum continuity degree is coupled with the computing capacity of a physical node as the multi-dimensional resource carrying capacity. In the link mapping, a tightest-matching factor is employed for the selection of paths to accommodate virtual links. Compared with baseline algorithms except for the integer linear programming (ILP) solution, analytical and numerous experiments show that our solution reduces the blocking probability by 30% on average, balances the load by 15% on average and improves spectral efficiency significantly. Moreover, our proposal has a slightly lower spectral efficiency but a better blocking performance and a much better link load balance than the ILP formulation.

11 October 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
Wenting WeiWenting Wei
Wenting Wei
HGHuaxi Gu
Huaxi Gu
KWKun Wang
Kun Wang
JLJianjia Li
Jianjia Li
XZXuan Zhang
Xuan Zhang
NWNing Wang
Ning Wang
With the development of edge-cloud computing technologies, distributed data centers (DCs) have been extensively deployed across the global Internet. Since different users/applications have heterogeneous requirements on specific types of ICT resources in distributed DCs, how to optimize such heterogeneous resources under dynamic and even uncertain environments becomes a challenging issue. Traditional approaches are not able to provide effective solutions for multi-dimensional resource allocation that involves the balanced utilization across different resource types in distributed DC environments. This paper presents a reinforcement learning based approach for multi-dimensional resource allocation (termed as NESRL-MRM) that is able to achieve balanced utilization and availability of resources in dynamic environments. To train NESRL-MRM’s agent with sufficiently quick wall-clock time but without the loss of exploration diversity in the search space, a natural evolution strategy (NES) is employed to approximate the gradient of the reward function. To realistically evaluate the performance of NESRL-MRM, our simulation evaluations are based on real-world workload traces from Amazon EC2 and Google datacenters. Our results show that NESRL-MRM is able to achieve significant improvement over the existing approaches in balancing the utilization of multi-dimensional DC resources, which leads to substantially reduced blocking probability of future incoming workload demands.

16 July 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
Wenting WeiWenting Wei
Wenting Wei
LFLiying Fu
Liying Fu
HGHuaxi Gu
Huaxi Gu
XLXueyu Lu
Xueyu Lu
LLLei Liu
Lei Liu
Mohsen GuizaniMohsen Guizani
Mohsen Guizani
Satellite networks have long been regarded as a vital component of space communication systems, which provide integrated satellite-terrestrial broadband access in seamless coverage and cost-effective manner. The inter-satellite routing design for low earth orbit (LEO) satellite constellations is critical for achieving low-latency and high-reliability communication in the space communication systems. However, the inherent dynamic nature of LEO satellites, coupled with the variability in inter-satellite connectivity, imposes significant challenges for routing efficiency and network dependability. Existing routing schemes cannot handle such topological fluctuations due to their insensitivity to real-time network changes, thus suffering from performance degradations in highly dynamic space environments. This paper presents Iris , an intelligent reliable routing scheme for inter-satellite communication, aiming at increasing efficiency and reliability of the packet transmission process. Specifically, we propose a comprehensive deep reinforcement learning (DRL) framework that learns a policy to select routing paths automatically under the emerging software-defined satellite networking (SDSN) architecture. To strengthen fault-tolerance in fluctuating environments, we train an agent in an incremental manner by gradually increasing scenario complexity. Simulation results indicate that our solution significantly outperforms baselines and exhibits advances in adaptability and reliability, especially under dynamic environments with frequent topology changes.

30 January 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
Wenting WeiWenting Wei
Wenting Wei
LFLiying Fu
Liying Fu
HGHuaxi Gu
Huaxi Gu
YZYan Zhang
Yan Zhang
TZTao Zou
Tao Zou
NWNing Wang
Ning Wang
Forwarding path selection for data traffic is one of the most fundamental operations in computer networks, whose performance drastically impacts both transmission efficiency and reliability in network domains. Although deep reinforcement learning (DRL) has attracted considerable attention for path selection instead of hand-tuned heuristics, few works have considered how to exploit graph-structured information in networks to improve routing and forwarding efficiency. In fact, generating routes is essentially a process for finding a subgraph in a graph-structured network. To this end, this paper proposes an effective and novel graph embedding-based DRL framework for adaptive path selection (termed GRL-PS), aiming at reducing end-to-end (E2E) latency and promoting network throughput while maintaining stability in dynamically changing environments. Specifically, graph representation learning (GRL) is deployed as an effective enabler for the DRL agent to learn the relational knowledge of interacting entities for route decisions in networks. However, training such an agent in a dynamically changing environment encounters a knowledge acquisition bottleneck, since the DRL agent is always forced to learn every task from scratch. To improve the adaptation of behaviors and acquire skills beyond what the source policy can teach, we introduce potential-based reward shaping as a means of knowledge transfer to guide the agent in unfamiliar conditions with sparse rewards. Experimental results show that compared with baseline methods, our solution can achieve nearly-optimal performance with both latency and throughput, especially in large-scale dynamic networks.

1 April 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
Wenting WeiWenting Wei
Wenting Wei
QWQingyi Wang
Qingyi Wang
HGHuaxi Gu
Huaxi Gu
Danyang ZhengDanyang Zheng
Danyang Zheng
NZNing Zhang
Ning Zhang
Celimuge WuCelimuge Wu
Celimuge Wu
Network function virtualization (NFV) facilitates different virtual network functions (VNF) to be dynamically chained in sequence to offer new services in a flexible, scalable, and cost-effective manner. Recent years have witnessed the increasing diverse service demands from the ever-increasing new applications, which has posed significant challenges to the efficient and sequential execution of VNFs to achieve specific objectives, especially under conditions of shared resources. To address these challenges, substantial efforts have been dedicated to enhancing resource utilization and minimizing the costs associated with service function chains (SFCs), while maintaining high quality of service. However, an overemphasis on cost reduction can sometimes result in network congestion, which ultimately degrades both network performance and service quality. Given the time-varying and unpredictable characteristics of SFCs, it is essential to leverage their temporal features, along with those of network states, for adaptive SFC mapping. In this paper, we introduce an adaptive online SFC mapping algorithm to reduce operational costs and alleviate network congestion. This is achieved through the adaptive allocation of VNFs and the control of traffic routing between them. Our approach incorporates multi-task deep reinforcement learning to manage the coexistence of multiple SFC requests with varying resource requirements. Specifically, we integrate a long short-term memory (LSTM) layer into our model to capture the temporal dynamics of network states and resource demands, thereby enabling more effective long-term planning. To address the issue of reward sparsity, we implement a hierarchical reward mechanism and reward shaping techniques. Experimental results demonstrate that our algorithm achieves near-optimal performance in optimizing service delay, bandwidth consumption, and network congestion, while also ensuring a high acceptance rate for user requests.