Coordinated service offloading is essential to meet Quality-of-Service (QoS) targets under non-stationary edge traffic. Yet conventional schedulers lack dynamic prioritization, causing deadline violations for delay-sensitive, lower-priority flows. We present PRONTO, a multi-agent framework with centralized training and decentralized execution (CTDE) that jointly optimizes SLA-aware offloading and adaptive service orchestration. PRONTO builds on Twin Delayed Deep Deterministic Policy Gradient (TD3) and incorporates spatiotemporal, topology-aware graph attention with top-K masking and temperature scaling to encode neighborhood influence at linear coordination cost. Gated Recurrent Units (GRUs) filter temporal features, while a hybrid reward couples task urgency, SLA satisfaction, and utilization costs. A priority-aware slicing policy divides bandwidth and compute between latency-critical and throughput-oriented flows. To improve robustness, we employ stability regularizers (temporal smoothing and confidence-weighted neighbor alignment), mitigating action jitter under bursts. Extensive evaluations show superior QoS and channel utilization, with up to 27.4% lower service delay and over 18% higher SLA Satisfaction Rate (SSR) compared with strong baselines.

The dense deployment of small cell networks is a key feature of next-generation mobile networks aimed at providing the necessary capacity increase. It is noteworthy that small cell networks employ high-capacity backhaul links on millimeter-wave bands to develop multi-hop topologies in order to mitigate data transmission costs. The current static backhaul infrastructures cannot control severe fluctuating network traffic. To resolve this problem, this paper proposed a novel adaptive backhaul topology with the ability to adapt to different traffic patterns. Based on the graph theory, the adaptive system dynamically allows changes to the hybrid millimeter-wave backhaul architecture, and it also provides the possibility of effective channel allocation to each backhaul link to meet capacity and QoS demands. Also, regarding the importance of green networking in integrated-access-and-backhaul networks we proposed a dynamic optimization model which minimizes the overall energy consumption of UL/DL Decoupled NOMA heterogeneous networks in addition to providing the essential coverage and capacity. The proposed model optimizes user association/power utilization and presents an effective modular and scalable framework for analytical technology-oriented modeling of integrated multi-hop backhauls. The numerical results proved that the joint power optimization and hybrid backhaul architecture can increase the total network throughput by 18 percent compared to the current optimized static architectures. It can also reduce the energy consumption level by 30 percent, and enhance users’ quality satisfaction by 24.5 percent with respect to user distribution patterns.

Mobile Edge Computing (MEC) is a viable solution in response to the growing demand for broadband services in the new-generation heterogeneous systems. The dense deployment of small cell networks is a key feature of next-generation radio access networks aimed at providing the necessary capacity increase. Nonetheless, the problem of green networking and service computing will be of great importance in the downlink, because the uncontrolled installation of too many small cells may increase operational costs and emit more carbon dioxide. In addition, given the resource and computational limitation of the user layer, energy efficiency (EE) and fairness assurance are critical issues in MEC-based cellular systems. Considering the user fairness criteria, this paper proposes a dynamic optimization model which maximizes the total UL/DL EE along with satisfying the necessary QoS constraints. Based on the non-convex characteristics of the EE maximization problem, the mathematical model can be divided into two separate subproblems, i.e., computational carrier scheduling and resource allocation. So that, a subgradient method is applied for the computational resource allocation and also successive convex approximation (SCA) and dual decomposition methods are adopted to solve the max-min fairness problem. The simulation results exhibit considerable EE improvement for various traffic models in addition to guaranteeing the fairness requirements. It also proved that the proposed computational partitioning scheme managed to significantly improve the total throughput for mobile computing services.