{"paper":{"title":"Efficient routing on scale-free networks based on local information","license":"","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Bing-Hong Wang, Chuan-Yang Yin, Hui-Jie Yang, Tao Zhou, Wen-Xu Wang","submitted_at":"2005-06-28T17:00:57Z","abstract_excerpt":"In this letter, we propose a new routing strategy with a single free parameter $\\alpha$ only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of $\\alpha$ is sought out. By investigating the distributions of queue length on each node in free state, we give an explanation why the delivering capacity of the network can be enhanced by choosing the optimal $\\alpha$. Furthermore, dynamic properties right af"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"physics/0506204","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}