Real-time trust aware scheduling in fog-cloud systems

被引:6
|
作者
Kaur, Amanjot [1 ]
Auluck, Nitin [1 ]
机构
[1] Indian Inst Technol Ropar, Dept Comp Sci & Engn, Ropar, Punjab, India
来源
关键词
cloud computing; fog computing; real-time systems; trust aware services; MULTISOURCE FEEDBACK; COMPUTING MECHANISM; MODEL; EDGE; MANAGEMENT; SIMULATION; INTERNET; TOOLKIT; SECURE; THINGS;
D O I
10.1002/cpe.7680
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Fog computing offers cloud-like facilities at the network edge, delivering reduced response times to latency sensitive applications. It comprises of fog devices/micro data centers/cloudlets located between users and the cloud data center. Fog devices are generally susceptible to privacy, security, and trust issues. We propose RT-TADS (Real Time-Trust Aware Dynamic Scheduling), a scheduling algorithm that accounts for privacy, trust and real-time performance. To compute the trustworthiness of fog devices, we propose a trust computation model. This model factors in direct and recommended trust techniques for each fog device, and updates their aggregated trust values at regular intervals. User tasks are tagged as: private, semi-private, and public. Fog devices are classified as: extremely highly trusted, highly trusted, normal trusted, low trusted, and untrusted. RT-TADS maps the input jobs according to their privacy constraints on trustworthy fog devices, which increases the overall Success Ratio, hence improving real-time performance. Using the Bitbrain dataset, the real-time performance of RT-TADS has been demonstrated, versus comparable algorithms. The results indicate that the proposed RT-TADS offers an average improvement of 13%, 45%, and 71% in task success ratio compared to RLTCM, no-trust, and cdc-only respectively.
引用
收藏
页数:25
相关论文
共 50 条
  • [1] Cost-aware cloud bursting in a fog-cloud environment with real-time workflow applications
    Stavrinides, Georgios L.
    Karatza, Helen D.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2021, 33 (23):
  • [2] Mobility and Security Aware Real-Time Task Scheduling in Fog-Cloud Computing for IoT Devices: A Fuzzy-Logic Approach
    Ali, Hala S.
    Sridevi, R.
    COMPUTER JOURNAL, 2024, 67 (02): : 782 - 805
  • [3] Analyzing the Behavior of Real-Time Tasks in Fog-Cloud Architecture
    Yadav, Pratibha
    Vidyarthi, Deo Prakash
    ADVANCED NETWORK TECHNOLOGIES AND INTELLIGENT COMPUTING, ANTIC 2021, 2022, 1534 : 229 - 239
  • [4] A fault-tolerant aware scheduling method for fog-cloud environments
    Alarifi, Abdulaziz
    Abdelsamie, Fathi
    Amoon, Mohammed
    PLOS ONE, 2019, 14 (10):
  • [5] Real-Time Task Scheduling in Fog-Cloud Computing Framework for IoT Applications: A Fuzzy Logic based Approach
    Ali, Hala S.
    Rout, Rashmi Ranjan
    Parimi, Priyanka
    Das, Sajal K.
    2021 INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS & NETWORKS (COMSNETS), 2021, : 556 - 564
  • [6] Scheduling Real-Time Security Aware Tasks in Fog Networks
    Singh, Anil
    Auluck, Nitin
    Rana, Omer
    Jones, Andrew
    Nepal, Surya
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2021, 14 (06) : 1981 - 1994
  • [7] Cloud vs Fog Computing - Scheduling Real-Time Applications
    Karatza, Helen
    2020 9TH MEDITERRANEAN CONFERENCE ON EMBEDDED COMPUTING (MECO), 2020, : 2 - 2
  • [8] Decentralized and scalable hybrid scheduling-clustering method for real-time applications in volatile and dynamic Fog-Cloud Environments
    Masoumeh Hajvali
    Sahar Adabi
    Ali Rezaee
    Mehdi Hosseinzadeh
    Journal of Cloud Computing, 12
  • [9] Decentralized and scalable hybrid scheduling-clustering method for real-time applications in volatile and dynamic Fog-Cloud Environments
    Hajvali, Masoumeh
    Adabi, Sahar
    Rezaee, Ali
    Hosseinzadeh, Mehdi
    JOURNAL OF CLOUD COMPUTING-ADVANCES SYSTEMS AND APPLICATIONS, 2023, 12 (01):
  • [10] A Framework of Real-Time Intelligent Transportation System Based on Hybrid Fog-Cloud Computing
    Lin, Deyu
    Yan, Ming
    Kong, Linghe
    Quan, Ruoxuan
    Guan, Yong Liang
    IEEE COMMUNICATIONS MAGAZINE, 2024, 62 (01) : 126 - 132