{"paper":{"title":"Traffic dynamics in scale-free networks with limited packet-delivering capacity","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.NI","authors_text":"Bing-Hong Wang, Han-Xin Yang, Wen-Xu Wang, Zhi-Xi Wu","submitted_at":"2011-09-04T11:35:03Z","abstract_excerpt":"We propose a limited packet-delivering capacity model for traffic dynamics in scale-free networks. In this model, the total node's packet-delivering capacity is fixed, and the allocation of packet-delivering capacity on node $i$ is proportional to $k_{i}^{\\phi}$, where $k_{i}$ is the degree of node $i$ and $\\phi$ is a adjustable parameter. We have applied this model on the shortest path routing strategy as well as the local routing strategy, and found that there exists an optimal value of parameter $\\phi$ leading to the maximal network capacity under both routing strategies. We provide some ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0697","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"}