By Topic

A Distributed Probabilistic Commitment Control Algorithm for Service-Oriented Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bannazadeh, H. ; Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON, Canada ; Leon-Garcia, A.

Application creation through service composition is a cornerstone for several architectures including Service-Oriented Architecture. As the number and diversity of applications created based on this paradigm increase, the need for guaranteeing quality of service becomes more important. In this paper, we present a distributed algorithm for guaranteeing a specified level of application completion probability. The algorithm is designed to control service commitments in both queue-less and queue-enabled service-oriented systems. The algorithm does not assume a specific distribution type for service execution times and application request inter-arrival times, and hence is suitable for systems with stationary or non-stationary request arrivals. We show that the proposed distributed algorithm achieves its performance objectives for both queue-less and queue-enabled service oriented systems.

Published in:

Network and Service Management, IEEE Transactions on  (Volume:7 ,  Issue: 4 )