Faten A. Saif
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Faten A. Saif has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Zurina Mohd Hanapi
Universiti Putra Malaysia
5 shared publications - Rohaya Latip
Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia (UPM), Serdang, Malaysia
4 shared publications - Oluwatosin Ahmed Amodu
Department of Communication Technology and Network, Universiti Putra Malaysia, Serdang 43400, Malaysia
3 shared publications - Shafinah Kamarudin
Universiti Putra Malaysia
3 shared publications - Chedia Jarray
Become: Technology, Science, AI & Automation Lab, 63 Tolbiac Street, 75013 Paris, France
2 shared publications - Huda Althumali
Imam Abdulrahman Bin Faisal University
2 shared publications
Latest Publications
- Open Access
A Survey of Fault and Intrusion Tolerance Approaches for Scientific Workflow Scheduling in Cloud Computing
To provide reliable services in the cloud, fault tolerance is perhaps the most important consideration. The inherent sensitivity to failure hampers cloud services’ performance and reliability. As a result, fault tolerance becomes a required characteristic to maintain reliability, which is difficult to provide due to the dynamic architecture and complex inter-dependencies. To address the issues of cloud reliability, many fault-tolerant approaches have been developed in the literature. This paper presents a recent research survey that seeks to classify the various faults and intrusion tolerance architectures. Furthermore, it provides a thorough critical analysis of existing fault and intrusion tolerance, as well as combined approaches, aimed at enhancing the dependability, availability, and execution of cloud services. The report also includes a comparison of the studied systems’ framework based on various essential criteria such as cost, makespan, reliability, security, resource utilization, energy consumption, and failure ratio. This study aims to comprehensively review this subject for researchers to draw insights from existing patterns in the literature and provide deeper perspectives into some of the challenging issues and prospects. This will enhance the development of highly resilient fault-tolerant and intrusion-resistive scheduling algorithms for current and future cloud applications.
Open AccessA Survey of Fault and Intrusion Tolerance Approaches for Scientific Workflow Scheduling in Cloud Computing
To provide reliable services in the cloud, fault tolerance is perhaps the most important consideration. The inherent sensitivity to failure hampers cloud services’ performance and reliability. As a result, fault tolerance becomes a required characteristic to maintain reliability, which is difficult to provide due to the dynamic architecture and complex inter-dependencies. To address the issues of cloud reliability, many fault-tolerant approaches have been developed in the literature. This paper presents a recent research survey that seeks to classify the various faults and intrusion tolerance architectures. Furthermore, it provides a thorough critical analysis of existing fault and intrusion tolerance, as well as combined approaches, aimed at enhancing the dependability, availability, and execution of cloud services. The report also includes a comparison of the studied systems’ framework based on various essential criteria such as cost, makespan, reliability, security, resource utilization, energy consumption, and failure ratio. This study aims to comprehensively review this subject for researchers to draw insights from existing patterns in the literature and provide deeper perspectives into some of the challenging issues and prospects. This will enhance the development of highly resilient fault-tolerant and intrusion-resistive scheduling algorithms for current and future cloud applications.
- 6 May 2026
- Published by Elsevier in Computer Science Review
- Vol. 62
Machine learning in NTN-assisted IoT with UAVs: A computation–communication–control triad
- 6 May 2026
- Published by Elsevier in Computer Science Review
- Vol. 62
Machine learning in NTN-assisted IoT with UAVs: A computation–communication–control triad
- Open Access
- 7 January 2026
- Published by Elsevier in ICT Express
- Vol. 12 (2) , 422-443
A systematic mapping and review on machine learning for non-terrestrial networks assisted Internet of Things: Enabling technologies
- 7 January 2026
- Published by Elsevier in ICT Express
- Vol. 12 (2) , 422-443
Open AccessA systematic mapping and review on machine learning for non-terrestrial networks assisted Internet of Things: Enabling technologies
- Open Access
- 30 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 159561-159578
Multi-Objectives Firefly Algorithm for Task Offloading in the Edge-Fog-Cloud Computing
This study proposes a two-stage strategy to ensure the successful execution of critical tasks. In the first stage, an Enhanced Task Offloading (ETO) algorithm is introduced to determine the appropriate computing layer—edge, fog, or cloud—for offloading incomplete tasks. The algorithm makes this decision by assessing the availability of idle computing resources relative to the task’s computational requirements. Additionally, it verifies the status of the server (on/off) before offloading; if the server is unavailable, the algorithm proceeds to check the next layer. In the second stage, the strategy employs a Multi-objective Firefly (MFA) algorithm to assign the optimal computational device within the selected layer. Experimental simulations compare the proposed strategy with a benchmark task offloading algorithm. The results demonstrate the superiority of the proposed strategy, achieving reductions in energy consumption and delay and maximizing resource utilization compared to the baseline algorithms.
- 30 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 159561-159578
Open AccessMulti-Objectives Firefly Algorithm for Task Offloading in the Edge-Fog-Cloud Computing
This study proposes a two-stage strategy to ensure the successful execution of critical tasks. In the first stage, an Enhanced Task Offloading (ETO) algorithm is introduced to determine the appropriate computing layer—edge, fog, or cloud—for offloading incomplete tasks. The algorithm makes this decision by assessing the availability of idle computing resources relative to the task’s computational requirements. Additionally, it verifies the status of the server (on/off) before offloading; if the server is unavailable, the algorithm proceeds to check the next layer. In the second stage, the strategy employs a Multi-objective Firefly (MFA) algorithm to assign the optimal computational device within the selected layer. Experimental simulations compare the proposed strategy with a benchmark task offloading algorithm. The results demonstrate the superiority of the proposed strategy, achieving reductions in energy consumption and delay and maximizing resource utilization compared to the baseline algorithms.
- Open Access
- 13 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 45393-45404
Workload Allocation Toward Energy Consumption-Delay Trade-Off in Cloud-Fog Computing Using Multi-Objective NPSO Algorithm
The Internet of Things (IoT) generates massive data from smart devices that demand responses from cloud servers. However, sending tasks to the cloud reduces the power consumed by the users’ devices, but increases the transmission delay of the tasks. In contrast, sending tasks to the fog server reduces the transmission delay due to the shorter distance between the user and the server. However, this occurs at the user end’s expense of higher energy consumption. Thus, this study proposes a mathematical framework for workload allocation to model the power consumption and delay functions for both fog and clouds. After that, a Modified Least Laxity First (MLLF) algorithm was proposed to reduce the maximum delay threshold. Furthermore, a new multi-objective approach, namely the Non-dominated Particle Swarm Optimization (NPSO), is proposed to reduce energy consumption and delay compared to the state-of-the-art algorithms. The simulation results show that NPSO outperforms the state-of-the-art algorithm in reducing energy consumption, while NGSA-II proves its effectiveness in reducing transmission delay compared to the other algorithms in the experimental simulation. In addition, the MLLF algorithm reduces the maximum delay threshold by approximately 11% compared with other related algorithms. Moreover, the results prove that metaheuristics are more appropriate for distributed computing.
- 13 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 45393-45404
Open AccessWorkload Allocation Toward Energy Consumption-Delay Trade-Off in Cloud-Fog Computing Using Multi-Objective NPSO Algorithm
The Internet of Things (IoT) generates massive data from smart devices that demand responses from cloud servers. However, sending tasks to the cloud reduces the power consumed by the users’ devices, but increases the transmission delay of the tasks. In contrast, sending tasks to the fog server reduces the transmission delay due to the shorter distance between the user and the server. However, this occurs at the user end’s expense of higher energy consumption. Thus, this study proposes a mathematical framework for workload allocation to model the power consumption and delay functions for both fog and clouds. After that, a Modified Least Laxity First (MLLF) algorithm was proposed to reduce the maximum delay threshold. Furthermore, a new multi-objective approach, namely the Non-dominated Particle Swarm Optimization (NPSO), is proposed to reduce energy consumption and delay compared to the state-of-the-art algorithms. The simulation results show that NPSO outperforms the state-of-the-art algorithm in reducing energy consumption, while NGSA-II proves its effectiveness in reducing transmission delay compared to the other algorithms in the experimental simulation. In addition, the MLLF algorithm reduces the maximum delay threshold by approximately 11% compared with other related algorithms. Moreover, the results prove that metaheuristics are more appropriate for distributed computing.
- Top Cited PapersOpen Access
- 31 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 20635-20646
Multi-Objective Grey Wolf Optimizer Algorithm for Task Scheduling in Cloud-Fog Computing
The revolution of IoT and its capabilities to serve various fields led to generating a large amount of data for processing. Tasks that require an instant response, especially with sensitive delay tasks send to the fog node due to the close distance, and the complex tasks transfer to the cloud data center for its huge computation and storage. However, sending tasks to the fog decreases the transmission delay. Still, it increases the energy consumption of the end users, while transferring tasks to the cloud reduces users’ energy consumption but increases the transmission delay due to the long distance; besides, assigning tasks to appropriate resources compatible with task requirements. These are the main challenges in cloud-fog computing that need to improve. Thus, this study proposed a Multi-Objectives Grey Wolf Optimizer (MGWO) algorithm to reduce the QoS objectives delay and energy consumption and held in the fog broker, which plays an essential role in distributing tasks. The simulation result verifies the effectiveness of the MGWO algorithm compared to the state-of-the-art algorithms in reducing delay and Energy consumption.
- 31 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 20635-20646
Top Cited PapersOpen AccessMulti-Objective Grey Wolf Optimizer Algorithm for Task Scheduling in Cloud-Fog Computing
The revolution of IoT and its capabilities to serve various fields led to generating a large amount of data for processing. Tasks that require an instant response, especially with sensitive delay tasks send to the fog node due to the close distance, and the complex tasks transfer to the cloud data center for its huge computation and storage. However, sending tasks to the fog decreases the transmission delay. Still, it increases the energy consumption of the end users, while transferring tasks to the cloud reduces users’ energy consumption but increases the transmission delay due to the long distance; besides, assigning tasks to appropriate resources compatible with task requirements. These are the main challenges in cloud-fog computing that need to improve. Thus, this study proposed a Multi-Objectives Grey Wolf Optimizer (MGWO) algorithm to reduce the QoS objectives delay and energy consumption and held in the fog broker, which plays an essential role in distributing tasks. The simulation result verifies the effectiveness of the MGWO algorithm compared to the state-of-the-art algorithms in reducing delay and Energy consumption.