Anjali Agarwal

Anjali Agarwal

Auto-generated profile, based on publicly available information

Anjali Agarwal

Department of Electrical and Computer Engineering, Concordia University, Montreal, QC, Canada

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
28 July 2021 in IEEE Access
Verified
Journal Article
Open access
YAYanal Alahmad
Yanal Alahmad
TDTariq Daradkeh
Tariq Daradkeh
AAAnjali Agarwal
Anjali Agarwal
Cloud computing is a widely adopted platform for executing tasks of different application types that belong to the end users. In the cloud, application task is prone to failure for several reasons, such as software bug or exception, virtual or physical infrastructure failure. Cloud service providers are responsible for managing availability of scheduled computing tasks in order to provide high level QoS for their customers. Protecting task against failure is a challenging and not a trivial mission due to dynamic, heterogeneous and large distributed structure of the cloud environment. The existing works in the literature focus on task failure prediction and neglect the remedy (post) actions. In this work, we first study and analyze three publicly available large cluster datasets from Google, Alibaba, and Trinity, to characterize task failure in cloud computing platform. We then propose a failure-aware task scheduling framework that can predict the termination status for a set of given tasks during the runtime, and take the appropriate remedy actions. The framework uses deep learning methods named Artificial and Convolutional Neural Network, ANN and CNN, for different prediction purposes. In addition, we formalize the actions selection problem as Integer Linear Programming (ILP) model and propose a heuristic optimization solution that aims to minimize the failure probability of tasks and their resources usage. The results show ANN and CNN can achieve prediction accuracy of up to 94% and 92%, respectively using Google dataset. Moreover, the framework can protect up to 40% of tasks that are predicted as failed using Alibaba dataset by taking the appropriate remedy actions, and hence save many of cluster’s resources such as CPU and RAM.

25 October 2018 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
FAFadi Alzhouri
Fadi Alzhouri
AAAnjali Agarwal
Anjali Agarwal
YLYan Liu
Yan Liu
The Infrastructure as a Service (IaaS) cloud industry that relies on leasing virtual machines (VMs) has significant portion of business values of finding the dynamic equilibrium between two conflicting phenomena: underutilization and surging congestion. Spot instance has been proposed as an elegant solution to overcome these challenges, with the ultimate goal to achieve greater profits. However, previous studies on recent spot pricing schemes reveal artificial pricing policies that do not comply with the dynamic nature of these phenomena. Motivated by these facts, this paper investigates dynamic pricing of stagnant resources in order to maximize cloud revenue. Specifically, our proposed approach manages multiple classes of virtual machines in order to achieve the maximum expected revenue within a finite discrete time horizon. For this sake, the proposed approach leverages the Markov decision processes with a number of properties under optimum controlling conditions that characterize a model's behaviour. Further, this approach applies approximate stochastic dynamic programming using linear programming to create a practical model. Experimental results confirm that this approach of dynamic pricing can scale up or down the price efficiently and effectively, according to the stagnant resources and the load thresholds. These results provide significant insights to maximizing the IaaS cloud revenue.

8 April 2024 in IEEE Access
Verified
Journal Article
Open access
MAMohammad A. Altahat
Mohammad A. Altahat
TDTariq Daradkeh
Tariq Daradkeh
AAAnjali Agarwal
Anjali Agarwal
Containers are recognized for their lightweight and virtualization efficiency, making them a vital element in modern application orchestration. In this context, the scheduler is crucial in strategically distributing containers across diverse computing nodes. This paper presents a novel two-stage container scheduling solution that addresses node imbalances and efficiently deploys containers. The proposed solution formulates the scheduling process as an optimization problem, integrating various objective functions and constraints to enhance server consolidation and minimize energy consumption. The confidentiality of migrated containers is ensured through encryption, and the associated costs are incorporated into the optimization constraints. This approach ensures security in container scheduling, considering container attributes as input features in our proposed attributes-based encryption model. By carefully selecting containers and destination nodes, this work seeks to establish balance within cloud-based clusters. This contributes to the improvement of container orchestration systems and their effectiveness in real-world scenarios. The proposed solution’s efficacy is demonstrated in its ability to efficiently deploy containers in multi-data center cloud environments and seamlessly migrate them between hosts within the same data center or across different data centers. Our results show optimal consolidation with a reduction in the number of running hosts, ranging from 4% to over 18%. Additionally, the solution promotes minimal total power consumption with savings ranging from 3.5 to 16.25 megawatts, while also ensuring balanced server loads.

1 November 2009
Verified
Conference Paper
Closed access
AAAhed Alshanyour
Ahed Alshanyour
AAAnjali Agarwal
Anjali Agarwal
This paper introduces an accurate analysis using three dimensional Markov chain modeling to compute the IEEE 802.11 DCF performance under heavy traffic conditions and absence of hidden terminals. The proposed model matches the real implementation of the DCF as presented in the standard through considering the impact of retry limits of control and data frames jointly on the performance of DCF mechanism. Moreover, transmission errors are added to the model as constant frame error probabilities. In addition to the throughout efficiency, this analytical analysis calculates the average packet delay, the packet drop probability and the average packet drop time for the DCF access modes, basic and RTS/CTS. We show that our proposed model is a more general model compared to the other models that are presented in the literature, which leads to more accurate performance analysis. Simulation results validate the accuracy of our analytical analysis. Moreover, we prove the generality and validate the correctness of our analysis by showing that other models appeared in literature are special cases from our proposed model. Moreover, the impact of the retry limits and the network size on the performance of IEEE 802.11 DCF is presented.

1 January 2006
Verified
Conference Paper
Closed access
DMDev Shankar Mukherjee
Dev Shankar Mukherjee
CAChadi Assi
Chadi Assi
AAAnjali Agarwal
Anjali Agarwal
We propose a two-step method to enhance the dual-failure restorability in p-cycle protected mesh networks that are optimally designed to withstand only single failures. Our two-step method relies on finding alternate routes to repair the non functional p-cycles upon the first failure and protect the exposed spans. We then compare our proposed method with the cycle reconfiguration method proposed in [9] in which the spare capacity is reconfigured dynamically (either incrementally or completely) after the first failure. We find out the additional spare capacity required for dual failure restorability as compared to single failure restorability for our proposed method as well as the incremental and complete cycle reconfiguration methods. We conclude our findings based on our results and discuss the advantages and disadvantages of each of these methods.

16 March 2024 in Simulation Modelling Practice and Theory
Verified
Journal Article
Open access
MDMustafa Daraghmeh
Mustafa Daraghmeh
AAAnjali Agarwal
Anjali Agarwal
YJYaser Jararweh
Yaser Jararweh