MétaCan
Menu
Back to cohort
Record W1993096055 · doi:10.1109/ssiri.2009.25

Checking Service Instance Protection for AMF Configurations

2009· article· en· W1993096055 on OpenAlexafffund
Pejman Salehi, Ferhat Khendek, Maria Toeroe, Abdelwahab Hamou‐Lhadj, Abdelouahed Gherbi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicService-Oriented Architecture and Web Services
Canadian institutionsEricsson (Canada)Concordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRedundancy (engineering)Computer scienceProvisioningDistributed computingService (business)Configuration Management (ITSM)High availabilityReliability engineeringSoftware engineeringComputer networkOperating systemEngineering

Abstract

fetched live from OpenAlex

An AMF configuration is a logical organization of resources, components and service units (SUs) grouped into service groups (SGs), for providing and protecting services defined as service instances (SIs). The assignment of SIs to SUs is a runtime operation performed by the availability management framework (AMF) implementation. However, ensuring the capability of the provisioning and the protection of the SIs by the configured resources is a configuration issue. In other words, a configuration is valid if and only if it is capable of providing and protecting the services as required and according to the specified redundancy model. Ensuring this may require the exploration of all possible SI-SU assignments and in some cases different combinations of SIs, a complex procedure in most redundancy models defined in the AMF standard specification. In this paper, we explore the problem of SI protection at configuration time; we investigate and discuss its complexity and identify some special and more tractable cases.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.019
metaresearch head score (Gemma)0.194
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.019
Threshold uncertainty score0.098

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0190.194
Meta-epidemiology (narrow)0.0020.003
Meta-epidemiology (broad)0.0030.005
Bibliometrics0.0040.003
Science and technology studies0.0030.007
Scholarly communication0.0080.019
Open science0.0060.008
Research integrity0.0060.006
Insufficient payload (model declined to judge)0.0050.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.023
GPT teacher head0.250
Teacher spread0.226 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations5
Published2009
Admission routes2
Has abstractyes

Explore more

Same topicService-Oriented Architecture and Web ServicesFrench-language works237,207