Leveraging tenant flexibility in resource allocation for virtual networks

Virtual networks that allow tenants to explicitly specify their computing as well as networking resources are recently proposed to be better interfaces between cloud providers and tenants. Many virtual networks have time-varying resource demands, as evidenced in prior studies [1-3]. New opportunities emerge when such variation is exploited. In this paper, we design a novel resource demand model for tenants to flexibly trade off between application performance and cost, and propose a work-conserving allocation algorithm, WCA, for deploying virtual networks with time-varying resource demands. WCA places virtual nodes in a first-fit fashion, and places virtual links through path-splitting. In each physical node or link, by opportunistically sharing physical resources among multiple variable parts of resource demands, physical utilization can be improved, and more virtual networks can be deployed concurrently. Our evaluation results show that WCA achieves a 4% higher physical resource utilization and rejects 18% less virtual network requests than a state-of-the-art algorithm [4].

[1]  Lei Shi,et al.  Dcell: a scalable and fault-tolerant network structure for data centers , 2008, SIGCOMM '08.

[2]  Jie Wu,et al.  Virtual network embedding with substrate support for parallelization , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[3]  Jie Wu,et al.  Virtual Network Embedding with Opportunistic Resource Sharing , 2014, IEEE Transactions on Parallel and Distributed Systems.

[4]  Haitao Wu,et al.  BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.

[5]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[6]  Meng Wang,et al.  Consolidating virtual machines with dynamic bandwidth demand in data centers , 2011, 2011 Proceedings IEEE INFOCOM.

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

[8]  Srikanth Kandula,et al.  Reoptimizing Data Parallel Computing , 2012, NSDI.

[9]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[10]  A. Rowstron,et al.  Towards predictable datacenter networks , 2011, SIGCOMM.

[11]  Raouf Boutaba,et al.  ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping , 2012, IEEE/ACM Transactions on Networking.

[12]  김대원,et al.  Method and architecture for virtual desktop service , 2011 .

[13]  Werner Vogels,et al.  Beyond Server Consolidation , 2008, ACM Queue.

[14]  James P. Hennessy,et al.  Multiple Operating Systems on One Processor Complex , 1989, IBM Syst. J..

[15]  Helen J. Wang,et al.  SecondNet: a data center network virtualization architecture with bandwidth guarantees , 2010, CoNEXT.

[16]  David Breitgand,et al.  Improving consolidation of virtual machines with risk-aware bandwidth oversubscription in compute clouds , 2012, 2012 Proceedings IEEE INFOCOM.

[17]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[18]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[19]  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.

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

[21]  Di Xie,et al.  The only constant is change: incorporating time-varying network reservations in data centers , 2012, CCRV.

[22]  David G. Andersen,et al.  Theoretical Approaches to Node Assignment , 2002 .

[23]  Raouf Boutaba,et al.  A survey of network virtualization , 2010, Comput. Networks.

[24]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[25]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[26]  Robert Ricci,et al.  A solver for the network testbed mapping problem , 2003, CCRV.