A process partitioning technique for constructing decentralized web service compositions. (9th August 2019)

• Record Type: Journal Article
• Authors: Xue, Gang; Liu, Di; Liu, Junsong; Yao, Shaowen
• Is Part Of: Software, practice & experience. Volume 49:Number 10(2019)
• Page Start: 1550
• Page End: 1570
• Publication Date: 2019-08-09
• Subjects: decentralized web service compositions -- process partitioning -- QoS -- web service compositions; Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2735
• Languages: English
• ISSNs: 0038-0644

Abstract

Summary: Web service compositions have been widely applied in different applications. A service composition is usually implemented in either a centralized or decentralized manner. Compared with the centralized service composition, the decentralized composition has no central control component, and components interact with each other directly, thereby achieving better performance. Process partitioning is a technique to divide a process into multiple parts and has been shown that it can be successfully applied to decentralizing process‐driven service compositions. This paper proposes a new process partitioning technique for constructing decentralized service compositions. The proposed technique, which is based on typed digraphs and a graph transformation technique, is used for exploring available process partitioning solutions. For applications, this paper discusses the topology and interaction features about the partitioning solutions and summarizes a ranking method for them. Three experiments are conducted to evaluate the proposed methods in this paper. Experimental results show that the proposed methods can be applied in constructing decentralized service compositions effectively. In addition, the results also show that the decentralized compositions can have lower average response times and higher throughputs than the corresponding centralized compositions in the experiments.