Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1804.08922 (cs)
[Submitted on 24 Apr 2018]

Title:Throughput and Energy-Efficient Network Slicing

Authors:Bho Matthiesen, Osman Aydin, Eduard A. Jorswieck
View PDF
Abstract:Network slicing allows 5G network operators to provide service to multiple tenants with diverging service requirements. This paper considers network slicing aware optimal resource allocation in terms of throughput and energy efficiency. We define a heterogeneous Quality of Service (QoS) framework for a sliced radio access network network with per-slice zero-forcing beamforming and jointly optimize power and bandwidth allocation across slices and users. The Pareto boundary of this multi-objective optimization problem is obtained by two different algorithms based on the utility profile and scalarization approaches combined with generalized fractional programming. Numerical results show the merits of jointly allocating bandwidth and transmission power and how throughput and global energy efficiency are influenced by slice specific QoS requirements.
Comments: Presented at International ITG Workshop on Smart Antennas (WSA) Bochum, Germany
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1804.08922 [cs.IT]
  (or arXiv:1804.08922v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1804.08922
Journal reference: Proceedings of WSA 2018; 22nd International ITG Workshop on Smart Antennas

Submission history

From: Bho Matthiesen [view email]
[v1] Tue, 24 Apr 2018 09:34:10 UTC (327 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2018-04
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Bho Matthiesen
Osman Aydin
Eduard A. Jorswieck
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)