The analysis shows that services with stringent latency deadlines and larger computing demands are more sensitive to temporal variabilities, making local execution the preferred option, and that effective service offloading must jointly consider service requirements and sources of temporal variability to guarantee deterministic service levels.
Abstract
6G will integrate communication and computing capabilities in a IoT-edge-cloud continuum, enabling nodes to distribute workloads across the continuum. To support time-sensitive services, both communications and computing latencies must be controlled. Two key sources of temporal variability are arrival-time jitter and traffic variability. They can both impact the timing at which data is generated, transmitted and processed, and the resulting fluctuations can propagate throughout the continuum, increasing latency uncertainty. This paper studies the impact of stochastic temporal variability on the ability to support end-to-end deterministic service levels across the continuum. To this end, we present a novel queueing-based end-to-end latency model for the continuum, which we openly release. The model jointly captures computing and communication latency, and characterizes the complete end-to-end latency distribution, including tail latency. Our analysis shows that services with stringent latency deadlines and larger computing demands are more sensitive to temporal variabilities, making local execution the preferred option. In contrast, services with more relaxed deadlines are more resilient to temporal variabilities when executed locally or at the edge despite higher average and tail latencies. Edge offloading is beneficial under good cellular connectivity and increasing local processing workloads, whereas cloud execution is more sensitive to traffic variabilities because of the additional communication latency. Our analysis also shows that services offloaded are more sensitive to traffic variability than jitter due to higher communication latencies. These findings highlight that effective service offloading must jointly consider service requirements and sources of temporal variability to guarantee deterministic service levels.
The key idea is to exploit the latency budget of tasks to control their execution timing, enabling a more balanced distribution of workload over time and reducing peak congestion across the continuum.
K. Aghababaiyan, B. Coll-Perales, Javier Gozálvez· 0 citations
This paper investigates reliability-aware admission-threshold selection for finite-buffer systems with service interruptions, motivated by IoT gateway–cloud architectures and develops a trade-off-driven weighted optimization approach and a constraint-based feasibility-enforcement approach.
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, resource contention, and timing jitter, making standard schedulers unsuitable for hard-deadline workloads. Moreover, most approaches focus on computational placement, while communication is abstracted or treated as a secondary cost term. As a result, bounded-latency routing and deterministic task execution are rarely co-optimized under a unified timing model. This paper addresses these gaps by utilizing a managed Time-Triggered Edge–Fog–Cloud (TTEFC) architecture that supports safety-critical workloads, orchestrates IEEE Time-Sensitive Networking (TSN) for local intra-domain communication, and uses IETF Deterministic Networking (DetNet) for routed inter-domain paths. On this infrastructure, a hierarchical genetic algorithm (HGA) is proposed to jointly schedule partition-to-execution-location allocation, partition execution order, inter-partition route selection, and negotiated per-partition time budgets that act as temporal boundaries for parallel partition-level optimizers. An adaptive slack reallocation operator redistributes unused temporal slack from over-satisfied partitions to budget-violating partitions, improving feasibility convergence. Experiments on synthetic DAG workloads with 100–500 tasks compare the proposed HGA against HEFT and round-robin baselines. These baselines are included as scoped external references to contextualize the end-to-end scheduling performance of the proposed method. Ablation results show that slack reallocation improves partition-budget feasibility, reaches feasible budget assignments earlier, and produces tighter budget–makespan alignment than feedback-free and static-budget variants. An automotive-characteristic DAG case study further evaluates the method on an application-oriented workload under the same timing and communication assumptions.
Omar Hekal, Josepaul Paulachan, Daniel Onwuchekwa et al.· Future Internet· 0 citations
Intent-Based Networking (IBN) has emerged as a promising paradigm for simplifying network management by allowing operators and applications to specify high-level service objectives rather than low-level device configurations. Early IBN research was mainly developed in Software-Defined Networking (SDN), Network Function Virtualization (NFV), transport networks, core networks, and data-center environments, where programmability, virtualization, and relatively stable infrastructure models enabled intent translation, orchestration, and assurance. However, realizing IBN in end-to-end mobile networks is more challenging because the Radio Access Network (RAN) is highly dynamic, wireless-channeldependent, mobility-sensitive, and governed by multiple control timescales. The emergence of Open RAN (O-RAN) changes this landscape by making the RAN programmable, disaggregated, data-driven, and control-lable through non-real-time and near-real-time intelligent control loops. This survey reviews the evolution of IBN from SDN/NFV-enabled automation toward O-RAN-driven end-to-end intent-based networking for 5G-Advanced and 6G. We discuss architectural mechanisms, key challenges, recent advances in AI-driven and agentic IBN, and future research directions including Large Language Model (LLM)-based intent translation, contractbased O-RAN slicing, digital twin-assisted validation, and trustworthy closed-loop orchestration.
Dongwook Won, Thanh Thien-An Dang, Ton That Tam Dinh et al.· International Conference on...· 0 citations
The rapid growth of Internet of Things (IoT) ecosystems has transformed modern industrial, commercial, and operational infrastructures into highly distributed computational environments. Edge devices continuously generate large volumes of real-time data, while cloud platforms provide scalable processing, long-term analytics, and predictive intelligence capabilities. Traditional edge-to-cloud architectures are typically designed around a hierarchical data flow model in which information is collected at the edge, transmitted to centralized platforms, and processed to support operational decision-making. However, large-scale distributed IoT systems increasingly face challenges related not only to latency, scalability, and synchronization, but also to the consistency and evolution of decisions themselves. Edge systems frequently make rapid local decisions under conditions of limited visibility, while cloud systems generate more informed decisions based on broader contextual analysis. Treating these outputs as isolated and final decisions often creates inconsistencies, duplicated actions, and operational fragmentation across distributed environments. This paper introduces the concept of Decision Continuity Architecture (DCA) as a new systems abstraction for distributed edge-to-cloud environments. Within this framework, decisions are modeled not as isolated events but as evolving operational entities that progressively gain context, confidence, and refinement as they move through distributed computational layers. The study explores how decision continuity improves resilience, synchronization tolerance, predictive operations, and operational governance in real-time IoT systems. It further examines how distributed architectures can balance rapid edge responsiveness with deeper cloud intelligence without relying on rigid synchronization or centralized decision authority. By reframing distributed decision-making as a continuous and evolving process rather than a collection of disconnected outputs, this work proposes a scalable architectural model for intelligent IoT systems operating under uncertainty, partial visibility, and dynamic real-world conditions.
Ilker Kanatli· International Journal of Res...· 0 citations
An improved strict-priority Deficit Round-Robin (SP-DRR) scheduling strategy is proposed and incorporates it into a unified moment generating function (MGF) analytical framework, referred to as SP-DRR-MGF, for probabilistic E2E delay analysis in 5G–TSN networks.
Xiaohuan Zhang, Jiancheng Qin, Yiqin Lu et al.· PeerJ Computer Science· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduSep 2, 2026
What if pathology foundation models could do more with less? GigaPath-Flash and GigaTIME-Flash cut computational demands while maintaining strong performance, opening the door to larger studies and broader exploration. The post GigaPath-Flash and GigaTIME-Flash: Toward population-scale discovery with efficient pathology foundation models appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduAug 31, 2026
With millions of users across the world, Julia has been used to conduct cutting-edge research and to design new drugs, jet engines, heat pumps, and more.
MIT News · Artificial Intelligence· news.mit.eduAug 27, 2026
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.