QoE-Oriented Dependent Task Scheduling Under Multi-Dimensional QoS Constraints Over Distributed Networks

被引:0
|
作者
Fan, Xuwei [1 ]
Cheng, Zhipeng [2 ]
Chen, Ning [1 ]
Huang, Lianfen [1 ]
Wang, Xianbin [3 ]
机构
[1] Xiamen Univ, Dept Informat & Commun Engn, Xiamen 361005, Peoples R China
[2] Soochow Univ, Sch Future Sci & Engn, Suzhou 215006, Peoples R China
[3] Western Univ, Dept Elect & Comp Engn, London, ON N6A 5B9, Canada
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2025年 / 22卷 / 01期
基金
中国国家自然科学基金;
关键词
Quality of service; Quality of experience; Processor scheduling; Scheduling; Computational modeling; Sensitivity; Complexity theory; Numerical models; Performance evaluation; Heuristic algorithms; Task scheduling; QoE; task priority; dependent tasks; multi-dimensional QoS; RESOURCE-ALLOCATION; AWARE; PLACEMENT;
D O I
10.1109/TNSM.2024.3491432
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Task scheduling as an effective strategy can improve application performance on computing resource-limited devices over distributed networks. However, existing evaluation mechanisms for application completion fail to depict the complexity of diverse applications and time-varying networks, which involve dependencies among tasks, computing resource requirements, multi-dimensional quality of service (QoS) constraints, and limited contact duration among devices. Furthermore, traditional QoS-oriented task scheduling strategies struggle to meet the performance requirements without considering differences in satisfaction and acceptance of the application, leading to application failures and resource wastage. To tackle these issues, a quality of experience (QoE) cost model is designed to evaluate application completion, depicting the relationship among application satisfaction, communications, and computing resources over the time-varying distributed networks. Specifically, considering the sensitivity and preference of QoS, we model the different dimensional QoS degradation cost functions for dependent tasks, which are then integrated into the QoE cost model. Based on the QoE model, the dependent task scheduling problem is formulated as the minimization of overall QoE cost, aiming to improve the application performance over the time-varying distributed networks, which is proven Np-hard. Moreover, a heuristic Hierarchical Multi-queue Task Scheduling (HMTS) algorithm is proposed to address the QoE-oriented task scheduling problem among multiple dependent tasks, which utilizes hierarchical multiple queues to determine the optimal task execution order and location according to different dimensional QoS priorities. Finally, extensive experiments demonstrate that the proposed algorithm can significantly improve the satisfaction of applications.
引用
收藏
页码:516 / 531
页数:16
相关论文
共 5 条
  • [1] Adaptive multi-dimensional QoS-based packet scheduling scheme for multimedia broadcasting over geostationary satellite networks
    Du, Hongfei
    Fan, Linghang
    Evans, Barry G.
    GLOBECOM 2007: 2007 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-11, 2007, : 4613 - 4618
  • [2] Scheduling Framework and Algorithms for Large-Scale Divisible Load Processing with Multi-Dimensional QoS Constraints
    Wang, Kaibo
    Zhou, Xingshe
    Zhou, Shandan
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 2032 - 2037
  • [3] Joint scheduling and power allocation in multi-channel access point networks under QoS constraints
    Luo, Xiang
    Kar, Koushik
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 2915 - 2920
  • [4] Distributed Task Processing Platform for Infrastructure-Less IoT Networks: A Multi-Dimensional Optimization Approach
    Zheng, Qiushi
    Jin, Jiong
    Shen, Zhishu
    Wu, Libing
    Ahmad, Iftekhar
    Xiang, Yong
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2024, 35 (12) : 2392 - 2404
  • [5] Distributed State Estimation under State Inequality Constraints with Random Communication over Multi-Agent Networks
    Hu, Chen
    Li, Zhenhua
    Lin, Haoshen
    He, Bing
    Liu, Gang
    INFORMATION, 2018, 9 (03)