MABP: an optimal resource allocation approach in data center networks
- 85 Downloads
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.
Keywordsdata center network resource allocation workload substrate network optimality distributed constraint optimization
Unable to display preview. Download preview PDF.
- 1.Shieh A, Kandula S, Greenberg A, et al. Sharing the data center network. In: Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation, Boston, 2011. 22–30Google Scholar
- 2.Guo C, Lu G, Wang H, et al. Secondnet: a data center network virtualization architecture with bandwidth guarantees. In: Proceedings of the 6th International Conference on Emerging Networking Experiments and Technologies, Philadelphia, 2010. 7–14Google Scholar
- 3.Gar_nkel S. An evaluation of amazons grid computing services: EC2, S3, and SQS. Center for Citeseer, 2007Google Scholar
- 4.Wang G, Ng T. The impact of virtualization on network performance of amazon EC2 data center. In: Proceedings of IEEE INFOCOM, San Diego, 2010. 1–9Google Scholar
- 6.Gupta A, Kleinberg J, Kumar A, et al. Provisioning a virtual private network: a network design problem for multicommodity flow. In: Proceedings of the 33rd Annual ACM symposium on Theory of Computing, Creta, 2001. 389–398Google Scholar
- 8.Zhu Y, Ammar M. Algorithms for assigning substrate network resources to virtual network components. In: Proceedings of IEEE International Conference on Computer Communications, Barcelona, 2006. 12–24Google Scholar
- 9.Lu J, Turner J. Efficient Mapping of Virtual Networks onto a Shared Substrate. Technical Report, Washington University in St. Louis, 2006Google Scholar
- 10.Fan J, Ammar M. Dynamic topology configuration in service overlay networks: a study of reconfiguration policies. In: Proceedings of IEEE International Conference on Computer Communications, Barcelona, 2006. 1–12Google Scholar
- 12.Houidi I, Louati W, Zeghlache D. A distributed virtual network mapping algorithm. In: Proceedings of IEEE International Conference on Communications, Beijing, 2008. 5634–5640Google Scholar
- 15.Chowdhury N, Rahman M, Boutaba R. Virtual network embedding with coordinated node and link mapping. In: Proceedings of IEEE International Conference on Computer Communications, Rio de Janeiro, 2009. 783–791Google Scholar
- 17.Petcu A. A class of algorithms for distributed constraint optimization. Dissertation of Doctoral Degree. Ecole Polytechnique Federale De Lausanne, 2007Google Scholar