Karnaugh-map like online embedding algorithm of wireless virtualization

Wireless virtualization enables multiple concurrent wireless networks running on a shared wireless substrate to support different services (e.g. multimedia, VoIP). A fundamental challenge in wireless virtualization is how to efficiently assign wireless resource to virtual networks (VNs), i.e. embedding problem. However, so far there are few research results related to the embedding problems of wireless virtualization. This paper focuses on two important goals: (1) the embedding algorithm should handle online virtual network requests; (2) an efficient embedding algorithm is needed. Inspired from karnaugh-map, we present a karnaugh-map-like online embedding algorithm of wireless virtualization, which includes: online scheduling method and karnaugh-map-like embedding algorithm. Evaluation results show that our algorithm has better performance. To the best of authors´ knowledge, it is not only the first detailed algorithm on embedding problem of wireless virtualization, but also the first algorithm handling the online requests of wireless virtualization.