MétaCan
Menu
Back to cohort
Record W2107301663 · doi:10.1109/imsaa.2009.5439468

A locality preserving routing overlay using geographic coordinates

2009· article· en· W2107301663 on OpenAlexaff
Shah Asaduzzaman, Gregor von Bochmann

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsPastryLocalityComputer scienceOverlay networkOverlayDistributed computingComputer networkRouting (electronic design automation)Network topologyOverhead (engineering)Convergence (economics)

Abstract

fetched live from OpenAlex

This paper presents a design for a general locality preserving routing overlay network based on geographic coordinates of nodes. For efficient use of network resources, it is important to follow some locality principles while routing bulk multimedia content. The proposed overlay network creates the interconnection among large number of highly dynamic nodes in a completely decentralized manner, based on adaptive hierarchical partitioning of the geographical space. A major benefit of using coarse grain geographic coordinates is that they are available at off-the-shelf databases and thus do not incur additional measurement overhead. The performance of the proposed geography based routing overlay, in terms of two locality properties - stretch and route-convergence, is evaluated by simulation studies. Real topology data of 65 ISPs with presence in 534 cities across the world, collected by the RocketFuel project, is used as the basis of the simulated network. The performance results are compared with corresponding results obtained from a simulated Pastry overlay constructed on the same underlying network. The performance results show that proposed overlay has significantly better stretch and route-convergence characteristics compared to a regular Pastry network. The locality properties of the proposed routing overlay are almost equivalent to those of an optimal Pastry network where all nodes use the most proximal neighbor for each routing table row. Thus the proposed geographical routing network provides good locality properties without the overhead of proximity neighbor selection. Moreover, the proposed scheme facilitates certain geographical search applications that are difficult to realize in a Pastry overlay.

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 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.001
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.882
Threshold uncertainty score0.671

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
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.022
GPT teacher head0.270
Teacher spread0.248 · 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 teacher head, 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

Citations2
Published2009
Admission routes1
Has abstractyes

Explore more

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