Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Jian Wang 0025

dblp:39/449-25 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0001-5149-4619ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4Databases, data management, data science and information retrieval · 2Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network management and operations · 44% Transport protocols and congestion control · 44% Software-defined and programmable networks · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 61% Storage systems · 39%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
congestion control evaluation
0.912025
Marlin: Enabling High-Throughput Congestion Control Testing in Large-Scale Networks · EuroSys 2025
Network management and operations
network testing
0.912025
Marlin: Enabling High-Throughput Congestion Control Testing in Large-Scale Networks · EuroSys 2025
Cloud and datacenter computing
cloud storage
0.612022
Fog-to-MultiCloud Cooperative Ehealth Data Management With Application-Aware Secure Deduplication · IEEE Trans. Dependable Secur. Comput. 2022
Storage systems › secure storage
encrypted storage
0.612022
Fog-to-MultiCloud Cooperative Ehealth Data Management With Application-Aware Secure Deduplication · IEEE Trans. Dependable Secur. Comput. 2022
Cloud and datacenter computing › cloud storage
secure deduplication
0.612022
Fog-to-MultiCloud Cooperative Ehealth Data Management With Application-Aware Secure Deduplication · IEEE Trans. Dependable Secur. Comput. 2022
Software-defined and programmable networks › programmable data plane
programmable switch
0.312025
Marlin: Enabling High-Throughput Congestion Control Testing in Large-Scale Networks · EuroSys 2025
Medical and health informatics
electronic health records
0.212022
Fog-to-MultiCloud Cooperative Ehealth Data Management With Application-Aware Secure Deduplication · IEEE Trans. Dependable Secur. Comput. 2022
Storage systems
storage reliability
0.212022
Fog-to-MultiCloud Cooperative Ehealth Data Management With Application-Aware Secure Deduplication · IEEE Trans. Dependable Secur. Comput. 2022

Methods — techniques the papers use, named apart from their topics

erasure coding · 1.1deduplication · 1.1convergent encryption · 1.1hybrid traffic generation · 0.9FPGA NIC · 0.9
YearPublicationVenuePosition
2025 Marlin: Enabling High-Throughput Congestion Control Testing in Large-Scale Networks
abstract
Cloud providers require high-throughput traffic to test the effectiveness of congestion control (CC) configurations (i.e., CC algorithm selection and their parameter settings) in networks. A network tester capable of evaluating CC configurations needs to fulfill the following requirements: (R1) Capable of generating traffic with CC behaviors. (R2) Ability to customize CC algorithms. (R3) High throughput CC traffic generation. However, existing network testers fail to meet these requirements simultaneously. The paper presents Marlin, a novel high-throughput network tester designed for CC evaluation. Marlin leverages a high-throughput, low-programmability device to amplify the traffic generated by a low-throughput, high-programmability device. The low-throughput device is responsible for complex computational tasks, such as running CC and flow scheduling algorithms, and communicates with the high-throughput device at a high frequency using small packets to instruct it to generate high-throughput traffic with CC behaviors. This hybrid approach allows for customizable, high-throughput CC testing. Our experiments demonstrate that Marlin can accurately emulate CC behaviors and replicate real-world scenarios. Marlin can generate 1.2 Tbps of CC traffic using a single programmable switch pipeline and one 100 Gbps port of an FPGA NIC, supporting up to 65,536 concurrent flows.
Li Wang 0110, Jingzhi Wang, Songyue Liu, Keqiang He, Jian Wang 0025, Xiaoliang Wang 0001, Wan-Chun Dou, Guihai Chen, Chen Tian 0001
EuroSys6
2022 Data-Driven Multi-armed Beam Tracking for Mobile Millimeter-Wave Communication Systems
abstract
The goal of the next-generation mobile communication system is higher data-rates, lower latency, and higher energy-efficient performance, which bring about the demands for fast beam tracking in time-varying mobile communication. With the development of large-scale antenna array technology, highly directional beams can be formed with limited radio frequency chains. However, traditional exhaustive searching scheme has unacceptable overhead that leads to great challenges for applying to mobile millimeter-wave environments. Fast beam tracking scheme therefore has been recognized as a key technology in millimeter wave communication. To address this issue, this paper proposes a data-driven multi-armed beam tracking scheme to select the beamforming/combining vectors that achieve the target quality of service based on the real-time measurement, rather than the prior knowledge such as channel and user mobility information in beamforming design. To further speed up the beam tracking process, multi-armed beam is created to sample multiple spatial directions simultaneously. Simulation results show that the proposed data-driven multi-armed beam tracking method could achieve fast beam tracking performance with high resolution and reduced training overhead.
Shengdong Zhang, Xingjian Zhang 0001, Jian Wang 0025
VTC Fall4
2022 Fog-to-MultiCloud Cooperative Ehealth Data Management With Application-Aware Secure Deduplication
abstract
The healthcare industry faces challenges regarding the security and efficiency of data management for patient health records (PHRs). We propose SafePHR: a secure and efficient medical data service with application aware deduplication in fog-to-multicloud encrypted storage. It introduces a fog-to-multicloud cooperative storage model, which combines low-latency and high-safety local fog with unlimited capacity and built-in disaster recovery in remote multi-cloud to enhance eHealth data management. It also provides an application aware secure deduplication scheme to improve the data traffic and space efficiency of cloud storage for encrypted PHRs using variants of convergent encryption. Then, it further enhances the resiliency and security of cloud storage by striping encrypted data across multiple cloud vendors with a fault-tolerant coding scheme. Compared with the state-of-the-art of cloud-assisted eHealth systems, our experiments demonstrate that SafePHR can ensure data confidentiality of deduplication, achieve a competitive low cloud storage space overhead, and improve system performance with high fault-tolerance capability.
Yinjin Fu, Nong Xiao 0001, Tao Chen 0005, Jian Wang 0025
IEEE Trans. Dependable Secur. Comput.4
2020 Dynamic Routing in Flying Ad-hoc Networks using Link Duration Based MPR Selection
abstract
Mobile Ad hoc Networks (MANETs) is a decentralized network where mobile nodes in the network communicate with each other over wireless links without any infrastructure or central controller. With the latest development of unmanned aerial vehicles (UAVs), the development of network technology for multi-cooperative UAVs has become crucial. Routing in a Flying Ad hoc Networks (FANETs) is a challenging problem. However, traditional MANET routing protocols often only consider the current connection state when establishing a route and selecting the next hop. In high mobility FANETs, these methods are possible not optimal or even wrong. Meanwhile, FANET has certain advantages. For example, most UAVs are equipped with Global Position System (GPS) or similar devices that can provide their own spatial location information. Routing decisions can be optimized and adjusted with this available information. In this paper, based on the Optimized Link State Routing (OLSR) protocol, we propose a Link Duration OLSR (LD-OLSR) protocol. The proposed protocol uses the situation information of the nodes in three dimensions to predict the duration of the link to optimize the establishment of the backbone network. The simulation results show that the algorithm effectively improves the packet delivery rate and reduces the delay of packets.
Yirui Huang, Ruiming Xie, Jian Wang 0025
VTC Fall4
2020 Resource Allocation With Edge Computing in IoT Networks via Machine Learning
abstract
In this article, we investigate resource allocation with edge computing in Internet-of-Things (IoT) networks via machine learning approaches. Edge computing is playing a promising role in IoT networks by providing computing capabilities close to users. However, the massive number of users in IoT networks requires sufficient spectrum resource to transmit their computation tasks to an edge server, while the IoT users were developed to have more powerful computation ability recently, which makes it possible for them to execute some tasks locally. Then, the design of computation task offloading policies for such IoT edge computing systems remains challenging. In this article, centralized user clustering is explored to group the IoT users into different clusters according to users' priorities. The cluster with the highest priority is assigned to offload computation tasks and executed at the edge server, while the lowest priority cluster executes computation tasks locally. For the other clusters, the design of distributed task offloading policies for the IoT users is modeled by a Markov decision process, where each IoT user is considered as an agent which makes a series of decisions on task offloading by minimizing the system cost based on the environment dynamics. To deal with the curse of high dimensionality, we use a deep Q-network to learn the optimal policy in which deep neural network is used to approximate the Q-function in Q-learning. Simulations show that users are grouped into clusters with optimal number of clusters. Moreover, our proposed computation offloading algorithm outperforms the other baseline schemes under the same system costs.
Xiaolan Liu 0001, Jiadong Yu, Jian Wang 0025, Yue Gao 0001
IEEE Internet Things J.3
2019 F2MC: Enhancing Data Storage Services with Fog-toMultiCloud Hybrid Computing
abstract
Public cloud storage can provide customers with unlimited capacity and built-in disaster recovery by exploiting IT resources in data center but suffers high latency and security risk. The emergency of fog computing can mitigate data security risk by leveraging local private server with low latency. We introduce F2MC: a Fog-to-MultiCloud hybrid storage service that combines local fog computing with remote cloud computing to enhance the quality of service (QoS) of data management. It provides an application aware data reduction scheme to improve the data traffic and space efficiency of cloud storage by exploiting deduplication and compression. Then, it further enhances the resiliency and security of cloud storage by striping encrypted data across multiple cloud vendors with a secure fault-tolerant coding. Compared with the state-of-the-art of multicloud storage systems, our experiments demonstrate that F2MC can achieve the highest performance with the same fault-tolerance capability, and a competitive low cloud cost due to its low cloud storage space overheads.
Yinjin Fu, Xiaofeng Qiu, Jian Wang 0025
IPCCC3
2019 Spectrum pricing for cognitive radio networks with user's stochastic distribution
Li Wang 0041, Kwok-Yan Lam, Mudi Xiong, Feng Li 0008, Xin Liu 0009, Jian Wang 0025
Wirel. Networks6
2019 Licklider Transmission Protocol for GEO-Relayed Space Internetworking
Guannan Yang, Kanglian Zhao, Jian Wang 0025, Wenfeng Li 0003, Zijing Cheng
Wirel. Networks5
2016 A Real-Time User Mobility Pattern Modeling and Similarity Measurement for Mobile Social Networks
abstract
The increasingly extensive availability of location- acquisition technologies (such as GPS and GSM networks) and mobile computing techniques have generated a lot of spatial-temporal trajectory data which represents the mobility of diversification of moving objects such as people, vehicles, and animals. This brings new opportunities to understand the movement behaviors of moving objects in mobile social networks, which can become valuable for location-based services (LBS). However, the explosive growth of users' trajectory data has brought a lot of troubles to online real-time processing. In this paper, we focus on this direction and develop a complete data-driven framework involving real-time user mobility pattern modeling and a novel user similarity measurement based on both spatial and temporal information. Through experimental evaluation, it is verified that the proposed mobility pattern modeling method and similarity measurement can deliver excellent performance.
Jian Wang 0025, Naitong Zhang, Wenfeng Li 0003, Kanglian Zhao
VTC Spring2
2015 Mining Uncertain Sequential Patterns in Iterative MapReduce
Jiaqi Ge, Yuni Xia, Jian Wang 0025
PAKDD (2)3
2015 Towards Efficient Sequential Pattern Mining in Temporal Uncertain Databases
Jiaqi Ge, Yuni Xia, Jian Wang 0025
PAKDD (2)3