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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xiaocan Wu

dblp:188/7856 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
5since 2021 · last 2025
0000-0002-3771-2779ORCID · corroborated

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

Computer networks · 5 · 2 first-author · 3 since 2021Theory of computation · 2Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 1 first-author · 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
2 papers
Network measurement and analytics · 81% Software-defined and programmable networks · 19%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics › traffic measurement
heavy flow detection
0.912025
FEA-Sketch: flow entries assisted sketch for heavy flow detection in software-defined networking · Sci. China Inf. Sci. 2025
Software-defined and programmable networks
SDN measurement
0.912025
FEA-Sketch: flow entries assisted sketch for heavy flow detection in software-defined networking · Sci. China Inf. Sci. 2025
Network measurement and analytics › traffic measurement › flow measurement
flow size estimation
0.712023
Self-Adaptive Sampling Based Per-Flow Traffic Measurement · IEEE/ACM Trans. Netw. 2023
Network measurement and analytics
per-flow measurement
0.712023
Self-Adaptive Sampling Based Per-Flow Traffic Measurement · IEEE/ACM Trans. Netw. 2023
Network measurement and analytics
sampling
0.712023
Self-Adaptive Sampling Based Per-Flow Traffic Measurement · IEEE/ACM Trans. Netw. 2023
Network measurement and analytics
traffic measurement
0.712023
Self-Adaptive Sampling Based Per-Flow Traffic Measurement · IEEE/ACM Trans. Netw. 2023
Network measurement and analytics
sketch-based measurement
0.312025
FEA-Sketch: flow entries assisted sketch for heavy flow detection in software-defined networking · Sci. China Inf. Sci. 2025

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

sketch · 1.5flow entry assistance · 0.9compression functions · 0.7
YearPublicationVenuePosition
2025 FEA-Sketch: flow entries assisted sketch for heavy flow detection in software-defined networking
Xiaocan Wu, He Huang 0001, Yang Du 0006, Yu-e Sun
Sci. China Inf. Sci.1
2023 Coupon Filter: A Universal and Lightweight Filter Framework for More Accurate Data Stream Processing
Xiaocan Wu, He Huang 0001, Yang Du 0006, Yu-e Sun, Shigang Chen
Comput. Networks1
2023 Self-Adaptive Sampling Based Per-Flow Traffic Measurement
abstract
Per-flow traffic measurement in the high-speed network plays an important role in many practical applications. Due to the limited on-chip memory and the mismatch between off-chip memory speed and line rate, sampling-based methods select and forward a part of flow traffic to off-chip memory, which complements sketch-based solutions in estimation accuracy and online query support. However, most current work uses the same sampling probability for all flows, leading to the waste in storage and communication resources. In practice, different flows often require different sampling rates to meet the same accuracy constraint. This paper presents self-adaptive sampling, a framework to sample each flow with a probability adapted to flow size/spread. Then we propose three algorithms, SAS-LC, SAS-LOG, and SAS-HYB. SAS-LC and SAS-LOG are geared towards per-flow spread estimation and per-flow size estimation by using different compression functions. SAS-HYB combines the advantages of SAS-LC and SAS-LOG, showing higher efficiency when both small flows and large flows are interested. We implement our estimators in hardware using NetFPGA. Experimental results based on real Internet traces show that, compared to the state-of-the-art in per-flow spread estimation, SAS-LC can save around 10% on-chip space and reduce up to 40% communication cost for large flows. In per-flow size estimation, SAS-LOG can save 40% on-chip space and reduce up to 96% communication costs for large flows. Moreover, SAS-HYB’s on-chip memory usage will not be larger than SAS-LC or SAS-LOG and can save up to 19% on-chip space than SAS-LOG when both small flows and large flows are interested.
Yang Du 0006, He Huang 0001, Yu-e Sun, Shigang Chen, Guoju Gao, Xiaocan Wu
IEEE/ACM Trans. Netw.6
2022 An Anti-Malicious Task Allocation Mechanism in Crowdsensing Systems
Xiaocan Wu, Yu-e Sun, Yang Du 0006, Guoju Gao, He Huang 0001, Xiaoshuang Xing
Future Gener. Comput. Syst.1
2021 A novel spread estimation based abnormal flow detection in high-speed networks
Xiaofei Bu, Yu-e Sun, Yang Du 0006, Xiaocan Wu, He Huang 0001
Peer-to-Peer Netw. Appl.4
2020 An Efficient Malicious User Detection Mechanism for Crowdsensing System
Xiaocan Wu, Yu-e Sun, Yang Du 0006, Xiaoshuang Xing, Guoju Gao, He Huang 0001
WASA (1)1
2020 Quality-aware online task assignment mechanisms using latent topic model
Yang Du 0006, Yu-e Sun, He Huang 0001, Liusheng Huang, Hongli Xu 0001, Xiaocan Wu
Theor. Comput. Sci.6
2019 CPDM: An Efficient Crowdsensing-Based Pothole Detection and Measurement System Design
abstract
Real-time road condition monitoring, especially of severe road damage, is critical for driving safety. In this work, we propose a crowdsensing-based pothole detection and measurement system, called CPDM, which can accurately measure the depth and length of detected potholes in urban roads. CPDM learns road surface information by collecting the sensor data from the smartphones belonging to the passing drivers and passengers. The proposed system can detect potholes by observing the vibration signal when the vehicle passes over the pothole, learn the vehicle parameters by fitting the underdamping vibration signal with stochastic gradient descent, and estimate the depth and length of the pothole. We have implemented a prototype system to prove the efficiency and adaptability of the proposed CPDM. The experimental results based on real traces show that CPDM has a high detection accuracy at different vehicle speeds.
Xiaocan Wu, Yu-e Sun, He Huang 0001, Yang Du 0006
ICTAI2
2018 Quality-Aware Online Task Assignment Using Latent Topic Model
Yang Du 0006, Yu-e Sun, He Huang 0001, Liusheng Huang, Hongli Xu 0001, Xiaocan Wu
AAIM6
2018 How Do Metro Station Crowd Flows Influence the Taxi Demand Based on Deep Spatial-Temporal Network?
abstract
Forecasting taxi demand is of great significance to the intelligent transportation systems in a smart city. Traditional demand prediction methods mostly considered about inter-regional traffic, events, activities, and weather, while they overlooked the influence of other travel modes, such as metro. In this paper, we propose a Deep Taxi-Metro Spatial-Temporal Network framework, namely TMST-Net, to model the spatiotemporal relationships between the taxi demand and the metro crowd flows. In detail, we apply residual neural networks to model temporal (current, day, and week) properties of the taxi demand in each area. For each feature, we apply residual convolutional units to handle the spatial properties of taxi demand. Likewise, we apply the same method to model the metro crowd flows. TMST-Net learns to assign different weights between taxi and metro by aggregating the output of the three residual neural networks and the external factors to forecast the final taxi demand for each area in the next timestamp. Experimental results on real taxi trajectory and the automatic fare collection (AFC) data in Shanghai show that our approach outperforms the state-of-the-art methods.
Yu-e Sun, Xiaofei Bu, Yang Du 0006, Xiaocan Wu, He Huang 0001, Yonglong Luo, Liusheng Huang
MSN5
2017 An Efficient Allocation Mechanism for Crowdsourcing Tasks with Minimum Execution Time
Xiaocan Wu, Danlei Huang, Yu-e Sun, Xiaofei Bu, He Huang 0001
ICIC (3)1