Fuliang Li

Fuliang Li

Auto-generated profile, based on publicly available information

Fuliang Li

Northeastern University

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

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

Representative Publications

View All Publications
9 January 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
WWWenliang Wu
Wenliang Wu
YWYu Wang
Yu Wang
XWXingwei Wang
Xingwei Wang
WXWeiqiang Xu
Weiqiang Xu
FLFuliang Li
Fuliang Li
LMLianbo Ma
Lianbo Ma
Traditional routing algorithms cannot dynamically change network environments due to the limited information for routing decisions. Meanwhile, they are prone to performance bottlenecks in the face of increasingly complex business requirements. Some approaches, such as deep reinforcement learning (DRL) have been proposed to address the routing problems. However, they hardly utilize the information about the network environment fully. The Knowledge Defined Networking (KDN) architecture inspires us to develop new learning mechanisms adapted to the dynamic characteristics of the network topology. In this paper, we propose an effective scheme to solve the routing optimization problem by adding a graph neural network (GNN) structure to DRL, called Message Passing Deep Reinforcement Learning (MPDRL). MPDRL uses the characteristics of GNN to interact with the network topology environment and extracts exploitable knowledge through the message passing process of information between links in the topology. The goal is to achieve the load balance of network traffic and improve network performance. We have conducted experiments on three Internet Service Provider (ISP) network topologies. The evaluation results show that MPDRL obtains better network performance than the baseline algorithms.

20 February 2024 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
PWPengfei Wang
Pengfei Wang
WSWei Song
Wei Song
HQHeng Qi
Heng Qi
CZChangjun Zhou
Changjun Zhou
FLFuliang Li
Fuliang Li
QZQiang Zhang
Qiang Zhang
Federated unlearning (FUL) is an emerging distributed machine learning paradigm which enables the removal or unlearning of specific training data effects from trained Federated Learning (FL) models. While current studies mostly focus on client-side FUL to address the “right to be forgotten”, and ignore the server's right to remove local models from the global model, particularly when clients are trained with low-quality data. In this paper, we introduce the Server-Initiated Federated Unlearning (SIFU) algorithm, devised to eliminate low-quality data from the global model. SIFU consists of two main components: (i) Identifying low-quality data: we develop a category-based method for quantifying low-quality data for each client and filter out clients containing such data. Datasets are then divided accordingly. (ii) Unlearning low-quality data: we employ gradient ascent training to counteract the adverse effects of low-quality data on local models. To minimize any bias introduced, we concurrently perform several batches of boosting training with good-quality data. SIFU could identify and promptly eliminate the impact of low-quality data on the FL global model while still preserving the benefits of good-quality data. Finally, extensive evaluations are conducted to verify the performance of SIFU with four different kinds of datasets and models. Results show that, compared to retraining from scratch, SIFU accelerates the speed of unlearning by 15× for small datasets (i.e., MNIST and FMNIST) and 20× for large datasets (i.e., CIFAR-10 and CelebA) without any degradation in accuracy, which also outperforms the state of the arts.

8 January 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
FLFuliang Li
Fuliang Li
ZGZhenbei Guo
Zhenbei Guo
CZChangsheng Zhang
Changsheng Zhang
WLWeichao Li
Weichao Li
YWYi Wang
Yi Wang
Existing trust mechanisms in vehicular ad hoc networks (VANETs) suffer from a variety of vulnerabilities, such as trust inconsistency in different regions and fake trust values generated by a set of cooperating malicious nodes. In this paper, we propose a novel local trust management mechanism, ATM, to solve these problems. ATM employs active detection and blockchain techniques. Specifically, the active detection effectively filters the surrounding malicious nodes and prevents their active cooperation, while the blockchain ensures the consistency of trust data across different regions. We conduct numerical analysis to evaluate the performance of ATM. Our experiment results show that ATM performs the best among the three trust mechanisms under test. It can effectively identify malicious behaviors in terms of 95% detection accuracy and 90% deliver ratio, respectively.

27 December 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
CZChuangchuang Zhang
Chuangchuang Zhang
WWWenliang Wu
Wenliang Wu
FLFuliang Li
Fuliang Li
KYKeping Yu
Keping Yu
As an emerging architecture, edge computing enables resource limited terminal devices to offload their computation tasks to edge servers in the vicinity, to efficiently reduce delay and energy consumption. However, the continuous expansion of network scale and rapid growth of network traffic in recent years have brought huge challenges to task offloading and resource allocation. To tackle the challenges, by integrating Knowledge Defined Networking (KDN) and edge computing technologies, we design a novel Knowledge defined Edge Computing (KEC) architecture, to achieve intelligent resource allocation and task offloading in dynamic large-scale edge computing networks. We formulate the task offloading and resource allocation optimization problem, to minimize delay and energy consumption, by considering resource requirements and controller deployment. To solve it, we present an intelligent Resource Allocation based Task Offloading (TORA) mechanism, where a Multi-Agent SD3 based resource allocation (MASD3) algorithm is devised to perform efficient resource allocation. To adapt to the rapid expansion of network scale, we design a resource Allocation based Controller Deployment and task offloading Decision (DACD) algorithm, to perform the optimal controller deployment and task offloading. Extensive simulation experiments demonstrate the effectiveness and efficiency of our proposed solution, and TORA mechanism outperforms comparison mechanisms on delay and energy consumption.

31 July 2019 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Jiarong YaoJiarong Yao
Jiarong Yao
FLFuliang Li
Fuliang Li
Keshuang TangKeshuang Tang
Keshuang Tang
JSJian Sun
Jian Sun
The cycle-based volume is critical for traffic state estimation and signal control optimization at signalized intersections. Traditional volume estimation mainly depends on fixed detectors represented by loop detectors, but limited spatial coverage and detection failure are also prominent. With the development of vehicle positioning, smartphone-based navigation, and connected-vehicle technologies, massive high-resolution trajectory data have recently become available, which can provide rich and timely information on the traffic arrival and departure processes at signalized intersections. Hence, the studies utilizing trajectory data for estimating the queue length and traffic volume at intersections has received increasing attention in the past few years. However, the most existing studies have demanded a comparatively high penetration rate and adopted site-specific assumptions for unsteady arrival patterns. In contrast, this paper solely used trajectory data for cycle-based flow estimation through a generic hybrid method that combined a probabilistic model and shockwave theory to maximize the utilization of limited captured trajectories, especially under a low penetration rate. In this method, within each cycle, the volume of stopped vehicles is estimated based on the shockwave theory, while the volume of non-stopped vehicles is modeled as a parameter estimation problem of a time-dependent constrained Poisson distribution, where the time headway correspondingly obeys an M3 distribution. The cycle-based volume is solved by a maximum likelihood estimation using an expectation-maximization procedure. An empirical case study was conducted with various signal timing schemes and the results showed satisfactory robustness with an accuracy of more than 90% under a penetration rate of 7.6%.

22 September 2017 in IEEE Access
Verified
Journal Article
Open access
FLFuliang Li
Fuliang Li
JCJiannong Cao
Jiannong Cao
XWXingwei Wang
Xingwei Wang
YSYinchu Sun
Yinchu Sun
Due to the centralized control, network-wide monitoring and flow-level scheduling of software-defined-networking (SDN), it can be utilized to achieve quality of service (QoS) for cloud applications and services, such as voice over IP, video conference, and online games. However, most existing approaches stay at the QoS framework design and test level, while few works focus on studying the basic QoS techniques supported by SDN. In this paper, we enable SDN with QoS guaranteed abilities, which could provide end-to-end QoS routing for each cloud user service. First of all, we implement an application identification technique on SDN controller to determine required QoS levels for each application type. Then, we implement a queue scheduling technique on SDN switch. It queues the application flows into different queues and schedules the flows out of the queues with different priorities. At last, we evaluate the effectiveness of the proposed SDN-based QoS technique through both theoretical and experimental analysis. Theoretical analysis shows that our methods can provide differentiated services for the application flows mapped to different QoS levels. Experiment results show that when the output interface has sufficiently available bandwidth, the delay can be reduced by 28% on average. In addition, for the application flow with the highest priority, our methods can reduce 99.99% delay and increase 90.17% throughput on average when the output interface utilization approaches to the maximum bandwidth limitation.