Proceedings Article10.5220/0005842101950203
Reliable Virtual Data Center Embedding Across Multiple Data Centers
Gang Sun,Bu Sitong,Vishal Anand,Victor Chang,Dan Liao +4 more
- 05 Feb 2016
pp 195-203
6
TL;DR: This paper model the problem of reliable VDC embedding across multiple data centers, such that the total bandwidth consumption in the inter-data center backbone network is minimized, while satisfying the reliability requirement of each VDC request.
read more
Abstract: Cloud computing has become a cost-effective paradigm for deploying online service applications in large data centers in recent years. Virtualization technology enables flexible and efficient management of physical resources in cloud data centers and improves the resource utilization. A request for resources to a data center can be abstracted as a virtual data center (VDC) request. Due to the use of a large number of resources and at various locations, reliability is an important issue that should be addressed in large and multiple data centers. However, most research focuses on the problem of reliable VDC embedding in a single data center. In this paper, we study the problem of reliable VDC embedding across multiple data centers, such that the total bandwidth consumption in the inter-data center backbone network is minimized, while satisfying the reliability requirement of each VDC request. We model the problem by using mixed integer linear programming (MILP) and propose a heuristic algorithm to address this NP-hard problem efficiently. Simulation results show that the proposed algorithm performs better in terms of lowering physical resource consumption and VDC request blocking ratio compared with existing solution.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Novel resource allocation mechanism for SDN-based data center networks
TL;DR: A cost and security aware VDC mapping mechanism is proposed to address the corresponding resource allocation problem, which aims at minimizing the overall cost with both the basic resource constraints, mapping constraints, the wavelength continuity constraint and the security constraint taken into consideration.
14
A survey and taxonomy on virtual data center embedding
TL;DR: This work tries to articulate the problem of virtual data center embedding (VDCE) problem and bring research taxonomy for succinct classification of existing works, and establishes a classification based on a taxonomy study.
9
Efficiently Consolidating Virtual Data Centers for Time-Varying Resource Demands
TL;DR: In this paper, the authors propose a new VDC consolidation scheme that considers the time-varying feature of resource demands when embedding VDCs, which can significantly improve resource utilization in a DC, which saves up to 25% of the physical servers and 29% of physical links used for accommodating the same requests.
5
Efficiently Consolidating Virtual Data Centers for Time-Varying Resource Demands
01 Jul 2022
TL;DR: In this article , the authors proposed a new VDC consolidation scheme that takes into account the time-varying feature of resource demands when embedding VDCs, which can save up to 25 percent of physical servers and 29 percent of the physical links.
2
Efficient and Green Embedding of Virtual Data Centers with Mixture of Unicast and Multicast Services
TL;DR: Numerical results show that mixed VDC embedding supporting both unicast and multicast services performs significantly better than existing embedding methods in terms of system cost, power consumption, link capacity utilization, and VDC acceptance ratio.
References
A view of cloud computing
Michael Armbrust,Armando Fox,Rean Griffith,Anthony D. Joseph,Randy H. Katz,Andy Konwinski,Gunho Lee,David A. Patterson,Ariel Rabkin,Ion Stoica,Matei Zaharia +10 more
TL;DR: The clouds are clearing the clouds away from the true potential and obstacles posed by this computing capability.
10.4K
The cost of a cloud: research problems in data center networks
Albert Greenberg,James R. Hamilton,David A. Maltz,Parveen Patel +3 more
- 31 Dec 2008
TL;DR: This work examines the costs of cloud service data centers today and proposes (1) joint optimization of network and data center resources, and (2) new systems and mechanisms for geo-distributing state.
Virtual Network Embedding: A Survey
TL;DR: A survey of current research in the Virtual Network Embedding (VNE) area is presented and a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed.
1.3K
Fat-trees: Universal networks for hardware-efficient supercomputing
TL;DR: In this article, the authors presented a new class of universal routing networks, called fat-trees, which might be used to interconnect the processors of a general-purpose parallel supercomputer, and proved that a fat-tree of a given size is nearly the best routing network of that size.
1.2K
•Book
Fat-trees: universal networks for hardware-efficient supercomputing
Charles E. Leiserson
- 01 Jun 1994
TL;DR: In this article, the authors presented a new class of universal routing networks, called fat-trees, which might be used to interconnect the processors of a general-purpose parallel supercomputer, and proved that a fat-tree of a given size is nearly the best routing network of that size.
1.2K