MétaCan
Menu
Back to cohort
Record W4392904767 · doi:10.1109/jsac.2024.3365878

Stigmergy and Hierarchical Learning for Routing Optimization in Multi-Domain Collaborative Satellite Networks

2024· article· en· W4392904767 on OpenAlexaff
Yuanfeng Li, Qi Zhang, Haipeng Yao, Ran Gao, Xiangjun Xin, F. Richard Yu

Bibliographic record

VenueIEEE Journal on Selected Areas in Communications · 2024
Typearticle
Languageen
FieldEngineering
TopicSatellite Communication Systems
Canadian institutionsCarleton University
FundersNational Key Research and Development Program of China
KeywordsComputer scienceStigmergyComputer networkHierarchical routingRouting (electronic design automation)Distributed computingCommunications satelliteCollaborative learningDomain (mathematical analysis)SatelliteRouting protocolStatic routingKnowledge management

Abstract

fetched live from OpenAlex

The integration of Software-Defined Networking (SDN) and Artificial Intelligence (AI) presents promising opportunities for managing and optimizing LEO satellite network routing. However, as the scale and coverage of satellite networks continue to expand, challenges are posed to both centralized and distributed architectures in terms of managing network information and coping with routing complexity. To overcome these challenges, leveraging distributed SDN technology, a stigmergy multi-agent hierarchical deep reinforcement learning routing algorithm is proposed in multi-domain collaborative satellite networks. A pheromone-based mechanism is incorporated to facilitate collaboration during independent training, and hierarchical control is employed to decouple the complexity of cross-domain routing decisions. Simulation results demonstrate that our proposed algorithm exhibits good scalability and performance in large-scale satellite networks.

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.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.033
GPT teacher head0.301
Teacher spread0.268 · 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 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

Citations40
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Journal on Selected Areas in CommunicationsSame topicSatellite Communication SystemsFrench-language works237,207