MétaCan
Menu
Back to cohort
Record W2170735098 · doi:10.1109/icdcs.2011.93

Foundations for Highly Available Content-Based Publish/Subscribe Overlays

2011· article· en· W2170735098 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsOverlayComputer scienceScalabilityOverlay networkDistributed computingOverhead (engineering)Computer networkPublicationVariety (cybernetics)Set (abstract data type)Overlay multicastOperating systemMulticastThe InternetProgramming language

Abstract

fetched live from OpenAlex

Content-based publish/subscribe overlays offer a scalable messaging substrate for various event-based distributed systems. In an enterprise environment where service level agreements(SLAs) are strictly enforced, maintaining high availability and efficiency of the broker overlay is critical. To support these requirements, a set of three primitive operations are proposed to allow arbitrary transformations of an overlay to an optima lone, and two additional primitives are developed to enable ondemand adjustments when there are permanent or transient failures. Both sets of primitive operations minimize disruption by preserving message delivery guarantees even as the overlay topology changes, requiring no overhead when the overlay is not being modified, operating on a fixed neighborhood of brokers regardless of the size of the overlay, and completing quickly under a variety of conditions.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.471
Threshold uncertainty score0.910

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.172
GPT teacher head0.258
Teacher spread0.086 · 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

Quick stats

Citations26
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicPeer-to-Peer Network TechnologiesFrench-language works237,207