A DHT-based hierarchical overlay for Peer-to-Peer MMOGs over MANETs
Bibliographic record
Abstract
Massively Multi-player Online Games (MMOGs) as representative Networked Virtual Environments (NVEs) applications have been gaining popularity in the past decade. Recently, MMOGs on mobile ad hoc networks (MANETs) are attracting more and more attention in the research community, due to the widespread of mobile ad hoc devices (e.g. smart phones, iPad etc.), and their continuous increase of processing power and communication resources. However, supporting MMOGs over bandwidth and resource constrained and multi-hop MANETs is challenging. The existing general purpose routing protocols and P2P overlays such as Distributed Hash Tables (DHTs) over MANETs are not suitable for supporting MMOGs. This paper proposes a DHT-based and hierarchical overlay to address the issues. The overlay provides unique features including system portability, topology-awareness, responsiveness, unicast and DHT integration, and extreme scalability. The successful P2P MMOG technique such as interest management thereafter can be applied on top of the overlay to enable P2P MMOGs over MANETs.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".