Issue No. 03 - July-September (2009 vol. 2)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSC.2009.18
Daniel J. Rosenkrantz , University at Albany, State University of New York, Albany
Sanjay Goel , University at Albany, State University of New York, Albany
S.S. Ravi , University at Albany, State University of New York , Albany
Jagdish Gangolly , University at Albany, State University of New York, Albany
We develop a graph-theoretic model for service-oriented networks and propose metrics that quantify the resilience of such networks under node and edge failures. These metrics are based on the topological structure of the network and the manner in which services are distributed over the network. We present efficient algorithms to determine the maximum number of node and edge failures that can be tolerated by a given service-oriented network. These algorithms rely on known algorithms for computing minimum cuts in graphs. We also present efficient algorithms for optimally allocating services over a given network so that the resulting service-oriented network can tolerate single node or edge failures. These algorithms are derived through a careful analysis of the decomposition of the underlying network into appropriate types of connected components.
Service allocation, service distribution, optimization of service systems, resilience metrics.
S. Ravi, J. Gangolly, S. Goel and D. J. Rosenkrantz, "Resilience Metrics for Service-Oriented Networks: A Service Allocation Approach," in IEEE Transactions on Services Computing, vol. 2, no. , pp. 183-196, 2009.