Metraipolis › archive › dc_6abfa8d2374a

Gate Control Improves Routing Efficiency for Periodic Traffic — arXiv:2610.01534

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01534
License (as archived)
CC0-1.0
Archived
2026-10-07T12:06:52.709Z
SHA-256 of the archived text
d1df36de2d552009621cc3e9bf9474b2c0dd1643f6ea2ca384dbcaf0e362ace8
Stable URL of this page
https://metraipolis.com/documento/dc_6abfa8d2374a

How to cite

Gate Control Improves Routing Efficiency for Periodic Traffic — arXiv:2610.01534 — arXiv (en), https://arxiv.org/abs/2610.01534 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6abfa8d2374a (Metraipolis archive dc_6abfa8d2374a, sha256 d1df36de2d552009621cc3e9bf9474b2c0dd1643f6ea2ca384dbcaf0e362ace8)
BibTeX
@misc{dc6abfa8d2374a,
  title = {Gate Control Improves Routing Efficiency for Periodic Traffic — arXiv:2610.01534},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01534},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6abfa8d2374a; sha256 d1df36de2d552009621cc3e9bf9474b2c0dd1643f6ea2ca384dbcaf0e362ace8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01534. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Traffic movement on highways and data packet transmission across the Internet serve as prototypical examples of collective dynamical behavior in complex systems. Although enhancing traffic flow in complex networks has been extensively investigated, most existing studies focus on single-queue models. In this paper, we introduce a simple yet effective two-queue scheme with gate control that regulates vehicle entry and integrates it with the routing protocol. When vehicles arrive at a on-ramp gate, they first join a waiting queue and are permitted to enter the main flowing queue once it has emptied. This two-queue strategy is especially advantageous when highway inflow varies periodically with large fluctuations, as is commonly observed in real traffic. Moreover, it modifies the system's failure characteristics, replacing sudden, discontinuous jamming transitions with gradual, continuous ones. The approach is based on a simple rule using only local queue information, making it easy to implement and widely applicable. Beyond the specific setup studied here, it can be applied to other transportation networks under different conditions or extended to other queuing systems, such as Internet data packet routing.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-02 in cond-mat.stat-mech).
Categorie arXiv: Statistical Mechanics (cond-mat.stat-mech).
Pagina del lavoro: https://arxiv.org/abs/2610.01534 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:37:21.802Z dalla pagina https://arxiv.org/catchup/cond-mat.stat-mech/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).