Embedding and re-embedding of virtual links in software-defined multi-radio multi-channel multi-hop wireless networks

Abstract There is rising interest in applying Software Defined Networking (SDN) principles to wireless multi-hop networks, as this paves the way towards bringing the programmability and flexibility that is lacking in today’s distributed wireless networks (ad-hoc, mesh or sensor networks) with the promising perspectives of better mitigating issues such as scalability, mobility and interference management and supporting improved controlled QoS services. This paper investigates this latter aspect and proposes an Integer Linear Programming (ILP) based wireless resource allocation scheme for the provision of point-to-point and point-to-multipoint end-to-end virtual links with bandwidth requirements in software-defined multi-radio multi-channel wireless multi-hop networks. The proposed algorithm considers the peculiarities of wireless communications: the broadcast nature of wireless links which can be leveraged for point-to-multipoint links resource allocations, and, the interference between surrounding wireless links. It also considers switching resource consumption of wireless nodes since, for the time being, the size of SDN forwarding tables remains quite limited. We also consider the case where the requirements of already embedded virtual links evolve over time and propose a re-embedding strategy that meets the new requirements while minimizing service disruption. Genetic Algorithms derived from the ILP formulations are also proposed to address the case of large wireless networks. Our simulation results show that our proposed methods work effectively compared to shortest path based heuristics.

[1]  Qing Zhu,et al.  An iterative algorithm for delay-constrained minimum-cost multicasting , 1998, TNET.

[2]  Pin Lv,et al.  Multicast Service-Oriented Virtual Network Embedding in Wireless Mesh Networks , 2012, IEEE Communications Letters.

[3]  Cunqing Hua,et al.  Intelligent Latency-Aware Virtual Network Embedding for Industrial Wireless Networks , 2019, IEEE Internet of Things Journal.

[4]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[5]  Holger Karl,et al.  Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding , 2019, 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC).

[6]  Nael B. Abu-Ghazaleh,et al.  Wireless Software Defined Networking: A Survey and Taxonomy , 2016, IEEE Communications Surveys & Tutorials.

[7]  Frédéric Cazals,et al.  A note on the problem of reporting maximal cliques , 2008, Theor. Comput. Sci..

[8]  Jie Zhu,et al.  Genetic Algorithm for Energy-Efficient QoS Multicast Routing , 2013, IEEE Communications Letters.

[9]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[10]  David Gomez-Barquero,et al.  Point-to-Multipoint Communication Enablers for the Fifth Generation of Wireless Systems , 2018, IEEE Communications Standards Magazine.

[11]  Pin Lv,et al.  Virtual access network embedding in wireless mesh networks , 2012, Ad Hoc Networks.

[12]  Mohsen Guizani,et al.  Efficient Virtual Network Embedding With Backtrack Avoidance for Dynamic Wireless Networks , 2016, IEEE Transactions on Wireless Communications.

[13]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[14]  Donggyu Yun,et al.  Embedding of virtual network requests over static wireless multihop networks , 2012, Comput. Networks.