کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
454019 | 695091 | 2015 | 7 صفحه PDF | دانلود رایگان |
• The COM2 algorithm efficiently considers multiple clouds while composing services.
• The proposed algorithm successfully competes with previous algorithms.
• Low examined service number is achieved without impacting the combined cloud number.
Service composition is an evolving approach that increases the number of applications of cloud computing by reusing existing services. However, the available methods focus on generating composite services from a single cloud, which limits the benefits that are derived from other clouds. This paper proposes a novel COMbinatorial optimization algorithm for cloud service COMposition (COM2) that can efficiently utilize multiple clouds. The proposed algorithm ensures that the cloud with the maximum number of services will always be selected before other clouds, which increases the possibility of fulfilling service requests with minimal overhead. The experimental results demonstrate that the COM2 successfully competes with previous multiple cloud service composition algorithms by examining a small number of services—which directly relates to execution time—without compromising the number of combined clouds.
Figure optionsDownload as PowerPoint slide
Journal: Computers & Electrical Engineering - Volume 42, February 2015, Pages 107–113