Structure-Based resilience metrics for service-oriented networks

Authors:
Daniel J. Rosenkrantz;Sanjay Goel;S. S. Ravi;Jagdish Gangolly
Affiliations:
Department of Computer Science, University at Albany – State University of New York, Albany, NY;Department of Management Science and Information Systems, School of Business, University at Albany – State University of New York, Albany, NY;Department of Computer Science, University at Albany – State University of New York, Albany, NY;Department of Accounting and Law, School of Business, University at Albany – State University of New York, Albany, NY
Venue:
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Year:
2005

Citing 17
Cited 1

Fault-tolerant computing: theory and techniques; Vol. 2

Fault-tolerant computing: theory and techniques; Vol. 2
Network resilience

SIAM Journal on Algebraic and Discrete Methods
Network Resilience: A Measure of Network Fault Tolerance

IEEE Transactions on Computers
Fault tolerance in distributed systems

Fault tolerance in distributed systems
Comments on "Network Resilience: A Measure of Network Fault Tolerance"

IEEE Transactions on Computers
A simple min-cut algorithm

Journal of the ACM (JACM)
An architecture for a secure service discovery service

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Graph Algorithms

Graph Algorithms
Introduction to Algorithms

Introduction to Algorithms
Understanding consistency maintenance in service discovery architectures during communication failure

WOSP '02 Proceedings of the 3rd international workshop on Software and performance
Reserving Resilient Capacity in a Network

SIAM Journal on Discrete Mathematics
On Fully Decentralized Resource Discovery in Grid Environments

GRID '01 Proceedings of the Second International Workshop on Grid Computing
Dependability Issues in Smart Networks

SMARTNET '99 Proceedings of the IFIP TC6 WG6.7 Fifth International Conference on Intelligence in Networks
Survivability Analysis of Network Specifications

DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Understanding Consistency Maintenance in Service Discovery Architectures in Response to Message Loss

AMS '02 Proceedings of the Fourth Annual International Workshop on Active Middleware Services
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A Resilient Network that Can Operate Under Duress: To Support Communication between Government Agencies during Crisis Situations

HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5

HAWKEYE: effective discovery of dataflow impediments to parallelization

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on top of the physical network. It is well recognized that the performance of many of the networked computer systems is severely degraded under node and edge failures. The focus of our work is on the resilience of service-oriented networks. We develop a graph theoretic model for service-oriented networks. Using this model, we 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. Based on this framework, we address two types of problems. The first type involves the analysis of a given network to determine its resilience parameters. The second type involves the design of networks with a given degree of resilience. We present efficient algorithms for both types of problems. Our approach for solving analysis problems relies on known algorithms for computing minimum cuts in graphs. Our algorithms for the design problem are based on a careful analysis of the decomposition of the given graph into appropriate types of connected components.