Papers › Conflict Management in the Near-RT-RIC of Open RAN: A Game Theoretic Approach
Conflict Management in the Near-RT-RIC of Open RAN: A Game Theoretic Approach
Abdul Wadud, Fatemeh Golpayegani, Nima Afraz
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Open Radio Access Network (RAN) was introduced recently to incorporate intelligence and openness into the upcoming generation of RAN. Open RAN offers standardized interfaces and the capacity to accommodate network applications from external vendors through extensible applications (xApps), which enhance network management flexibility. The Near-Real-Time Radio Intelligent Controller (Near-RT-RIC) employs specialized and intelligent xApps for achieving time-critical optimization objectives, but conflicts may arise due to different vendors' xApps modifying the same parameters or indirectly affecting each others' performance. A standardized Conflict Management System (CMS) is absent in most of the popular Open RAN architectures including the most prominent O-RAN Alliance architecture. To address this, we propose a CMS with independent controllers for conflict detection and mitigation between xApps in the Near-RT-RIC. We utilize cooperative bargain game theory, including Nash Social Welfare Function (NSWF) and the Equal Gains (EG) solution, to find optimal configurations for conflicting parameters. Experimental results demonstrate the effectiveness of the proposed Conflict Management Controller (CMC) in balancing conflicting parameters and mitigating adverse impacts in the Near-RT-RIC on a theoretical example scenario.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections