liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Virtual Network Functions Scheduling under Delay-Weighted Pricing
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-4416-7702
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
2019 (English)In: IEEE Networking Letters, E-ISSN 2576-3156, p. 1-1Article in journal (Refereed) Epub ahead of print
Abstract [en]

We consider a cost minimization problem for High Volume Servers (HVS) equipped with Virtual Machines (VMs) to serve Virtual Network Functions (VNF) demands for resources. Given a scheduling period, a central scheduler decides which VM to use for each VNF demand. Each VM can be activated or disabled with different costs. Each VNF has a delay-weighted pricing function to indicate its completion time tolerance. We prove the NP-completeness of the problem and develop an algorithm based on Lagrangian relaxation and subgradient optimization to deal with this computational complexity. Finally, our numerical results demonstrate our algorithm’s effectiveness compared to two benchmarks.

Place, publisher, year, edition, pages
2019. p. 1-1
Keywords [en]
Optimization, Linear programming, Resource management, Pricing, Network function virtualization, Complexity theory, Servers
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:liu:diva-161731DOI: 10.1109/LNET.2019.2937237OAI: oai:DiVA.org:liu-161731DiVA, id: diva2:1368683
Available from: 2019-11-08 Created: 2019-11-08 Last updated: 2019-11-08Bibliographically approved
In thesis
1. Cooperation and Resource Allocation in Wireless Networking towards the IoT
Open this publication in new window or tab >>Cooperation and Resource Allocation in Wireless Networking towards the IoT
2019 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The Internet of Things (IoT) should be able to react with minimal human intervention and contribute to the Artificial Intelligence (AI) era requiring real-time and scalable operation under heterogeneous network infrastructures. This thesis investigates how cooperation and allocation of resources can contribute to the evolution of future wireless networks supporting the IoT.

First, we examine how to allocate resources to IoT services which run on devices equipped with multiple network interfaces. The resources are heterogeneous and not interchangeable, and their allocation to a service can be split among different interfaces. We formulate an optimization model for this allocation problem, prove its complexity, and derive two heuristic algorithms to approximate the solution in large instances of the problem.

The concept of virtualization is promising towards addressing the heterogeneity of IoT resources by providing an abstraction layer between software and hardware. Network function virtualization (NFV) decouples traditional network operations such a routing from proprietary hardware platforms and implements them as software entities known as virtualized network functions (VNFs). In the second paper, we study how VNF demands can be allocated to Virtual Machines (VMs) by considering the completion-time tolerance of the VNFs. We prove that the problem is NP-complete and devise a subgradient optimization algorithm to provide near-optimal solutions. Our numerical results demonstrate the effectiveness of our algorithm compared to two benchmark algorithms.

Furthermore, we explore the potential of using intermediate nodes, the so-called relays, in IoT networks. In the third paper, we study a multi-user random-access network with a relay node assisting users in transmitting their packets to a destination node. We provide analytical expressions for the performance of the relay's queue and the system throughput. We optimize the relay’s operation parameters to maximize the network-wide throughput while maintaining the relay's queue stability. A stable queue at relay guarantees finite delay for the packets. Furthermore, we study the effect of the wireless links' signal-to-interference-plusnoise ratio (SINR) threshold and the self-interference (SI) cancellation on the per-user and network-wide throughput.

Additionally, caching at the network edge has recently emerged as an encouraging solution to offload cellular traffic and improve several performance metrics of the network such as throughput, delay and energy efficiency. In the fourth paper, we study a wireless network that serves two types of traffic: cacheable and non-cacheable traffic. In the considered system, a wireless user with cache storage requests cacheable content from a data center connected with a wireless base station. The user can be assisted by a pair of wireless helpers that exchange non-cacheable content as well. We devise the system throughput and the delay experienced by the user and provide numerical results that demonstrate how they are affected by the non-cacheable packet arrivals, the availability of caching helpers, the parameters of the caches, and the request rate of the user.

Finally, in the last paper, we consider a time-slotted wireless system that serves both cacheable and non-cacheable traffic with the assistance of a relay node. The latter has storage capabilities to serve both types of traffic. We investigate how allocating the storage capacity to cacheable and non-cacheable traffic affects the system throughput. Our numerical results provide useful insights into the system throughput e.g., that it is not necessarily beneficial to increase the storage capacity for the non-cacheable traffic to realize better throughput at the non-cacheable destination node.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2019. p. 42
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 2016
National Category
Communication Systems
Identifiers
urn:nbn:se:liu:diva-161732 (URN)10.3384/diss.diva-161732 (DOI)9789175190044 (ISBN)
Public defence
2019-12-03, K3, Kåkenhus, Campus Norrköping, Norrköping, 13:15 (English)
Opponent
Supervisors
Available from: 2019-11-08 Created: 2019-11-08 Last updated: 2019-11-08Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Avgouleas, IoannisYuan, DiPappas, NikolaosAngelakis, Vangelis

Search in DiVA

By author/editor
Avgouleas, IoannisYuan, DiPappas, NikolaosAngelakis, Vangelis
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 9 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf