مشخصات مقاله:
عنوان فارسی مقاله:
بسته بندی ماشین مجازی مبتنی بر اشتراک صفحه با محدودیت های چند منبعه برای کاهش ترافیک شبکه در مهاجرت به ابرها
عنوان انگلیسی مقاله:
Page-sharing-based virtual machine packing with multi-resource constraints to reduce network traffic in migration for clouds
کلمات کلیدی مقاله:
مهاجرت ماشین مجازی، بسته بندی مجازی ماشین، اشتراک گذاری آگاه حافظه
مناسب برای رشته های دانشگاهی زیر:
مهندسی فناوری اطلاعات – مهندسی کامپیوتر
مناسب برای گرایش های دانشگاهی زیر:
شبکه های کامپیوتری – الگوریتم و محاسبات – معماری سیستم های کامپیوتری
وضعیت مقاله انگلیسی و ترجمه:
مقاله انگلیسی را میتوانید به صورت رایگان با فرمت PDF با کلیک بر روی دکمه آبی، دانلود نمایید. برای ثبت سفارش ترجمه نیز روی دکلمه قرمز رنگ کلیک نمایید. سفارش ترجمه نیازمند زمان بوده و ترجمه این مقاله آماده نمیباشد و پس از اتمام ترجمه، فایل ورد تایپ شده قابل دانلود خواهد بود.
فهرست مطالب:
Outline
Highlights
Abstract
Keywords
۱٫ Introduction
۲٫ CBPS VM maximization problem
۳٫ CBPS VM Packing problem
۴٫ Performance evaluation
۵٫ Related work
۶٫ Conclusion
Acknowledgments
References
قسمتی از مقاله انگلیسی:
Abstract
Virtual machine (VM) packing plays an important role in improving resource utilization in cloud data centers. Recently, memory content similarity among VM instances has been used to speed up multiple VM migration in large clouds. Based on this, many VM packing algorithms have been proposed, which only considered the memory capacity of physical machines (PMs) as the resource constraint. However, in practice the results of such algorithms are not feasible, because thy may not satisfy the constraints of multiple resources (e.g., CPU of the PMs). Besides, the granularities of memory sharing in existing studies are very coarse, and they cannot fully leverage the benefits of memory content similarity which mainly appears at memory page level. In this paper, we study the page-sharing-based VM packing that considers constraints in multiple resources. Given a set of VM instances that share a large number of common memory pages, we pack them into the minimum number of PMs, subject to the constraints in the multiple resources on the PMs. This problem is solved in two steps. First, we pack the maximum number of VMs into a given PM, and then propose an approximation algorithm. The approximation ratio is better than that of the existing algorithm. Then, based on this approximation algorithm, we propose a heuristic algorithm to solve the general problem. Experimental results show that our heuristic algorithm outperforms existing approaches with at most 25% less required PMs and at most 40% less memory page transferring.
1. Introduction
Cloud computing has attracted much research attention in recent years. By gathering and concentrating various kinds of heterogeneous computing capabilities and delivering them as services to users via Internet, cloud computing greatly improves efficiency in application development. To meet the users’ Quality of Service (QoS) requirements, cloud data centers (CDCs) are usually fully provisioned or over-provisioned [1], which results in under utilization of resources in CDCs. For example, only 10%– 15% computing resources of about 30% cloud servers in CDCs are utilized [2].