Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 201

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Resource Allocation for Network Slicing in 5G Telecommunication Networks: A Survey of Principles and Models

Su, Ruoyu, Zhang, Dengyin, Venkatesan, R., Gong, Zijun, Li, Cheng, Ding, Fei, Jiang, Fan, Zhu, Ziyang · 2019 · IEEE Network

Abstract

With the rapid and sustained growth of network demands, 5G telecommunication networks are expected to provide flexible, scalable, and resilient communication and network services, not only for traditional network operators, but also for vertical industries, OTT, and third parties to satisfy their different requirements. Network slicing is a promising technology to establish customized end-to-end logic networks comprising dedicated and shared resources. By leveraging SDN and NFV, network slices associated with resources can be tailored to satisfy diverse QoS and SLA. Resource allocation of network slicing plays a pivotal role in load balancing, resource utilization, and networking performance. In this article, we focus on the principles and models of resource allocation algorithms in 5G network slicing. We first introduce the basic ideas of the SDN and NFV with their roles in network slicing. The MO architecture of network slicing is also studied, which provides a fundamental framework of resource allocation algorithms. Then, resource types with corresponding isolation levels in RAN slicing and CN slicing are analyzed, respectively. Furthermore, we categorize the mathematical models of resource allocation algorithms based on their objectives and elaborate them with typical examples. Finally, open research issues are identified with potential solutions.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/mnet.2019.1900024

Cites

4 of 4 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 201

Metadata

Authors
Su, R., Zhang, D., Venkatesan, R., Gong, Z., Li, C., Ding, F., Jiang, F., & Zhu, Z.
Venue
IEEE Network
Published
2019-11
Volume
33
Issue
6
Pages
172-179
ISSN
  • 0890-8044 (ISSN-L)
  • 1558-156X
OpenAlex
W2964288953
Cited by
201
References
4
FWCI
13.08
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.