{
  "annotation_id": "71df19f6-4e37-4f1e-9c44-8d6cc2e33371",
  "date_created": "2026-03-02T18:01:10.530000Z",
  "date_modified": "2026-03-02T18:01:10.530000Z",
  "file_hash": "3a339d03899b561a7beb4d447665d0162445929a0777bed131279cc5acd1eee8",
  "private": false,
  "record": {
    "abstract": "In this article, we investigate an artificial traffic model on scale-free\nnetworks. Instead of using the routing strategy of the shortest path, a\ngeneralized routing algorithm is introduced to improve the transportation\nthroughput, which is measured by the value of the critical point disjoining the\nfree-flow phase and the congested phase. By using the detrended fluctuation\nanalysis, we found that the traffic rate fluctuation near the critical point\nexhibits the $1/f$-type scaling in the power spectrum. The simulation results\nagree very well with the empirical data, thus the present model may contribute\nto the understanding of the underlying mechanism of network traffics.",
    "arxiv_id": "physics/0608303",
    "authors": [
      "Shi-Min Cai",
      "Gang Yan",
      "Tao Zhou",
      "Pei-Ling Zhou",
      "Zhong-Qian Fu",
      "Bing-Hong Wang"
    ],
    "categories": [
      "physics.soc-ph",
      "physics.data-an"
    ],
    "doi": "10.1016/j.physleta.2007.01.086",
    "journal_ref": "Physics Letters A 366, 14-19 (2007)",
    "title": "Scaling behavior of an artificial traffic model on scale-free networks",
    "url": "https://arxiv.org/abs/physics/0608303"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c0103bda-853e-4d57-ad4e-a7d95167f13d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}