{
  "abstract": "Reordering low-Earth-orbit (LEO) beam-hopping visits can reduce grant-free update delivery even when each region receives the same service time. We derive the largest limit on inter-frame position changes that meets a prescribed delivery-rate loss tolerance when every group is visited once per frame. The guarantee concerns a protected beam's spatially averaged long-run delivery rate relative to optimized periodic service under exogenous re-planning. Fixed admission can favor irregular visits, whereas admission optimized for each revisit interval makes the per-visit reward concave under sufficient conditions on transmission success. Periodic service is then optimal at a fixed mean interval. The shortest and longest allowed intervals determine the exact worst-case loss, attained by feasible alternating visit orders that respect every group's displacement limit. The resulting budget requires no estimate of the revisit-interval distribution and extends to independent stationary renewal updates. In a collision example with 40 groups and 40 resources per slot, increasing the loss tolerance from zero to 1% raises the limit from 17 to 24 positions. With independent priorities, the latter retains over 90% of the priority-weighted waiting-cost reduction achieved by unrestricted ordering. Received-power simulations under Rayleigh fading support the predicted loss.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2611.07592",
  "author_total": 2,
  "authors": [
    {
      "name": "Joon-Young Park"
    },
    {
      "name": "Young-Chai Ko"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/31p2n31xy3bnz.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2611.07592",
  "fulltext_url": null,
  "id": "31p2n31xy3bnz",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2611.07592",
  "language": null,
  "licence": "CC0-1.0",
  "licence_label": "CC0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/publicdomain/zero/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "eess.SP"
    ],
    [
      "arxiv",
      "math.IT"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2611.07592",
  "pmcid": null,
  "pmid": null,
  "published": "2026-11-05",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/31p2n31xy3bnz.ris",
  "sources": [
    {
      "first_seen": "2026-11-06T18:21:34Z",
      "native_id": "2611.07592",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2611.07592"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access",
  "title_text": "Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access",
  "type": "preprint",
  "updated_at": "2026-11-09T00:20:47Z",
  "url": "https://research.draconitic.com/paper/31p2n31xy3bnz",
  "venue": "arXiv",
  "versions": []
}