The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - July-September (2009 vol.2)
pp: 183-196
Sanjay Goel , University at Albany, State University of New York, Albany
S.S. Ravi , University at Albany, State University of New York , Albany
Daniel J. Rosenkrantz , University at Albany, State University of New York, Albany
ABSTRACT
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.
INDEX TERMS
Service allocation, service distribution, optimization of service systems, resilience metrics.
CITATION
Sanjay Goel, S.S. Ravi, Daniel J. Rosenkrantz, "Resilience Metrics for Service-Oriented Networks: A Service Allocation Approach", IEEE Transactions on Services Computing, vol.2, no. 3, pp. 183-196, July-September 2009, doi:10.1109/TSC.2009.18
REFERENCES
[1] R. Ahuja, T. Magnanti, and J. Orlin, Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Inc., 1993.
[2] D.G. Andersen, H. Balakrishnan, F. Kaashoek, and R.T. Morris, “Resilient Overlay Networks,” Proc. 18th ACM Symp. Operating System Principles (SOSP '01), pp. 131-145, Oct. 2001.
[3] D.G. Andersen, H. Balakrishnan, F. Kaashoek, and R.T. Morris, “The Case for Resilient Overlay Networks,” Proc. Ann. Workshop Hot Topics in Operating Systems (HotOS VIII), pp. 152-157, May 2001.
[4] G. Brightwell, G. Oriolo, and F. Shepherd, “Reserving Resilient Capacity in a Network,” SIAM J. Discrete Math., vol. 14, no. 4, pp.524-539, Oct. 2001.
[5] M. Castro and B. Liskov, “Practical Byzantine Fault Tolerance and Proactive Recovery,” ACM Trans. Computer Systems, vol. 20, no. 4, pp 398-461, Nov. 2002.
[6] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. MIT Press and McGraw-Hill, 2001.
[7] F. Cuenca-Acuna, R. Martin, and T. Nguyen, “Autonomous Replication for High Availability in Unstructured P2P Systems,” Proc. 22nd IEEE Symp. Reliable Distributed Systems (SRDS '03), pp.99-108, Aug. 2003.
[8] C. Colbourn, “Network Resilience,” SIAM J. Algebraic and Discrete Methods, vol. 8, pp. 404-409, 1987.
[9] S. Czerwinski, B. Zhao, T. Hodes, A. Joseph, and R. Katz, “An Architecture for a Secure Service Discovery Service,” Proc. ACM MobiCom, pp. 24-35, Aug. 1999.
[10] Y. Dai and G. Levitin, “Reliability and Performance of Tree-Structured Grid Services,” IEEE Trans. Reliability, vol. 55, no. 2, pp.337-349, June 2006.
[11] Y. Dai and G. Levitin, “Optimal Resource Allocation for Maximizing Performance and Reliability in Tree-Structured Grid Services,” IEEE Trans. Reliability, vol. 56, no. 3, pp. 444-453, Sept. 2007.
[12] C. Dabrowski, K. Mills, and J. Elder, “Understanding Consistency Maintenance in Service Discovery Architectures in Response to Message Loss,” Proc. Fourth Int'l Workshop Active Middleware Services (WAMS '02), pp. 51-60, July 2002.
[13] C. Dabrowski, K. Mills, and J. Elder, “Understanding Consistency Maintenance in Service Discovery Architectures during Communication Failure,” Proc. Third Int'l Workshop Software Performance (WOSP '02), pp. 168-178, July 2002.
[14] C. Dabrowski, K. Mills, and A. Rukhin, “Performance of Service-Discovery Architectures in Response to Node Failures,” Proc. Int'l Conf. Software Eng. Research and Practice (SERP '03), pp. 95-101, June 2003.
[15] Y. Dai, Y. Pan, and X. Zou, “A Hierarchical Modeling and Analysis for Grid Service Reliability,” IEEE Trans. Computers, vol. 56, no. 5, pp. 681-691, May 2007.
[16] J. Douceur and R. Wattenhofer, “Optimizing File Availability in a Secure Serverless Distributed File System,” Proc. 20th IEEE Symp. Reliable Distributed Systems (SRDS '01), pp. 4-13, Oct. 2001.
[17] V. Ermagan, C. Farcas, E. Farcas, I.H. Krüger, and M. Menarini, “A Service-Oriented Approach to Failure Management,” Proc. Dagstuhl Workshop Model-Based Development of Embedded Systems (MBEES '08), p. 15, Apr. 2008.
[18] S. Even, Graph Algorithms. Computer Science Press, 1979.
[19] N. Feamster, D.G. Andersen, H. Balakrishnan, and F. Kaashoek, “Measuring the Effects of Internet Path Faults on Reactive Routing,” Proc. ACM Conf. Measurement and Modeling of Computer Systems (SIGMETRICS '03), pp. 126-137, June 2003.
[20] I. Foster and C. Kessleman, The Grid 2: Blueprint for a New Computing Infrastructure. Morgan-Kauffmann, 2003.
[21] S. Goel, S. Belardo, and L. Iwan, “A Resilient Network That Can Operate under Duress: Supporting Communication between Government Agencies during Crisis Situations,” Proc. Hawaii Int'l Conf. System Sciences, Jan. 2003.
[22] “Towards Resilient Networks and Services,” ACTS Guidelines NIG-G5, P. Georgatsos and Y. Joens, eds., June 1999.
[23] B. Gedik and L. Liu, “Reliable Peer-to-Peer Information Monitoring through Replication,” Proc. 22nd IEEE Symp. Reliable Distributed Systems (SRDS '03), Aug. 2003.
[24] S. Goel, S. Talya, and M. Sobolewski, “Service-Based P2P Overlay Network for Collaborative Problem Solving,” Decision Support Systems, vol. 43, no. 2, pp. 547-568, Mar. 2007.
[25] B. Helvik, “Dependability Issues in Smart Networks,” Proc. Fifth IFIP Conf. Intelligence in Networks, pp. 53-76, Nov. 1999.
[26] F. Harary and J. Hayes, “Edge Fault Tolerance in Graphs,” Networks, vol. 23, no. 2, pp. 135-142, Mar. 1993.
[27] F. Hwang, “Comments on ‘Network Resilience: A Measure of Network Fault Tolerance’,” IEEE Trans. Computers, vol. 43, no. 12, pp. 1451-1452, Dec. 1994.
[28] A. Iamnitchi and I. Foster, “On Fully Decentralized Resource Discovery in Grid Environments,” Proc. Int'l Workshop Grid Computing, Nov. 2001.
[29] P. Jalote, Fault Tolerance in Distributed Systems. Prentice-Hall, 1994.
[30] S. Jha, J. Wing, R. Linger, and T. Longstaff, “Survivability Analysis of Network Specifications,” Proc. Workshop Dependability Despite Malicious Faults, held in conjunction with IEEE Int'l Conf. Dependable Systems and Networks (DSN '00), pp. 613-622, June 2000.
[31] M. Lin, M. Chang, and D. Chen, “Distributed-Program Reliability Analysis: Complexity and Efficient Algorithms,” IEEE Trans. Reliability, vol. 48, no. 1, pp. 87-95, Mar. 1999.
[32] K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, “A Survey and Comparison of Peer-to-Peer Overlay Network Schemes,” IEEE Comm. Surveys and Tutorials, vol. 7, pp. 72-93, Mar. 2005.
[33] G. Levitin, Y. Dai, and H. Ben-Haim, “Reliability and Performance of Star Topology Grid Service with Precedence Constraints on Subtask Execution,” IEEE Trans. Reliability, vol. 55, no. 3, pp. 507-515, Sept. 2006.
[34] D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, “Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience,” Proc. ACM SIGCOMM, pp. 395-406, Aug. 2003.
[35] D. Loguinov, A. Kumar, and S. Ganesh, “Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience,” Proc. ACM SIGCOMM, pp. 395-406, Aug. 2003.
[36] L. Massoulie, A. Kermarrec, and A. Ganesh, “Network Awareness and Failure Resilience in Self-Organizing Overlay Networks,” Proc. 22nd IEEE Symp. Reliable Distributed Systems (SRDS '03), pp.47-55, Aug. 2003.
[37] S. Moitra, E. Oki, and N. Yamanaka, “Some New Survivability Measures for Network Analysis and Design,” IEICE Trans. Comm., vol. E80-B, no. 4, pp. 625-631, Apr. 1997.
[38] W. Najjar and J. Gaudiot, “Network Resilience: A Measure of Network Fault Tolerance,” IEEE Trans. Computers, vol. 39, no. 2, pp. 174-181, Feb. 1990.
[39] Fault-Tolerant Computing: Theory and Techniques, D. Pradhan, ed., vols. I and II. Prentice-Hall, 1986.
[40] D.J. Rosenkrantz, S. Goel, S.S. Ravi, and J. Gangolly, “Structure-Based Resilience Metrics for Service-Oriented Networks,” Proc. Fifth European Dependable Computing Conf. (EDCC '05), pp. 345-362, Apr. 2005.
[41] P. Sousa, N. Ferreira, and P. Verissimo, “How Resilient Are Distributed $f$ -Fault/Intrusion-Tolerant Systems?” Proc. Int'l Conf. Dependable Systems and Networks (DSN '05), pp. 98-107, June/July 2005.
[42] M. Singhal, “Research in High-Confidence Distributed Information Systems,” Proc. 20th IEEE Symp. Reliable Distributed Systems (SRDS '01), pp. 76-77, Oct. 2001.
[43] P. Sousa, F.N. Neves, and P. Verissimo, “Proactive Resilience through Architectural Hybridization,” Proc. ACM Symp. Applied Computing (SAC '06), pp. 686-690, 2006.
[44] U. Saif and J. Paluska, “Service-Oriented Network Sockets,” technical report, Laboratory for Computer Science, Massachusetts Inst. of Tech nology, 2003.
[45] M. Stoer and F. Wagner, “A Simple Min-Cut Algorithm,” J. ACM, vol. 44, no. 4, pp. 585-591, July 1997.
[46] W. Terpstra, J. Kangasharju, C. Leng, and A. Buchmann, “Bubblestorm: Resilient, Probabilistic and Exhaustive Peer-to-Peer Search,” SIGCOMM Computer Comm. Rev., vol. 37, no. 4, pp. 49-60, 2007.
[47] M. Xie, Y. Dai, and K. Poh, Computing Systems Reliability. Kluwer Academic Publishers, 2004.
[48] D. West, Introduction to Graph Theory. Prentice-Hall, Inc., 1996.
[49] B.Y. Zhao, L. Huang, S. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
282 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool