Scholarlink

<p>This paper focuses on the financial service composition problem in a multi-cloud environment while ensuring varying levels of privacy. In today's digital era, financial institutions increasingly rely on cloud computing to deliver a wide range of services, necessitating the efficient composition of services across multiple cloud platforms. However, the integration of these services poses significant challenges, particularly in managing privacy levels to protect sensitive financial data. To solve these challenges, a novel approach for financial service composition based on Quaternion Genetic Algorithms (QGA) is proposed. Our method optimizes the scheduling of cloud-based services to minimize execution time, energy consumption, and the file size transferred between clouds, while meeting specified privacy requirements. Simulations show that our proposed method can dynamically adapt to varying privacy constraints and achieve an optimal balance between other targets and privacy requirements.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Financial service composition with various privacy levels in multiple cloud environment

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年2月22日

查看全文
  • Xianmei Hua,
  • Xinrong Zhan,
  • Feng Li,
  • Junwen Lu

摘要

This paper focuses on the financial service composition problem in a multi-cloud environment while ensuring varying levels of privacy. In today's digital era, financial institutions increasingly rely on cloud computing to deliver a wide range of services, necessitating the efficient composition of services across multiple cloud platforms. However, the integration of these services poses significant challenges, particularly in managing privacy levels to protect sensitive financial data. To solve these challenges, a novel approach for financial service composition based on Quaternion Genetic Algorithms (QGA) is proposed. Our method optimizes the scheduling of cloud-based services to minimize execution time, energy consumption, and the file size transferred between clouds, while meeting specified privacy requirements. Simulations show that our proposed method can dynamically adapt to varying privacy constraints and achieve an optimal balance between other targets and privacy requirements.