Papers › QoS-aware Big Service Composition using Distributed Co-Evolutionary Algorithm
QoS-aware Big Service Composition using Distributed Co-Evolutionary Algorithm
Avik Dutta, Chandrashekar Jatoth, G R Gangadharan, Ugo Fiore
Big services are collections of interrelated web services across virtual and physical domains, processing Big Data. Existing service selection and composition algorithms fail to achieve the global optimum solution in a reasonable time. In this paper, we design an efficient quality of service‐aware big service composition methodology using a distributed co‐evolutionary algorithm. In our proposed model, we develop a distributed NSGA‐III for finding the optimal Pareto front and a distributed multi‐objective Jaya algorithm for enhancing the diversity of solutions. The distributed co‐evolutionary algorithm finds the near‐optimal solution in a fast and scalable way.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections