دانلود رایگان مقاله تعبیه دینامیک درخواست گردش کار برای کارایی پهنای باند در مراکز داده

عنوان فارسی
تعبیه دینامیک درخواست گردش کار برای کارایی پهنای باند در مراکز داده
عنوان انگلیسی
Dynamic embedding of workflow requests for bandwidth efficiency in data centers
صفحات مقاله فارسی
0
صفحات مقاله انگلیسی
15
سال انتشار
2016
نشریه
الزویر - Elsevier
فرمت مقاله انگلیسی
PDF
کد محصول
E889
رشته های مرتبط با این مقاله
مهندسی کامپیوتر و مهندسی فناوری اطلاعات
گرایش های مرتبط با این مقاله
شبکه های کامپیوتری
مجله
شبکه های کامپیوتر - Computer Networks
دانشگاه
گروه برق و مهندسی کامپیوتر، دانشگاه ملی سنگاپور
کلمات کلیدی
گردش کار، تعبیه گردش کار، مراکز داده ابری، به حداقل رساندن پهنای باند، مسیربحرانی شبکه های نوری مبتنی بر WDM
۰.۰ (بدون امتیاز)
امتیاز دهید
چکیده

Abstract


In this paper, we address the problem of embedding dynamically-arriving workflow requests in data centers. Workflows pose challenges due to data precedence and time disjointness among tasks, thus driving the need for intelligent methods to embed workflows in data centers while improving the bandwidth efficiency as well as guaranteeing the application performance. We first formulate an integer programming optimization model for the embedding problem that minimizes the amount of bandwidth required for workflow execution. We then develop two algorithms namely Critical Path Workflow Embedding (CPWE) and Edge Priority Workflow Embedding (EPWE) to solve this problem. We consider two data center network architectures: packet switching electrical networks and circuit switching optical wavelength division multiplexed (WDM) networks. While WDM-based optical networks have much larger bandwidth capacity to meet the ever-growing traffic demand in data centers, they pose challenges due to wavelength continuity constraint and the nature of circuit switching. We thus additionally propose methods for selecting appropriate Top-of-the-Rack (ToR) switches and wavelengths during the embedding process so as to increase the chance of accommodating many requests that span over multiple ToRs. We evaluate CPWE and EPWE through comprehensive simulations. The results show that CPWE and EPWE significantly reduce the bandwidth required for a workflow request by up to 66% for random workflows and 80% for realistic-application workflows compared to baseline algorithms. The results also show that the proposed methods for ToR selection and wavelength selection in optical data centers outperform other methods by reducing the rejection ratio by up to 47% with dynamic reconfiguration of lightpaths and 40% with incremental configuration of lightpaths.

نتیجه گیری

7. Conclusion


In this paper, we addressed the problem of embedding work- flow resource requests in packet-switched and circuit-switched optical data centers with the consideration of bandwidth requirements. We formulated the embedding problem as an optimization programming model that minimizes the bandwidth required for workflow execution. Since the optimization problem is computationally prohibitive, we developed two heuristic algorithms namely CPWE and EPWE to solve this problem. To deal with the specific characteristic of optical networks, we additionally proposed the methods for ToR selection and wavelength selection to improve the connectivity of optical networks and wavelength utilization. The validation was performed through simulations with random workflows as well as workflows of realistic applications. The simulation results demonstrate the effectiveness of the proposed algorithms by reducing up to 66% of bandwidth required for random workflows and 80% of bandwidth required for realistic-application workflows compared to the baseline algorithms. The results also show that the ToR selection method and the wavelength selection method applied in optical data centers outperform other methods by reducing the rejection ratio up to 47% with dynamic reconfiguration of lightpaths and 40% with incremental configuration of lightpaths.


بدون دیدگاه