Wireless Traffic Prediction With Scalable Gaussian Process: Framework, Algorithms, and Verification
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
The cloud radio access network (C-RAN) is a promising paradigm to meet the stringent requirements of the fifth generation (5G) wireless systems. Meanwhile, the wireless traffic prediction is a key enabler for C-RANs to improve both the spectrum efficiency and energy efficiency through load-aware network managements. This paper proposes a scalable Gaussian process (GP) framework as a promising solution to achieve large-scale wireless traffic prediction in a cost-efficient manner. Our contribution is three-fold. First, to the best of our knowledge, this paper is the first to empower GP regression with the alternating direction method of multipliers (ADMM) for parallel hyper-parameter optimization in the training phase, where such a scalable training framework well balances the local estimation in baseband units (BBUs) and information consensus among BBUs in a principled way for large-scale executions. Second, in the prediction phase, we fuse local predictions obtained from the BBUs via a cross-validation-based optimal strategy, which demonstrates itself to be reliable and robust for general regression tasks. Moreover, such a cross-validation-based optimal fusion strategy is built upon a well acknowledged probabilistic model to retain the valuable closed-form GP inference properties. Third, we propose a C-RAN-based scalable wireless prediction architecture, where the prediction accuracy and the time consumption can be balanced by tuning the number of the BBUs according to the real-time system demands. The experimental results show that our proposed scalable GP model can outperform the state-of-the-art approaches considerably, in terms of wireless traffic prediction performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Chen, M., Mozaffari, M., Saad, W., Yin, C., Debbah, M., & Hong, C. S. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2680898 · Cited by 742 · cited 1×
“Third, the centralized C-RAN architecture can also better support cooperative managements [19], such that the wireless traffic prediction result can directly guide the load-aware network management to improve both the spectrum efficiency and energy efficiency of wireless networks, which contributes a candidate solutio…”
BackgroundPeng, M., Sun, Y., Li, X., Mao, Z., & Wang, C. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2548658 · Cited by 386
Generalized Product of Experts for Automatic and Principled Fusion of Gaussian Process Predictions
Cao, Y., & Fleet, D. J. (2014) · arXiv · doi:10.48550/arxiv.1410.7827 · Cited by 116 · cited 6×
“weights directly in [18] and [33], we propose to optimize the weights via cross-validation, which could provide a reliable fusion quality with concrete theoretical analysis.”
BackgroundMethodInfluentialOn asymptotic properties of hyperparameter estimators for kernel-based regularization methods
Mu, B., Chen, T., & Ljung, L. (2018) · Automatica · doi:10.1016/j.automatica.2018.04.035 · Cited by 80
Metadata
- Authors
- Xu, Y., Yin, F., Xu, W., Lin, J., & Cui, S.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2019-06
- Volume
- 37
- Issue
- 6
- Pages
- 1291-1306
- ISSN
- 0733-8716 (ISSN-L)
- 1558-0008
- OpenAlex
- W2912371381
- Cited by
- 185
- References
- 5
- FWCI
- 13.36
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.