IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i17p2023-d620453.html
   My bibliography  Save this article

An Intelligent Web Service Composition and Resource-Optimization Method Using K-Means Clustering and Knapsack Algorithms

Author

Listed:
  • Issam Alhadid

    (Faculty of Information Technology and Systems, University of Jordan, Aqaba 77111, Jordan)

  • Sufian Khwaldeh

    (Faculty of Information Technology and Systems, University of Jordan, Aqaba 77111, Jordan)

  • Mohammad Al Rawajbeh

    (Faculty of Science and Information Technology, AL Zaytoonah University of Jordan, Amman 11942, Jordan)

  • Evon Abu-Taieh

    (Faculty of Information Technology and Systems, University of Jordan, Aqaba 77111, Jordan)

  • Ra’ed Masa’deh

    (School of Business, University of Jordan, Amman 11942, Jordan)

  • Ibrahim Aljarah

    (King Abdulla II School for Information Technology, University of Jordan, Amman 11942, Jordan)

Abstract

Service-oriented architecture (SOA) has emerged as a flexible software design style. SOA focuses on the development, use, and reuse of small, self-contained, independent blocks of code called web services that communicate over the network to perform a certain set of simple tasks. Web services are integrated as composite services to offer complex tasks and to provide the expected services and behavior in addition to fulfilling the clients’ requests according to the service-level agreement (SLA). Web service selection and composition problems have been a significant area of research to provide the expected quality of service (QoS) and to meet the clients’ expectations. This research paper presents a hybrid web service composition model to solve web service selection and composition problems and to optimize web services’ resource utilization using k-means clustering and knapsack algorithms. The proposed model aims to maximize the service compositions’ QoS and minimize the number of web services integrated within the service composition using the knapsack algorithm. Additionally, this paper aims to track the service compositions’ QoS attributes by evaluating and tracking the web services’ QoS using the reward function and, accordingly, use the k-means algorithm to decide to which cluster the web service belongs. The experimental results on a real dataset show the superiority and effectiveness of the proposed algorithm in comparison with the results of the state–action–reward–state–action (SARSA) and multistage forward search (MFS) algorithms. The experimental results show that the proposed model reduces the average time of the web service selection and composition processes to 37.02 s in comparison to 47.03 s for the SARSA algorithm and 42.72 s for the MFS algorithm. Furthermore, the average of web services’ resource utilization results increased by 4.68% using the proposed model in comparison to the resource utilization by the SARSA and MFS algorithms. In addition, the experimental results showed that the average number of service compositions using the proposed model improved by 26.04% compared with the SARSA and MFS algorithms.

Suggested Citation

  • Issam Alhadid & Sufian Khwaldeh & Mohammad Al Rawajbeh & Evon Abu-Taieh & Ra’ed Masa’deh & Ibrahim Aljarah, 2021. "An Intelligent Web Service Composition and Resource-Optimization Method Using K-Means Clustering and Knapsack Algorithms," Mathematics, MDPI, vol. 9(17), pages 1-16, August.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:17:p:2023-:d:620453
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/17/2023/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/17/2023/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Prashant Doshi & Richard Goodwin & Rama Akkiraju & Kunal Verma, 2005. "Dynamic Workflow Composition: Using Markov Decision Processes," International Journal of Web Services Research (IJWSR), IGI Global, vol. 2(1), pages 1-17, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:17:p:2023-:d:620453. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.