arXiv subjects

Anthony Kiggundu

Publications and source records attributed to Anthony Kiggundu.

8 recordsLinked to original sources

arXiv2026

Orchra: Stateful-aware Cross-slice Workload Migrations in the 6G Control Plane

Network slicing is a foundational capability of Fifth Generation (5G)-Advanced and emerging Sixth Generation (6G) networks, yet practical support for seamless runtime slice transitions remains limited. Standard cloud-native 5G architectures lack native support for stateful inter/intra-slice session migration, relying instead on high-overhead Non-Access Stratum (NAS) re-registrations, container redeployment etc., which disrupt userplane traffic for up to 245.50 ms. To address this limitation, we present Orchra, an intelligent orchestrator for stateful, low-latency context transfer. By externalizing critical user equipment state-including NAS context, security keys, and Protocol Data Unit (PDU) session information-into a transient staging layer, Orchra preserves session continuity across slice boundaries without requiring full re-registration. Experimental evaluation shows that Orchra reduces this userplane interruption by more than twice in comparison to conventional Third Generation Partnership Project (3GPP)-based approaches while incurring negligible security overhead. These results demonstrate a practical and reproducible approach for enabling seamless, state-preserving slice transitions in cloud-native 5G-Advanced networks.

cs.NI↗

arXiv2026

The Economics of Autonomy: Real-Time Risk Indexing for Insurable AI-Driven 6G Systems

The transition to sixth-generation (6G) networks transforms wireless infrastructure into a cognitive substrate supporting Vehicle-to-Everything (V2X), Industrial IoT (IIoT), and Integrated Sensing and Communication (ISAC). In this paradigm, autonomous agentic AI performs orchestration at millisecond scales, rendering traditional static governance frameworks fundamentally inadequate for risk management. This paper introduces GIRAF(Governance-Integrated Risk and Assurance Framework), a Governance-as-Code (GaC) framework for real-time risk quantification and trust modulation in agentic 6G systems. GIRAF derives a continuous Aggregate Risk Index ($R_{t}$) from machine-readable runtime signals, including epistemic confidence, network jitter, and verification latency. A core contribution is the formalization of the verification staleness trade-off, where safety mechanisms induce risk if computational latency exceeds 6G deadlines. We demonstrate that GIRAF identifies 'Confidence Gaps' discrepancies between agent reported certainty and environmental ground truth, triggering automated safety envelopes when conditions deteriorate. Crucially, GIRAF serves as the foundational governance groundwork and conceptual 'glue' that externalizes these technical risks into machine-readable telemetry. Through simulations with fine-tuned Large Language Models (LLMs), we validate that the framework preserves operational integrity while providing the essential actuarial baseline required for multi-stakeholder liability attribution and dynamic premium quantification in the 6G ecosystem.

cs.NI↗

arXiv2025

Knowledge vs. Experience: Asymptotic Limits of Impatience in Edge Tenants

We study how two information feeds, a closed-form Markov estimator of residual sojourn and an online trained actor-critic, affect reneging and jockeying in a dual M/M/1 system. Analytically, for unequal service rates and total-time patience, we show that total wait grows linearly so abandonment is inevitable and the probability of a successful jockey vanishes as the backlog approaches towards infinity. Furthermore, under a mild sub-linear error condition both information models yield the same asymptotic limits (robustness). We empirically validate these limits and quantify finite backlog differences. Our findings show that learned and analytic feeds produce different delays, reneging rates and transient jockeying behavior at practical sizes, but converge to the same asymptotic outcome implied by our theory. The results characterize when value-of-information matters (finite regimes) and when it does not (asymptotics), informing lightweight telemetry and decision-logic design for low-cost, jockeying-aware systems.

stat.ML↗

arXiv2025

Adaptive Decentralized Queue Disclosure for Impatient Tenants in Edge and Non-terrestrial Systems

We study how queue-state information disclosures affect impatient tenants in multi-tenant edge systems. We propose an information-bulletin strategy in which each queue periodically broadcasts two Markov models. One is a model of steady-state service-rate behavior and the other a model of the queue length inter-change times. Tenants autonomously decide to renege or jockey based on this information. The queues observe tenant responses and adapt service rates via a learned, rule-based predictive policy designed for decentralized, partially-observed, and time-varying environments. We compare this decentralized, information-driven policy to the classical, centralized Markov Decision Process (MDP) hedging-point policy for M/M/2 systems. Numerical experiments quantify the tradeoffs in average delay, impatience and robustness to stale information. Results show that when full, instantaneous state information and stationarity hold, the hedging-point policy yields less impatience but this diminishes as information becomes partial or stale. The rule-based predictive policy on the other hand is more robust to staleness in dispatched information, making it conducive for conditions typical of edge cloud and non-terrestrial deployments.

eess.SY↗

arXiv2025

FedAvgen: Metadata for Model Aggregation In Communication Systems

To improve business efficiency and minimize costs, Artificial Intelligence (AI) practitioners have adopted a shift from formulating models from scratch towards sharing pretrained models. The pretrained models are then aggregated into a global model with higher generalization capabilities, which is afterwards distributed to the client devices. This approach is known as federated learning and inherently utilizes different techniques to select the candidate client models averaged to obtain the global model. This approach, in the case of communication systems, faces challenges arising from the existential diversity in device profiles. The multiplicity in profiles motivates our conceptual assessment of a metaheuristic algorithm (FedAvgen), which relates each pretrained model with its weight space as metadata, to a phenotype and genotype, respectively. This parent-child genetic evolution characterizes the global averaging step in federated learning. We then compare the results of our approach to two widely adopted baseline federated learning algorithms like Federated Averaging (FedAvg) and Federated Stochastic Gradient Descent (FedSGD).

cs.NE↗

arXiv2025

Improving QoS Prediction in Urban V2X Networks by Leveraging Data from Leading Vehicles and Historical Trends

With the evolution of Vehicle-to-Everything (V2X) technology and increased deployment of 5G networks and edge computing, Predictive Quality of Service (PQoS) is seen as an enabler for resilient and adaptive V2X communication systems. PQoS incorporates data-driven techniques, such as Machine Learning (ML), to forecast/predict Key Performing Indicators (KPIs) such as throughput, latency, etc. In this paper, we aim to predict downlink throughput in an urban environment using the Berlin V2X cellular dataset. We select features from the ego and lead vehicles to train different ML models to help improve the predicted throughput for the ego vehicle. We identify these features based on an in-depth exploratory data analysis. Results show an improvement in model performance when adding features from the lead vehicle. Moreover, we show that the improvement in model performance is model-agnostic.

cs.NI↗

arXiv2024

Resource Allocation in Mobile Networks: A Decision Model Of Jockeying in Queues

Use-case-specific network slicing in decentralized multi-tenancy cloud environments is a promising approach to bridge the gap between the demand and supply of resources in next-generation communication networks. Our findings associate different slice profiles to queues in a multi-server setting, such that tenants continuously assess their preferences and make rational decisions to minimize the queuing delay. Deviated from classical approaches that statistically model the jockeying phenomena in queuing systems, our work pioneers to setup a behavioral model of jockeying impatient tenants. This will serve as a basis for decentralized management of multi-queue systems, where the decision to jockey is individually made by each tenant upon its up-to-date assessment of expected waiting time. Additionally, we carry out numerical simulations to empirically unravel the parametric dependencies of the tenants' jockeying behavior.

cs.NI↗

arXiv2024

Chronicles of Jockeying in Queuing Systems

Emerging trends in communication systems, such as network softwarization, functional disaggregation, and multi-access edge computing (MEC), are reshaping both the infrastructural landscape and the application ecosystem. These transformations introduce new challenges for packet transmission, task offloading, and resource allocation under stringent service-level requirements. A key factor in this context is queue impatience, where waiting entities alter their behavior in response to delay. While balking and reneging have been widely studied, this survey focuses on the less explored but operationally significant phenomenon of jockeying, i.e. the switching of jobs or users between queues. Although a substantial body of literature models jockeying behavior, the diversity of approaches raises questions about their practical applicability in dynamic, distributed environments such as 5G and Beyond. This chronicle reviews and classifies these studies with respect to their methodologies, modeling assumptions, and use cases, with particular emphasis on communication systems and MEC scenarios. We argue that forthcoming architectural transformations in next-generation networks will render many existing jockeying models inapplicable. By highlighting emerging paradigms such as MEC, network slicing, and network function virtualization, we identify open challenges, including state dissemination, migration cost, and stability, that undermine classical assumptions. We further outline design principles and research directions, emphasizing hybrid architectures and decentralized decision making as foundations for re-conceptualizing impatience in next-generation communication systems.

cs.NI↗