A priority-based transaction commit protocol for composite web services

  • Authors:

  • Wei Song;Zheng Gao;Jing Cai;Xiaoxing Ma

  • Affiliations:

  • Nanjing University of Science and Technology, Nanjing, China;Nanjing University, Nanjing, China;Nanjing University, Nanjing, China;Nanjing University, Nanjing, China

  • Venue:
  • Proceedings of the Fourth Asia-Pacific Symposium on Internetware
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Service composition provides an effective way to conduct cross-organizational business transactions. Some protocols and frameworks have been proposed to ensure ACID properties of transactional service requisitions from the perspective of a service requester. However, few of them have focused on how to optimize the services' profits from the perspective of a service provider. In this paper, we present a priority-based transaction commit protocol for composite Web services. For this protocol, Nash Bargaining Solution (NBS) is used to differentiate service requesters so that services (i.e., resources) can be allocated with different priorities. In this way, the profit of a service provider can be maximized with proportional fairness. For service requesters, the proposed protocol can guarantee the atomicity of service requisitions. Our experimental results reveal that the proposed protocol can significantly enhance the profit of service providers without violating atomicity of Web service transactions.