SearcharxivSearch

arXiv subjects

Arnova Abdullah

Publications and source records attributed to Arnova Abdullah.

2 recordsLinked to original sources

Risk-Aware and Stable Edge Server Selection Under Network Latency SLOs

We present a lightweight and interpretable decision framework for dynamic edge server selection in latency-critical applications that explicitly accounts for tail risk and switching stability. Each candidate server is characterised by predictive mean and uncertainty summaries of network latency, which are used to estimate the risk of service-level objective (SLO) violations and to guide selection. Risk is evaluated using a tight Normal approximation complemented by a conservative Cantelli bound, while percentile-based scoring coupled with hysteresis stabilizes decisions and suppresses oscillatory switching under short-lived network fluctuations. Experimental results on a multi-server edge testbed with a strict SLO of $\tau = 0.5$\,s show that the proposed approach reduces the deadline-miss rate from 39\% to 34\% compared to a mean-only baseline, while reducing switching frequency from 46\% to 5.5\% ($\approx$88\% reduction) and maintaining sub-SLO average latency ($\approx$0.45\,s). These results demonstrate that explicit risk evaluation combined with stability-preserving control enables practical and robust adaptive server selection in dynamic edge environments.

cs.DC

Dynamic Edge Server Selection in Time-Varying Environments: A Reliability-Aware Predictive Approach

Latency-sensitive embedded applications increasingly rely on edge computing, yet dynamic network congestion in multi-server architectures challenges proper edge server selection. This paper proposes a lightweight server-selection method for edge applications that fuses latency prediction with adaptive reliability and hysteresis-based handover. Using passive measurements (arrival rate, utilization, payload size) and an exponentially modulated rational delay model, the proposed Moderate Handover (MO-HAN) method computes a score that balances predicted latency and reliability to ensure handovers occur only when the expected gain is meaningful and maintain reduced end-to-end latency. Results show that MO-HAN consistently outperforms static and fair-distribution baselines by lowering mean and tail latencies, while reducing handovers by nearly 50% compared to pure opportunistic selection. These gains arise without intrusive instrumentation or heavy learning infrastructure, making MO-HAN practical for resource-constrained embedded devices.

cs.DC