Details

Adaptive Scheduling Architecture for Multi-Cluster Kubernetes Systems
ID Petrović, Bogdan (Author), ID Jurič, Branko Matjaž (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (5,50 MB)
MD5: D51C652F0DA118A2B39773D8CC37F5BE

Abstract
The default Kubernetes scheduler optimizes pod placement based on resource availability but does not account for real-time network conditions, limiting its effectiveness in latency-sensitive and geographically distributed environments. This thesis presents an adaptive, latency-aware scheduling architecture for multi-cluster Kubernetes systems. The proposed system introduces geo-distributed edge proxies that continuously measure round-trip latency to worker nodes and track incoming traffic intensity. These metrics feed into an adaptive scoring model that combines weighted-average latency with traffic-based edge-proxy importance, using exponential smoothing and sigmoid normalization. The scheduler uses these scores to place pods on optimal nodes across multiple clusters without relying on external federation frameworks. Experimental evaluation in a simulated multi-cluster environment with dynamically varying network conditions demonstrates that the proposed approach reduces the proportion of requests exceeding 500ms latency from 37.6% to 4.7% in simulated degradation scenarios. The system successfully adapts to changing network conditions and traffic patterns, which is an important factor for latency-sensitive applications.

Language:English
Keywords:kubernetes, edge computing, docker
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FRI - Faculty of Computer and Information Science
Year:2026
PID:20.500.12556/RUL-182454 This link opens in a new window
COBISS.SI-ID:278096899 This link opens in a new window
Publication date in RUL:12.05.2026
Views:176
Downloads:160
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:Slovenian
Title:Prilagodljivo razporejanje aplikacij, občutljivih na latenco, v robnih okoljih Kubernetes
Abstract:
Privzeti razporejevalnik Kubernetes optimizira razporejanje podov na podlagi razpoložljivosti virov, vendar ne upošteva omrežnih pogojev v realnem času, kar omejuje njegovo učinkovitost v okoljih, občutljivih na latenco, ter v geografsko porazdeljenih sistemih. To magistrsko delo predstavlja prilagodljivo, na latenco usmerjeno arhitekturo razporejanja za večgručne sisteme Kubernetes. Predlagani sistem uvaja geografsko porazdeljene robne posrednike, ki neprekinjeno merijo povratno latenco do delovnih vozlišč in spremljajo intenzivnost dohodnega prometa. Te metrike se uporabljajo v prilagodljivem modelu točkovanja, ki združuje uteženo povprečno latenco s prometno uteženo pomembnostjo robnih posrednikov z uporabo eksponentnega glajenja in sigmoidne normalizacije. Razporejevalnik te ocene uporablja za optimalno razporejanje podov prek več gruč brez uporabe zunanjih federacijskih orodij. Eksperimentalna evalvacija v simuliranem večgručnem okolju z dinamično spreminjajočimi se omrežnimi pogoji kaže, da predlagani pristop bistveno zmanjša delež zahtev, ki presegajo 500 ms latence, s 37,6 % na 4,7 % v simuliranih degradacijskih scenarijih. Sistem se uspešno prilagaja spreminjajočim se omrežnim razmeram in vzorcem prometa, kar je pomemben dejavnik za aplikacije, občutljive na latenco.

Keywords:kubernetes, robno računalništvo, docker

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back