Wireless Resource Scheduling in Virtualized Radio Access Networks Using Stochastic Learning
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
How to allocate the limited wireless resource in dense radio access networks (RANs) remains challenging. By leveraging a software-defined control plane, the independent base stations (BSs) are virtualized as a centralized network controller (CNC). Such virtualization decouples the CNC from the wireless service providers (WSPs). We investigate a virtualized RAN, where the CNC auctions channels at the beginning of scheduling slots to the mobile terminals (MTs) based on bids from their subscribing WSPs. Each WSP aims at maximizing the expected long-term payoff from bidding channels to satisfy the MTs for transmitting packets. We formulate the problem as a stochastic game, where the channel auction and packet scheduling decisions of a WSP depend on the state of network and the control policies of its competitors. To approach the equilibrium solution, an abstract stochastic game is proposed with bounded regret. The decision making process of each WSP is modeled as a Markov decision process (MDP). To address the signalling overhead and computational complexity issues, we decompose the MDP into a series of single-agent MDPs with reduced state spaces, and derive an online localized algorithm to learn the state value functions. Our results show significant performance improvements in terms of per-MT average utility.
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
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
Cited by
Chen, X., Zhang, H., Wu, C., Mao, S., Ji, Y., & Bennis, M. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2876279 · Cited by 680
Self-citationAI-Assisted Network-Slicing Based Next-Generation Wireless Networks
Shen, X., Gao, J., Wu, W., Lyu, K., Li, M., Zhuang, W., Li, X., & Rao, J. (2020) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2020.2965100 · Cited by 342
Mahmood, M. R., Matin, M. A., Sarigiannidis, P., & Goudos, S. K. (2022) · IEEE Access · doi:10.1109/access.2022.3199689 · Cited by 209
“Theresource scheduling problem in dense RAN in [128] is formulated as a stochastic game.”
BackgroundGame Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends
Moura, J., & Hutchison, D. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2863030 · Cited by 193
“for modelling wireless resource scheduling in virtualized radio access networks [24].”
Background
Metadata
- Authors
- Chen, X., Han, Z., Zhang, H., Xue, G., Xiao, Y., & Bennis, M.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2018-04-01
- Volume
- 17
- Issue
- 4
- Pages
- 961-974
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2750212574
- Cited by
- 55
- References
- 1
- FWCI
- 4.25
- Type
- journal article
- Language
- en
- Open access
- closed
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.