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

Zixuan Cui

dblp:310/2177 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2024
0009-0001-2899-4225ORCID · corroborated

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

Computer networks · 2 · 2 since 2021Systems, 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
1 paper
Network measurement and analytics · 56% Internet architecture and protocols · 44%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › quality of service
qos prediction
0.812024
QM-RGNN: An Efficient Online QoS Measurement Framework with Sparse Matrix Imputation for Distributed Edge Clouds · INFOCOM 2024
Network measurement and analytics › network performance measurement
quality of service measurement
0.812024
QM-RGNN: An Efficient Online QoS Measurement Framework with Sparse Matrix Imputation for Distributed Edge Clouds · INFOCOM 2024

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

residual learning · 0.8online learning · 0.8graph neural network · 0.8graph convolutional network · 0.8
YearPublicationVenuePosition
2024 QM-RGNN: An Efficient Online QoS Measurement Framework with Sparse Matrix Imputation for Distributed Edge Clouds
abstract
Measurements for the quality of end-to-end network services (QoS) are crucial to ensure stability, reliability, and user experience for distributed edge clouds. Measuring all QoS data brings significant costs. Existing QoS measurement methods attempt to use sparse measured QoS data to estimate unmeasured QoS data. But they suffer from limited estimation accuracy when facing QoS data with high sparsity or significant volatility. Moreover, they also consume high sampling and training costs during continuously online measurements. Our preliminary analysis reveals that end-to-end QoS is strongly temporal-spatial related. It inspires us to leverage partially measured QoS data to impute temporal-spatial-related unmeasured QoS data for reducing measurement costs. To predict unmeasured QoS data precisely with low computational costs, we propose a novel QoS Measurement framework based on Residual Graph Neural Network (QM-RGNN), which inputs QoS data as a graph and outputs the prediction of unmeasured QoS data. It consists of three core components: 1) an encoder-decoder model QM-GNN with GCN as the encoder and MLP as the decoder is devised for efficient QoS prediction, and a residual module is introduced in QM-GNN to tackle highly sparse and volatile QoS data; 2) a dynamic adaptive sample ratio is proposed to reduce the sampling costs; 3) an online learning pattern is designed to reduce continuous training costs. Experiments on two real-world industrial edge cloud datasets demonstrate the superiority of QM-RGNN in QoS measurement. It obtains at least a 37.5% reduction of relative RMSE between ground-truth and predicted QoS data with up to 90% training cost reduction and 22.7% sampling cost reduction.
Heng Zhang 0032, Zixuan Cui, Shaoyuan Huang, Deke Guo, Xiaofei Wang 0001
INFOCOM2
2024 QDPformer: Quantum-Driven Workload Prediction Model Based on Transformer
Zixuan Cui, Shaoyuan Huang, Cheng Zhang 0007, Xiaofei Wang 0001, Chao Qiu, Dusit Niyato
NPC (1)1
2024 Local search resource allocation algorithm for space-based backbone network in Deep Reinforcement Learning method
Peiying Zhang 0001, Zixuan Cui, Neeraj Kumar 0001, Jian Wang 0010, Wei Zhang 0049, Lizhuang Tan
Ad Hoc Networks2
2023 An Overview Of Low Earth Orbit Satellite Routing Algorithms
abstract
The use of satellite technology for communication and data transmission has greatly increased in recent years, and low earth orbit (LEO) satellites have become an important part of this infrastructure. LEO satellites orbit the earth at an altitude of around 500 to 2,000 kilometers, which allows them to provide coverage to a larger area compared to higher altitude satellites. However, routing data through LEO satellites presents unique challenges due to their low altitude and the need to continuously adjust their communication links as they move. To address these challenges, various routing algorithms have been developed to optimize the transmission of data through LEO satellite networks. In this review, we will examine the different types of LEO satellite routing algorithms and their key features, as well as the challenges and opportunities they present. We will also discuss the performance and trade-offs of these algorithms and their potential applications in various scenarios.
Zixuan Cui, Yi Zhang 0134, Zilong Yu, Peiying Zhang 0001
IWCMC3