SearcharxivSearch

arXiv subjects

Arman Divband

Publications and source records attributed to Arman Divband.

2 recordsLinked to original sources

METIS: A Declarative Slice Orchestrator for Application-Centric 5G/6G Networks

Network slicing is the cornerstone of application-aware 5G and 6G networks, yet dynamic lifecycle management of network slice instances with coordinated quality-of-service enforcement across the radio access network and core network remains unresolved. Existing orchestrators rely on network-centric data models, imperative workflows, and static slice templates, while O-RAN addresses radio-side slice control independently of 3GPP core-side control, leaving slice-level quality-of-service enforcement uncoordinated across domains. This paper introduces METIS, a declarative slice orchestrator that manages the Day-0/1/2 lifecycle of network slice instances through cascaded reconciliation loops. METIS defines an application-centric data model for service profiles, enabling customers to describe the semantics and quality-of-experience requirements of their applications. From these, METIS derives 3GPP-aligned slice profiles via hierarchical aggregation following the 5G quality-of-service model, eliminating static templates, and jointly coordinates O-RAN and 3GPP slicing for slice instantiation and enforcement. Our central finding is a structural asymmetry in end-to-end slice control: downlink traffic can be shaped at the core before reaching the radio access network, but uplink leaves the user equipment unregulated, so core-only slicing cannot reliably satisfy uplink service-level agreements - radio-side enforcement is necessary, not merely complementary. Evaluated on a 5G cloud-native testbed in a campus-event scenario, METIS completes slice creation, update, upgrade, and deletion within 22.4, 5.1, 52.2, and 32.1 seconds, respectively; sustains full service-level-agreement satisfaction under concurrent multi-slice overload; scales to 63 slice instances across nine zones consuming under 0.03 processor cores total; and recovers slices from injected failures across four levels in under 19 seconds.

cs.NI

A Scheduling Algorithm to Maximize Storm Throughput in Heterogeneous Cluster

In the most popular distributed stream processing frameworks (DSPFs), programs are modeled as a directed acyclic graph. This model allows a DSPF to benefit from the parallelism power of distributed clusters. However, choosing the proper number of vertices for each operator and finding an appropriate mapping between these vertices and processing resources have a determinative effect on overall throughput and resource utilization; while the simplicity of current DSPFs' schedulers leads these frameworks to perform poorly on large-scale clusters. In this paper, we present the design and implementation of a heterogeneity-aware scheduling algorithm that finds the proper number of the vertices of an application graph and maps them to the most suitable cluster node. We start to scale up the application graph over a given cluster gradually, by increasing the topology input rate and taking new instances from bottlenecked vertices. Our experimental results on Storm Micro-Benchmark show that 1) the prediction model estimate CPU utilization with 92% accuracy. 2) Compared to default scheduler of Storm, our scheduler provides 7% to 44% throughput enhancement. 3) The proposed method can find the solution within 4% (worst case) of the optimal scheduler which obtains the best scheduling scenario using an exhaustive search on problem design space.

cs.DC