Metraipolis › archive › dc_221a0ed07eab
Blockchain-based Proportional Fair Scheduling for Multi-Operator O-RAN — arXiv:2609.07473
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.07473
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:09:26.133Z
- SHA-256 of the archived text
015c4e258c0b8d8f52e5b5cc02343ed647330f2c0dbd10ca4c5673db59a311e4- Stable URL of this page
https://metraipolis.com/documento/dc_221a0ed07eab
How to cite
Blockchain-based Proportional Fair Scheduling for Multi-Operator O-RAN — arXiv:2609.07473 — arXiv (en), https://arxiv.org/abs/2609.07473 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_221a0ed07eab (Metraipolis archive dc_221a0ed07eab, sha256 015c4e258c0b8d8f52e5b5cc02343ed647330f2c0dbd10ca4c5673db59a311e4)
BibTeX
@misc{dc221a0ed07eab,
title = {Blockchain-based Proportional Fair Scheduling for Multi-Operator O-RAN — arXiv:2609.07473},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.07473},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_221a0ed07eab; sha256 015c4e258c0b8d8f52e5b5cc02343ed647330f2c0dbd10ca4c5673db59a311e4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.07473. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The openness and disaggregation of Open radio access network (O-RAN) facilitate resource sharing and coordination across networks, creating new demands for efficient and trustworthy cross-operator scheduling. However, such scheduling is beyond the scope and capability of conventional proportional fair scheduling (PFS), which lacks mechanisms for establishing trust among independent operators. To fulfill this gap, we propose the blockchain-based proportional fair scheduling (BC-PFS) that enables trustworthy inter-network coordination and resource pooling across operators in O-RAN. Specifically, we design four core smart contracts including registration, status reporting, scheduling, and settlement contracts with corresponding Solidity implementations to ensure trustworthy on-chain execution. Theoretically, to evaluate the BC-PFS performance, we develop an analytical framework to derive the user average throughput via both probabilistic and ordinary differential equation (ODE) approaches, and provide a simplified closed-form solution. Based on the above performance assessment, we quantify the pooling effect in O-RAN achieved through trustworthy cross-operator collaboration via BC-PFS, and point out that this effect grows monotonically in both the numbers of operator networks and users. Simulations validate the theoretical analysis and show the performance of the BC-PFS in O-RAN. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-09 in cs.NI). Categorie arXiv: Networking and Internet Architecture (cs.NI). Pagina del lavoro: https://arxiv.org/abs/2609.07473 — 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-16T13:58:54.241Z dalla pagina https://arxiv.org/catchup/cs.NI/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).