Referenced Items are not available for this document.
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
)
Date of Publication: December 2010
- Page(s):
- 204 - 217
- ISSN :
- 1932-4537
- INSPEC Accession Number:
- 11698253
- Digital Object Identifier :
- 10.1109/TNSM.2010.1012.I9P0338
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 17 December 2010
- Issue Date :
- December 2010
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
