PE-DCA: Penalty Elimination Based Data Center Allocation Technique Using Guided Local Search for IaaS Cloud
Computer Science and Information Systems, Tome 19 (2022) no. 2.

Voir la notice de l'article provenant de la source Computer Science and Information Systems website

In Cloud computing the user requests are passaged to data centers (DCs) to accommodate resources. It is essential to select the suitable DCs as per the user requests so that other requests should not be penalized in terms of time and cost. The searching strategies consider the execution time rather than the related penalties while searching DCs. In this work, we discuss Penalty Elimination-based DC Allocation (PE-DCA) using Guided Local Search (GLS) mechanism to locate suitable DCs with reduced cost, response time, and processing time. The PE-DCA addresses, computes, and eliminates the penalties involved in the cost and time through iterative technique using the defined objective and guide functions. The PE-DCA is implemented using CloudAnalyst with various configurations of user requests and DCs. We examine the PE-DCA and the execution after-effects of various costs and time parameters to eliminate the penalties and observe that the proposed mechanism performs best.
Keywords: Cloud Computing, Data Center, Allocation, Penalty, Meta-heuristic, Guided Local Search
@article{CSIS_2022_19_2_a10,
     author = {Sasmita Parida and Bibudhendu Pati and Suvendu Chandan Nayak and Chhabi Rani Panigrahi and Tien-Hsiung Weng},
     title = {PE-DCA: {Penalty} {Elimination} {Based} {Data} {Center} {Allocation} {Technique} {Using} {Guided} {Local} {Search} for {IaaS} {Cloud}},
     journal = {Computer Science and Information Systems},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {2022},
     url = {http://geodesic.mathdoc.fr/item/CSIS_2022_19_2_a10/}
}
TY  - JOUR
AU  - Sasmita Parida
AU  - Bibudhendu Pati
AU  - Suvendu Chandan Nayak
AU  - Chhabi Rani Panigrahi
AU  - Tien-Hsiung Weng
TI  - PE-DCA: Penalty Elimination Based Data Center Allocation Technique Using Guided Local Search for IaaS Cloud
JO  - Computer Science and Information Systems
PY  - 2022
VL  - 19
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CSIS_2022_19_2_a10/
ID  - CSIS_2022_19_2_a10
ER  - 
%0 Journal Article
%A Sasmita Parida
%A Bibudhendu Pati
%A Suvendu Chandan Nayak
%A Chhabi Rani Panigrahi
%A Tien-Hsiung Weng
%T PE-DCA: Penalty Elimination Based Data Center Allocation Technique Using Guided Local Search for IaaS Cloud
%J Computer Science and Information Systems
%D 2022
%V 19
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CSIS_2022_19_2_a10/
%F CSIS_2022_19_2_a10
Sasmita Parida; Bibudhendu Pati; Suvendu Chandan Nayak; Chhabi Rani Panigrahi; Tien-Hsiung Weng. PE-DCA: Penalty Elimination Based Data Center Allocation Technique Using Guided Local Search for IaaS Cloud. Computer Science and Information Systems, Tome 19 (2022) no. 2. http://geodesic.mathdoc.fr/item/CSIS_2022_19_2_a10/