Close category search window
 

QoS adaption aware algorithm for grid service selection

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

3 Author(s)
Jingya Zhou ; Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing ; Junzhou Luo ; Zhiang Wu

Grid service composition has been recognized as a flexible way for resource sharing and application integration since appearance of service-oriented architecture. Approaches are needed to select service candidates with various Quality of Service (QoS) levels according to use's performance requirements. In this paper We model this problem as the Multi-Constrained Optimal Path Selection Problem (MCOP), due to the dynamic property of grid service, adaptive mechanism is introduced to ensure the whole QoS when some service candidates fail. An algorithm QAGSS is proposed. Simulation results show that QAGSS has greater success rate and lower cost than previous algorithms.

Published in:
Computer Supported Cooperative Work in Design, 2008. CSCWD 2008. 12th International Conference on

Date of Conference: 16-18 April 2008

Need Help?


IEEE Advancing Technology for Humanity 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.