AMF configurations: Checking for service protection using heuristics

AMF (Availability Management Framework) is a middleware service that manages the availability of applications. AMF has been defined by the Service Availability Forum (SA Forum). An AMF configuration for an application running on top of AMF is a logical organization of hardware and software resources to provide and protect services. Resources, namely components, are grouped into logical entities such as service units and service groups and are set together at configuration time to provide and protect services represented as component service instances and service instances. The assignment of component service instances and service instances to components and service units, respectively, is performed at runtime by the AMF middleware. However, the configuration is valid if and only if it satisfies all AMF constraints, including the provisioning and protection of the services. Therefore, the problem is how to ensure at configuration time that the services will be protected at runtime. In a previous work, we tackled this problem and proved it to be NP-hard in general for most redundancy models. Here, we tackle the problem of AMF configuration validation further with heuristics using extended versions of heuristics developed for the bin-packing problem. We consider all the redundancy models for which the problem is NP-hard. In addition, we propose an approach which incrementally adds resources to a “likely” invalid configuration and transforms it into a valid one.

[1]  Abdelwahab Hamou-Lhadj,et al.  Checking Service Instance Protection for AMF Configurations , 2009, 2009 Third IEEE International Conference on Secure Software Integration and Reliability Improvement.

[2]  C. Kenyon Best-fit bin-packing with random order , 1996, SODA '96.

[3]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[4]  Chetan S. Rao,et al.  Improved approximation bounds for Vector Bin Packing , 2010, ArXiv.

[5]  Abdelwahab Hamou-Lhadj,et al.  A model driven approach for AMF configuration generation , 2010, SAM'10.

[6]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[7]  Christopher Oggerino High Availability Network Fundamentals: A Practical Guide to Predicting Network Availability , 2001 .

[8]  J. B. G. Frenk,et al.  On the multidimensional vector bin packing , 1990, Acta Cybern..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[11]  Susanne Albers,et al.  Average-case analyses of first fit and random fit bin packing , 2000, SODA '98.

[12]  György Dósa,et al.  The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9 , 2007, ESCAPE.

[13]  Boaz Patt-Shamir,et al.  Vector bin packing with multiple-choice , 2009, Discret. Appl. Math..