By Topic

Automatic Management of Cyclic Dependency among Web Services

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
$33 $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)
Abrehet M. Omer ; Dept. of Comput. Networks, Tech. Univ. Dresden, Dresden, Germany ; Alexander Schill

Dependencies between services arise from the connection among component services and constraints on their interaction. Cyclic dependency is one among the different types of potential dependencies that could occur among web services. Mostly, in many practical applications of dependency information, existences of cyclic dependencies are either ignored or precaution is taken to avoid them by design. In this paper, we propose methods to automatically identify, extract and handle cyclic dependencies. The proposed approach considers two ways of representing dependency: matrix and directed graph, and it provides ways of dealing with cyclic dependency for both representations. In addition, we present the outcome of experimental results.

Published in:

Computational Science and Engineering (CSE), 2011 IEEE 14th International Conference on

Date of Conference:

24-26 Aug. 2011