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.

QoS‐aware big service composition using distributed co‐evolutionary algorithm

Fiore, Ugo
2021-01-01

Abstract

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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11367/95692
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 7
social impact