IDEAS home Printed from https://ideas.repec.org/a/igg/jwsr00/v12y2015i2p26-46.html
   My bibliography  Save this article

Graph Similarity based Cloud Migration Service Composition Pattern Discovery

Author

Listed:
  • Zhitao Wan

    (School of Electronics Engineering and Computer Science, Peking University, Beijing, China)

  • Ping Wang

    (National Engineering Research Center for Software Engineering and School of Software and Microelectronics, Peking University, Beijing, China)

  • Lihua Duan

    (School of Software and Microelectronics, Peking University, Beijing, China)

  • Fan Jing Meng

    (IBM Research – China, Beijing, China)

  • Jing Min Xu

    (IBM Research - China, Beijing, China)

Abstract

The demands of migrating on-premises complex enterprise applications to cloud dramatically increase with the wide adoption of cloud computing. A recent research validates the possibility of combining multiple proprietary migration services offered by different vendors together to complete cloud migration. Pattern based service composition has been proven as an appealing approach to accelerate the service composition and ensure the qualities in the Service Oriented Architecture (SOA) domain and can be applied to the cloud migration service composition theoretically. However, current pattern discovery approaches are not applicable for the cloud migration due to lack of either existing cloud migration business process knowledge or execution logs. This paper proposes a novel approach to discover cloud migration patterns from a set of service composition solutions. The authors formalize the pattern discovery as a special graph similarity matching problem and present an algorithm to calculate the similarities of these service composition solutions. Patterns are chosen out of the solutions by similarity under designed criteria. The benchmark results and quantitative analysis show that our proposed approach is effective and efficient in pattern discovery for cloud migration service composition.

Suggested Citation

  • Zhitao Wan & Ping Wang & Lihua Duan & Fan Jing Meng & Jing Min Xu, 2015. "Graph Similarity based Cloud Migration Service Composition Pattern Discovery," International Journal of Web Services Research (IJWSR), IGI Global, vol. 12(2), pages 26-46, April.
  • Handle: RePEc:igg:jwsr00:v:12:y:2015:i:2:p:26-46
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJWSR.2015040102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jwsr00:v:12:y:2015:i:2:p:26-46. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.