Nov 2026· IEEE Transactions on Mobile Computing· Vol 25, pp. 19015-19031· 1 citation· 51 references
Abstract
Multi-access edge computing (MEC) enables low-latency computing services, yet third-party resource providers integrated into MEC systems may oversell their computing capacity, severely degrading task scheduling performance. To address this, we propose an overselling-aware task scheduling scheme with deep reinforcement learning (DRL) for delay-sensitive tasks in overselling environments, aiming to maximize system profit and improve on-time task completion. The proposed scheme incorporates an Overselling Awareness capability that enables the scheduler to be aware of servers’ overselling behaviors and estimate their actual computing power, thereby mitigating overselling effects on scheduling decisions. Furthermore, to handle dynamic variations in task and server quantities, we design a novel policy network architecture, Chimera, for the DRL agent in place of conventional policy networks. Chimera integrates weight sharing, pooling, and attention mechanisms to produce scheduling decisions under variable input lengths without altering its parameter size or network structure. Experimental results demonstrate that the proposed scheme achieves approximately 58.14-60.72% higher system profits and 74.30-84.70% better on-time completion rates compared to baseline methods in overselling environments.
Cloud computing (CC) and mobile edge computing (MEC) has become essential for augmenting computational capacity and minimizing latency by offloading tasks from user equipments (UEs) to servers. While deep reinforcement learning (DRL) is a powerful tool for optimizing offloading decisions and managing resource allocatio...
Yu-Hui Wang, Xing-Qi Wu, Junaid Farooq et al.· IEEE International Symposium...· 0 citations
Timely and cost-efficient data transfers in large-scale networks remain challenging due to diverse topologies, non-uniform pricing models, and variable traffic demands. Existing literature often relies on multi-objective optimization, employing heuristic methods to reduce computational complexity; however, these approa...
Bita Fatemipour, Zhe Zhang, Marc St-Hilaire· IEEE Transactions on Network...· 0 citations
HRL-TaskOpt is presented, a novel Hierarchical Reinforcement Learning-based task scheduling framework that combines high-level global task offloading with millisecond-granularity local scheduling policies in an edge–cloud scenario and offers a scalable and intelligent solution for adaptive task scheduling.
Krishna Patwari, Raghvendra Kumar, J. Sastry· International Journal of Ele...· 0 citations
Computing power networks (CPNs) have emerged as a promising paradigm for supporting delay-sensitive and freshness-critical IoT services in the 6G era by jointly orchestrating heterogeneous networking and computing resources. However, existing scheduling schemes mainly focus on offloading decisions and computation-node...
Wen-Tao Liu, Si-Qi Chen, Yun-Cai Cheng· International Symposium on W...· 0 citations
An SS-DDPG-based task scheduling framework for a collaborative robot-UAV-MEC architecture that achieves lower service delay, better workload distribution, and stronger robustness than conventional reinforcement-learning-based scheduling approaches is presented.
—Mobile Edge Computing (MEC) is a technology that enables mobile devices to transfer computationally demanding tasks to nearby servers. MEC significantly lowers the local processing load by allowing a variety of complicated mobile devices tasks to be transferred to the network system’s edge so that they can be executed...
S. Dash, Jibitesh Mishra, S. Dash et al.· Journal of Advances in Infor...· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comOct 21, 2026
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 8, 2026