Embedding of virtual network requests over static wireless multihop networks

Network virtualization is a technology of running multiple heterogeneous network architecture on a shared substrate network. One of the crucial components in network virtualization is virtual network embedding, which provides a way to allocate physical network resources (e.g., CPU and link bandwidth) to virtual network requests. Despite significant research efforts on virtual network embedding in wired and cellular networks, little attention has been paid to that in wireless multi-hop networks, which is becoming more important due to its rapid growth and the need to share these networks among different business sectors and users. In this paper, we first study the root causes of new challenges of virtual network embedding in wireless multi-hop networks, and propose a new embedding algorithm that efficiently uses the resources of the physical substrate network. We examine our algorithm's performance through extensive simulations under various scenarios. Due to lack of competitive algorithms, we compare the proposed algorithm to five other algorithms, mainly borrowed from wired embedding or made by us, partially with or without the key algorithmic ideas to assess their impacts.

[1]  Tim Nieberg Independent and dominating sets in wireless communication graphs , 2006 .

[2]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[3]  Heather E. Hudson,et al.  Municipal wireless broadband: Lessons from San Francisco and Silicon Valley , 2010, Telematics Informatics.

[4]  Jiaping Liu,et al.  Towards utility-optimal random access without message passing , 2010, CMC 2010.

[5]  Snjezana Gligorevic,et al.  Communication Theory Joint channel estimation and equalisation of fast time-varying frequency-selective channels , 2008, Eur. Trans. Telecommun..

[6]  Klaus Jansen,et al.  Polynomial-time approximation schemes for geometric graphs , 2001, SODA '01.

[7]  Raouf Boutaba,et al.  Virtual Network Embedding with Coordinated Node and Link Mapping , 2009, IEEE INFOCOM 2009.

[8]  Mostafa H. Ammar,et al.  Dynamic Topology Configuration in Service Overlay Networks: A Study of Reconfiguration Policies , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[10]  H. Vincent Poor,et al.  Towards utility-optimal random access without message passing , 2010, Wirel. Commun. Mob. Comput..

[11]  Jian Ni,et al.  Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[12]  Holger Karl,et al.  A virtual network mapping algorithm based on subgraph isomorphism detection , 2009, VISA '09.

[13]  Minlan Yu,et al.  Rethinking virtual network embedding: substrate support for path splitting and migration , 2008, CCRV.

[14]  Yong Zhu,et al.  Algorithms for Assigning Substrate Network Resources to Virtual Network Components , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[15]  John Musacchio,et al.  Sufficient rate constraints for QoS flows in ad-hoc networks , 2007, Ad Hoc Networks.

[16]  Devavrat Shah,et al.  Network adiabatic theorem: an efficient randomized protocol for contention resolution , 2009, SIGMETRICS '09.

[17]  Jonathan S. Turner,et al.  Efficient Mapping of Virtual Networks onto a Shared Substrate , 2006 .

[18]  Sampath Rangarajan,et al.  NVS: a virtualization substrate for WiMAX networks , 2010, MobiCom.

[19]  Lajos Hanzo,et al.  Admission control schemes for 802.11-based multi-hop mobile ad hoc networks: a survey , 2009, IEEE Communications Surveys & Tutorials.