An Optimal Execution of Composite Service in Decentralized Environment

It is important for service-oriented architectures to consider about how the composition of web services affects business processes. For instance, a single web service may not have been adequate for most complex business operations, needing the use of multiple web services. This paper proposed a novel technique for optimal partitioning and execution of the services using a decentralized environment. The proposed technique is designed and developed using a genetic algorithm with multiple high task allocations on a single server. We compared three existing techniques, including meta-heuristic genetic algorithm, heuristics like Pooling-and-Greedy-Merge (PGM) technique, and Merge-by-Define-Use (MDU) technique, to a simulation of Business Process Execution Language (BPEL) partition using genetic algorithm through multiple high tasks allocation to single server node. The proposed technique is practical and advantageous. In terms of execution time, number of server requests, and throughput, the proposed technique outperformed the existing GA, PGM, and MDU techniques.

@article{Dongre2022,
  title     = {An Optimal Execution of Composite Service in Decentralized Environment},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {13},
  number    = {2},
  year      = {2022},
  publisher = {The Science and Information Organization},
  author    = {Yashwant Dongre and Rajesh Ingle},
  doi       = {10.14569/IJACSA.2022.0130234},
  url       = {https://doi.org/10.14569/IJACSA.2022.0130234}
}