Offline and online power aware resource allocation algorithms with migration and delay constraints

In order to handle advanced mobile broadband services and Internet of Things (IoT), future Internet and 5G networks are expected to leverage the use of network virtualization, be much faster, have greater capacities, provide lower latencies, and significantly be power efficient than current mobile t...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Vol. 158; pp. 17 - 34
Main Authors: Hejja, Khaled, Hesselbach, Xavier
Format: Journal Article Publication
Language:English
Published: Amsterdam Elsevier B.V 20.07.2019
Elsevier Sequoia S.A
Subjects:
5G delay
Algorithms
Broadband
Broadband communication systems
Computer simulation
Comunicacions mòbils
Comunicacions mòbils, Sistemes de
Delay
Enginyeria de la telecomunicació
Experiments
Internal migration
Internet
Internet de les coses
Internet of Things
Migration
Migrations
Mobile communication systems
Mobile computing
Networks
NFV resource allocation
Offline
Online
Power
Power consumption
Radiocomunicació i exploració electromagnètica
Resource allocation
Rule ordering
Telemàtica i xarxes d'ordinadors
Virtual networks
Virtualization
Àrees temàtiques de la UPC
5G delay
Power consumption
Migrations
Offline
NFV resource allocation
Online
Virtualization
ISSN:1389-1286, 1872-7069
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In order to handle advanced mobile broadband services and Internet of Things (IoT), future Internet and 5G networks are expected to leverage the use of network virtualization, be much faster, have greater capacities, provide lower latencies, and significantly be power efficient than current mobile technologies. Therefore, this paper proposes three power aware algorithms for offline, online, and migration applications, solving the resource allocation problem within the frameworks of network function virtualization (NFV) environments in fractions of a second. The proposed algorithms target minimizing the total costs and power consumptions in the physical network through sufficiently allocating the least physical resources to host the demands of the virtual network services, and put into saving mode all other not utilized physical components. Simulations and evaluations of the offline algorithm compared to the state-of-art resulted on lower total costs by 32%. In addition to that, the online algorithm was tested through four different experiments, and the results argued that the overall power consumption of the physical network was highly dependent on the demands’ lifetimes, and the strictness of the required end-to-end delay. Regarding migrations during online, the results concluded that the proposed algorithms would be most effective when applied for maintenance and emergency conditions.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2019.04.030