Journal on Communications ›› 2014, Vol. 35 ›› Issue (5): 49-56.doi: 10.3969/j.issn.1000-436x.2014.05.007

• academic paper • Previous Articles     Next Articles

Approach for distributed BPEL engine placement using K-means

Rong-heng LIN,Bu-dan WU,Yao ZHAO,Fang-chun YANG   

  1. State Key Lab of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Online:2014-05-25 Published:2017-07-24
  • Supported by:
    TheNationalHighTechnologyResearchandDevelopmentProgramofChina(863Program);The National Natural Science Foundation of China

Abstract:

Aiming to solve the distributed BPEL engine placing problem in cloud, a K-means based distributed BPEL en-gine placing algorithm was proposed. The algorithm transforms the BPEL engine placing model into some optimization model in mathematics, and the optimization problem is solved by K-means algorithm. How to apply the algorithm in dif-ferent network topologies was also discussed, such as random graph and tree network. In the end, statistical software R was used as experiment tool to evaluate the algorithm. Results show that the proposed method can provide a more opti-mized bandwidth usage of combined BPEL service execution.

Key words: BPEL, service engine, K-means, distributed computing, cloud computing

No Suggested Reading articles found!