• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document : 131 / 132

ÇѱÛÁ¦¸ñ(Korean Title) A Novel Dynamic Optimization Technique for Finding Optimal Trust Weights in Cloud
¿µ¹®Á¦¸ñ(English Title) A Novel Dynamic Optimization Technique for Finding Optimal Trust Weights in Cloud
ÀúÀÚ(Author) Aluri V.H. Sai Prasad   Ganapavarapu V.S. Rajkumar  
¿ø¹®¼ö·Ïó(Citation) VOL 16 NO. 06 PP. 2060 ~ 2073 (2022. 06)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
Cloud Computing permits users to access vast amounts of services of computing power in a virtualized environment. Providing secure services is essential. There are several problems to real-world optimization that are dynamic which means they tend to change over time. For these types of issues, the goal is not always to identify one optimum but to keep continuously adapting to the solution according to the change in the environment. The problem of scheduling in Cloud where new tasks keep coming over time is unique in terms of dynamic optimization problems. Until now, there has been a large majority of research made on the application of various Evolutionary Algorithms (EAs) to address the issues of dynamic optimization, with the focus on the maintenance of population diversity to ensure the flexibility for adapting to the changes in the environment. Generally, trust refers to the confidence or assurance in a set of entities that assure the security of data. In this work, a dynamic optimization technique is proposed to find an optimal trust weights in cloud during scheduling.
Å°¿öµå(Keyword) Cloud computing   Dynamic programming   Cluster based dynamic optimization techniques   Evolutionary Algorithms   task scheduling   Meta heuristic algorithms and Trust  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå