MétaCan
Menu
Back to cohort
Record W2165942946 · doi:10.1109/mcom.2006.273105

How to buy a network: trading of resources in the physical layer

2006· article· en· W2165942946 on OpenAlexaff
Vassilis Prevelakis, Admela Jukan

Bibliographic record

VenueIEEE Communications Magazine · 2006
Typearticle
Languageen
FieldComputer Science
TopicDistributed and Parallel Computing Systems
Canadian institutionsInstitut National de la Recherche Scientifique
Fundersnot available
KeywordsComputer scienceService providerComputer networkPoolingNetwork topologyResource (disambiguation)The InternetControl reconfigurationComputer securityService (business)World Wide WebBusiness

Abstract

fetched live from OpenAlex

Recently, a number of new research initiatives, most notably UCLPv2 and GENI, have promoted the dynamic partition of physical network resources (infrastructure) as the means to operate the network, and to implement new protocols and services. This has led to a number of open issues such as resource discovery, implementation of resource partitioning, and the aggregation of resources to create arbitrary network topologies. To us, the key issue is the design of a mechanism to trade, acquire, and control network resources, given a choice of providers of physical resources (infrastructure providers). In this article we present an architecture that allows physical resources to be traded, while granting users controlled access to the acquired resources via a policy enforcement mechanism. In addition, it allows resource provider domains to be linked via configurable, provider-neutral resource exchange points that are the physical resource equivalents of the pooling point, or Internet exchange point (IXP). We demonstrate how our trading system will operate by presenting a use case in which a network topology is constructed using resources from multiple providers, be it Internet service providers (ISPs), or National Research Experimental Network (NREN) providers. The use case also shows how a dynamic reconfiguration can be effected by the customer though the use of simple access control policies, without involving the provider

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.003
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.007
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0020.004
Scholarly communication0.0080.014
Open science0.0010.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0040.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.039
GPT teacher head0.278
Teacher spread0.239 · 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 designTheoretical or conceptual
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

Citations15
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Communications MagazineSame topicDistributed and Parallel Computing SystemsFrench-language works237,207