Towards a Complete Framework for Virtual Data Center Embedding
M P Gilesh

TL;DR
This paper presents a novel algorithm for optimal virtual data center placement on physical infrastructure, enhancing resource utilization and QoS while balancing operational costs.
Contribution
It introduces a dual-mode (online and batch) embedding algorithm that improves acceptance rates and resource efficiency in virtual data center deployment.
Findings
High acceptance rate indicating increased provider profit
Effective resource utilization through coordinated embedding
Reduced VM migrations to lower operational costs
Abstract
Cloud computing is widely adopted by corporate as well as retail customers to reduce the upfront cost of establishing computing infrastructure. However, switching to the cloud based services poses a multitude of questions, both for customers and for data center owners. In this work, we propose an algorithm for optimal placement of multiple virtual data centers on a physical data center. Our algorithm has two modes of operation - an online mode and a batch mode. Coordinated batch and online embedding algorithms are used to maximize resource usage while fulfilling the QoS demands. Experimental evaluation of our algorithms show that acceptance rate is high - implying higher profit to infrastructure provider. Additionaly, we try to keep a check on the number of VM migrations, which can increase operational cost and thus lead to service level agreement violations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · Software-Defined Networks and 5G · Advanced Optical Network Technologies
