Zulfiqar Ali Khan

Mr. Zulfiqar Ali Khan

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 December 2023 in IEEE Access
Verified
Journal Article
Open access
ZKZulfiqar Ali Khan
Zulfiqar Ali Khan
IAIzzatdin Abdul Aziz
Izzatdin Abdul Aziz
NONurul Aida Bt Osman
Nurul Aida Bt Osman
IUIsrar Ullah
Israr Ullah
Efficient task scheduling on the cloud is critical for optimal utilization of resources in data centers. It became even more challenging with the emergence of 5G and IoT applications that generate massive number of tasks with stringent latency requirements. This gives birth to fog/edge computing - a complementary layer to cloud. Tasks latency in fog computing can be reduced as processing in the network is done closer to the end devices and users, but every task cannot be scheduled in the fog due to limited resources availability. Conventional scheduling algorithms often fail to exploit the heterogeneous resources; therefore, specially designed and well-tuned scheduling algorithms are desired for achieving better quality of service. In this study, the state-of-the-art task scheduling algorithms in the cloud and fog environments are investigated in a diverse set of dimensions. Among the relevant studies published between 2018-2022 and indexed in the Web-of-Science (WOS), SCOPUS, and Google Scholar databases, eighteen studies are selected for both the cloud and fog domains from WOS and Scopus, while seventeen studies are chosen for both the cloud and fog domains from Google Scholar. Thus, a total of 106 studies are included in this survey for the detail investigation. The scheduling algorithms are broadly classified into three categories such as heuristic, meta-heuristic, and hybrid meta-heuristic followed by detailed critical analysis. It has been observed that most of the scheduling algorithms are dynamic and non-preemptive in nature, while the higher fraction of the tasks is independent in comparison to bag of tasks andworkflows. Similarly, 97% of the studies focus on multiple objectives and 68% of the techniques are non-deterministic. Further, a total of twenty different scheduling objectives are identified with makespan, resource utilization, delay, load balancing, and energy consumption as the most significant metrics. The evaluation methods including simulations (51%), real experiments (4%), analytical equations (2%), and datasets (43%) etc. are surveyed. At the end, the open issues, challenges, and future directions are argued.

9 February 2024 in IEEE Access
Verified
Journal Article
Open access
ZKZulfiqar Ali Khan
Zulfiqar Ali Khan
IAIzzatdin Abdul Aziz
Izzatdin Abdul Aziz
NONurul Aida Bt Osman
Nurul Aida Bt Osman
SNSaid Nabi
Said Nabi
Cloud computing has been imperative for computing systems worldwide since its inception. The researchers strive to leverage the efficient utilization of cloud resources to execute workload quickly in addition to providing better quality of service. Among several challenges on the cloud, task scheduling is one of the fundamental NP-hard problems. Meta-heuristic algorithms are extensively employed to solve task scheduling as a discrete optimization problem and therefore several meta-heuristic algorithms have been developed. However, they have their own strengths and weaknesses. Local optima, poor convergence, high execution time, and scalability are the predominant issues among meta-heuristic algorithms. In this paper, a parallel enhanced whale optimization algorithm is proposed to schedule independent tasks in the cloud with heterogeneous resources. The proposed algorithm improves solution diversity and avoids local optima using a modified encircling maneuver and an adaptive bubble net attacking mechanism. The parallelization technique keeps the execution time low despite its internal complexity. The proposed algorithm minimizes the makespan while improving resource utilization and throughput. It demonstrates the effectiveness of the proposed PEWOA against the best performing enhanced whale optimization algorithm (WOAmM) and Multi-core Random Matrix Particle Swarm Optimization (MRMPSO). The algorithm consistently produces better results with varying number of tasks on GoCJ dataset, indicating better scalability. The experiments are conducted in CloudSim utilizing a variety of GoCJ and HCSP instances. Various statistical tests are also conducted to evaluate the significance of the results.

8 May 2024 in IEEE Access
Verified
Journal Article
Open access
ZKZulfiqar Ali Khan
Zulfiqar Ali Khan
IAIzzatdin Abdul Aziz
Izzatdin Abdul Aziz
Due to the revolution of Internet of Things (IoT), the amount of data generation has been redoubling, leading to higher latency and network traffic. This has resulted in delays in services and increased energy consumption of cloud servers. Fog computing tackles the issues associated with long geographical distance between end-users and cloud servers by extending service provision closer to the network edge, reducing latency and makespan, and optimizing energy consumption during workload execution. Instead of offloading all tasks to the cloud, delay-sensitive tasks are executed at fog nodes, while others are offloaded to the cloud. However, the resources at the fog layer are limited, posing a challenge for task scheduling in fog computing, particularly as a multi-objective optimization problem. Meta-heuristic algorithms have been potent to find an optimal solution for such problems within a reasonable amount of time. The Whale Optimization Algorithm (WOA) is a relatively new meta-heuristic algorithm that has received significant attention from researchers due to its impressive optimization characteristics. However, being an exploitation-oriented technique, it falls into local optima due to a lack of generating new solutions over time. Limited exploration capabilities also compromise the diversity of the solution space and prolong convergence time. Therefore, in this study, an enhanced Ripple-induced Whale Optimization Algorithm (RWOA) is proposed, utilizing ripple effects to schedule independent tasks in fog computing. It aims to minimize makespan and energy consumption while maximizing throughput in a fog-cloud infrastructure by improving poor solutions through substantial changes. Extensive simulations are performed to assess the effectiveness of the proposed algorithm. The proposed RWOA outperformed TCaS, HFSGA, MGWO, and WOAmM on two workload datasets: Random and NASA Ames iPSC. The statistical significance of the results is validated by the Friedman test and Wilcoxon Signed-rank test.

18 March 2025 in High-Confidence Computing
Verified
Journal Article
Open access
ZKZulfiqar Ali Khan
Zulfiqar Ali Khan
IAIzzatdin Abdul Aziz
Izzatdin Abdul Aziz

16 June 2020 in Electronics
Verified
Journal Article
Open access
PDF file
ZKZulfiqar Ali Khan
Zulfiqar Ali Khan
IUIsrar Ullah
Israr Ullah
MIMuhammad Ibrahim
Muhammad Ibrahim
MFMuhammad Fayaz
Muhammad Fayaz
AAAyman ALJARBOUH
Ayman ALJARBOUH
MQMuhammad Shuaib Qureshi
Muhammad Shuaib Qureshi
Internet of Things (IoT) is getting more popular day by day, which triggers its adoption for solving domain specific problems. Cities are becoming smart by gathering the context knowledge through sensors and controlling specific parameters through actuators. Dynamically discovering and integrating different data streams from different sensors is a major challenge these days. In this paper, a service matchmaking algorithm is presented for service discovery utilizing IoT devices and services in a particular geographic area. It helps us to identify services based on a variety of parameters (location, query size and processing time, etc.). Customization of service selection and discovery are also explored. The conceptual framework is provided for the proposed model along with a matchmaking algorithm based on IoT devices virtualization. The simulation results elaborate the increased complexity of processing time with respect to the increasing pool of available services. The average processing time varies as the number of conditions are multiplied. Query size and complexity increases with additional number of filters and conditions which results in the reduction of the number of matching services. Moreover, upon decreasing the radius of geographic search area, the number of candidate services decreases for service matching algorithm. This is based on the assumption that IoT devices and services are evenly distributed in a given geographic area. Similarly, the remaining energy of IoT devices is also assumed to be uniformly distributed and, therefore, if we are interested in IoT devices or services with more residual energy, then a limited number of IoT devices or services will fulfill this criterion.

6 January 2022
Verified
Book Chapter
Closed access
PDF file
ZKZulfiqar Ali Khan
Zulfiqar Ali Khan
This paper concentrates on the Wolfe and Mond-Weir type duals for a class of differentiable multiobjective programming problems. Appropriate weak and strong duality theorems for invex and quasi-invex functions,by considering a sequence of equivalent single objective programming problems, are established for efficient solutions.