MABP: an optimal resource allocation approach in data center networks

In data center networks, resource allocation based on workload is an effective way to allocate the infrastructure resources to diverse cloud applications and satisfy the quality of service for the users, which refers to mapping a large number of workloads provided by cloud users/tenants to substrate network provided by cloud providers. Although the existing heuristic approaches are able to find a feasible solution, the quality of the solution is not guaranteed. Concerning this issue, based on the minimum mapping cost, this paper solves the resource allocation problem by modeling it as a distributed constraint optimization problem. Then an efficient approach is proposed to solve the resource allocation problem, aiming to find a feasible solution and ensuring the optimality of the solution. Finally, theoretical analysis and extensive experiments have demonstrated the effectiveness and efficiency of our proposed approach.

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

[2]  Xiang Cheng,et al.  Virtual network embedding through topology-aware node ranking , 2011, CCRV.

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

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

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

[6]  Albert G. Greenberg,et al.  Sharing the Data Center Network , 2011, NSDI.

[7]  T. S. Eugene Ng,et al.  The Impact of Virtualization on Network Performance of Amazon EC2 Data Center , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Makoto Yokoo,et al.  An approach to over-constrained distributed constraint satisfaction problems: distributed hierarchical constraint satisfaction , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

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

[10]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

[11]  Kang-Won Lee,et al.  Minimum congestion mapping in a cloud , 2011, PODC '11.

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

[13]  Simson L. Garfinkel,et al.  An Evaluation of Amazon's Grid Computing Services: EC2, S3, and SQS , 2007 .

[14]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

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

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

[17]  Djamal Zeghlache,et al.  A Distributed Virtual Network Mapping Algorithm , 2008, 2008 IEEE International Conference on Communications.