Jul 2026· IEEE International Conference on Cloud Computing· pp. 203-213· 0 citations· 24 references
Abstract
Compute and memory resources in cloud environments are strictly managed and isolated by the control plane; in contrast, network resources lack equivalent management and isolation mechanisms. This best-effort treatment of networking leads to significant challenges for modern AI workloads, which have diverse and bandwidth-intensive communication patterns. Without fine-grained network resource control, these workloads suffer from interference, unpredictable throughput, and suboptimal cluster utilization. To address these issues, this paper demonstrates how network bandwidth can be elevated to a first-class, schedulable, and enforceable resource within Kubernetes, the de facto standard for cloud-native orchestration. We introduce a new scheduling capability that models network interfaces as allocatable resources and regulates bandwidth sharing through the Dynamic Resource Allocation (DRA) framework, with enforcement implemented using the Hierarchical Token Bucket (HTB) mechanism. We evaluate the system using multitenant AI workloads derived from real-world communication characteristics with a simulation-based approach and validate the proposed enforcement strategy in a real cluster. Results show that the proposed two-level bandwidth allocation improves tenant performance predictability and satisfaction while maintaining packed cluster utilization.
The results show that soft SLO limits reduce corrective rescheduling actions by 49% compared to hard-limit approaches while maintaining acceptable performance guarantees, and resource-aware scheduling decreases node-level congestion and further mitigates SLO violations, demonstrating the effectiveness of incorporating...
Oliver Larsson, Thijs Metsch, Cristian Klein et al.· 0 citations
The lack of determinism restricts the integration of safety-critical applications into Edge–Fog–Cloud (EFC) architectures. Existing EFC schedulers are typically designed for dynamic, best-effort operation based on unmanaged resource allocation and elastic virtualization. This paradigm introduces unbounded queueing, res...
Omar Hekal, Josepaul Paulachan, Daniel Onwuchekwa et al.· Future Internet· 0 citations
Evaluation on representative workloads demonstrates that P2CS achieves performance comparable to in-network mechanisms while significantly reducing complexity and cost, and requires minimal software changes making it readily deployable in today's datacenter infrastructure.
Ali Munir, Xiao-Lin Pang, Junyi Zhang· Conference on Applications,...· 0 citations
This paper advocates a shift to request-level resource provisioning, which redefines the individual request as the atomic unit for scheduling and resource management, and implements this approach in RRP, a scalable FaaS platform that enables efficient per-request resource allocation and release.
Runfu Li, Zishu Yu, Yifan Wang et al.· IEEE International Symposium...· 0 citations
An eBPF-based scheduling framework is designed and implemented that complements existing kernel mechanisms to improve the accuracy of fine-grained CPU allocation while maintaining low overhead and demonstrates that the proposed approach significantly reduces resource overallocation and performance variability compared...
Chang-Yuan Lin, Mohammad Shahrad· Proceedings of the 4th Works...· 0 citations
A comprehensive review of Kubernetes scheduling strategies published between January 2023 and January 2026 is presented and a multi-dimensional taxonomy is established that categorizes scheduling approaches based on common objectives, modification methods, optimization methodologies, targeted workloads, evaluation meth...
Mohammed Alhakimi, R. Latip· De Computis· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.