MétaCan
Menu
Back to cohort
Record W2134972025 · doi:10.3844/jcssp.2007.658.665

An Improved Resource Reservation Protocol

2007· article· en· W2134972025 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

VenueJournal of Computer Science · 2007
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsComputer scienceProtocol (science)ReservationComputer networkResource (disambiguation)Distributed computing

Abstract

fetched live from OpenAlex

ABSTRACT: The classical resource reservation protocol (RSVP) is a flow-based signaling protocol used for reserving resources in the network for a given session. RSVP maintains state information for each reservation at every router along the path. Even though this protocol is very popular, he has some weaknesses. Indeed, RSVP does not include a bidirectional reservation process and it requires refresh messages to maintain the soft states in the routers for each session. In this paper, we propose a senderoriented version of RSVP that can reserve the resources in both directions with only one message, thus reducing the delay for establishing the reservations. We also suggest a refreshment mechanism without any refresh message which could be applied to any soft states protocol. Simulation results show that the proposed protocol is approximately twice faster than RSVPv2 for establishing bidirectional reservations with almost no control overhead during the session.

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.005
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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.981
Threshold uncertainty score0.491

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.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.003
Open science0.0030.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.012
GPT teacher head0.287
Teacher spread0.275 · 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