A Dynamic Embedding Algorithm for Wireless Network Virtualization

TL;DR

This paper introduces a dynamic greedy embedding algorithm for wireless network virtualization that adapts to changing traffic patterns, improving resource utilization and reducing rejection rates compared to static methods.

Contribution

The paper presents a novel dynamic greedy embedding algorithm specifically designed for wireless virtualization, capable of re-embedding virtual networks in real-time to enhance performance.

Findings

Dynamic algorithms outperform static embedding in resource utilization.

Re-embedding reduces virtual network rejection rates.

Formulation of embedding with multiple priority levels.

Abstract

Wireless network virtualization enables multiple virtual wireless networks to coexist on shared physical infrastructure. However, one of the main challenges is the problem of assigning the physical resources to virtual networks in an efficient manner. Although some work has been done on solving the embedding problem for wireless networks, few solutions are applicable to dynamic networks with changing traffic patterns. In this paper we propose a dynamic greedy embedding algorithm for wireless virtualization. Virtual networks can be re-embedded dynamically using this algorithm, enabling increased resource usage and lower rejection rates. We compare the dynamic greedy algorithm to a static embedding algorithm and also to its dynamic version. We show that the dynamic algorithms provide increased performance to previous methods using simulated traffic. In addition we formulate the embedding problem with multiple priority levels for the static and dynamic case.