Abubakr O. Al-Abbasi
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
Abubakr O. Al-Abbasi has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Vaneet Aggarwal
Purdue University, West Lafayette, Indiana, USA
9 shared publications Naofal Al-Dhahir
Electrical and Computer Engineering Department, The University of Texas at Dallas, Richardson, TX, USA
6 shared publicationsVaneet Aggarwal
Purdue University, USA
5 shared publicationsRidha Hamila
4 shared publications- Ridha Hamila
Department of Electrical Engineering, College of Engineering, Qatar University, Doha, Qatar
4 shared publications Waheed U. Bajwa
Rutgers University, Piscataway, NJ
4 shared publications
Latest Publications
- 1 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 15 (2) , 1118-1129
Joint Information Freshness and Completion Time Optimization for Vehicular Networks
- 1 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 15 (2) , 1118-1129
Joint Information Freshness and Completion Time Optimization for Vehicular Networks
- 15 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 9 (2) , 622-633
A Unified Framework for Differentiated Services in Intelligent Healthcare Systems
The Coronavirus disease 2019 (COVID-19) outbreak continues to significantly expose the vulnerabilities of healthcare systems around the world. These unprecedented circumstances create an opportunity for improving healthcare services which is desperately needed. This paper proposes a novel framework that distributes the patients across heterogeneous medical facilities (MFs) so that a weighted sum of the expected service time (EST) and service time tail probability (STTP) for all patients is minimized. We propose a model-based and model-free algorithms to schedule patients requests across the MFs. Our algorithms prioritize the patients with severe/critical conditions over others who can tolerate more delay in service. Based on the model-based approach, we formulate an optimization problem as a convex combination of both EST and STTP metrics, and apply an efficient iterative algorithm to solve it. Then, a more practical model-free scheme is proposed by adopting a deep reinforcement learning approach. Our model-free approach does not rely on pre-defined models or assumptions about the environment. Rather, it learns to choose scheduling decisions solely through observations of the resulting performance of past decisions. Our extensive results demonstrate a significant performance improvement of our proposed scheduling schemes when compared with other algorithms and competitive baselines.
- 15 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 9 (2) , 622-633
A Unified Framework for Differentiated Services in Intelligent Healthcare Systems
The Coronavirus disease 2019 (COVID-19) outbreak continues to significantly expose the vulnerabilities of healthcare systems around the world. These unprecedented circumstances create an opportunity for improving healthcare services which is desperately needed. This paper proposes a novel framework that distributes the patients across heterogeneous medical facilities (MFs) so that a weighted sum of the expected service time (EST) and service time tail probability (STTP) for all patients is minimized. We propose a model-based and model-free algorithms to schedule patients requests across the MFs. Our algorithms prioritize the patients with severe/critical conditions over others who can tolerate more delay in service. Based on the model-based approach, we formulate an optimization problem as a convex combination of both EST and STTP metrics, and apply an efficient iterative algorithm to solve it. Then, a more practical model-free scheme is proposed by adopting a deep reinforcement learning approach. Our model-free approach does not rely on pre-defined models or assumptions about the environment. Rather, it learns to choose scheduling decisions solely through observations of the resulting performance of past decisions. Our extensive results demonstrate a significant performance improvement of our proposed scheduling schemes when compared with other algorithms and competitive baselines.
- 8 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (7) , 8595-8605
A Distributed Model-Free Algorithm for Multi-Hop Ride-Sharing Using Deep Reinforcement Learning
The growth of autonomous vehicles, ridesharing systems, and self-driving technology will bring a shift in the way ride hailing platforms plan out their services. However, these advances in technology coupled with road congestion, environmental concerns, fuel usage, vehicles emissions, and the high cost of the vehicle usage have brought more attention to better utilize the use of vehicles and their capacities. In this paper, we propose a novel distributed multi-hop ride-sharing (MHRS) algorithm that uses deep reinforcement learning to learn optimal vehicle dispatch and matching decisions by interacting with the external environment. By allowing customers to transfer between vehicles, i.e., ride with one vehicle for some time and then transfer to another one, MHRS helps in attaining 30% lower cost and 20% more efficient utilization of fleets, as compared to the ride-sharing algorithms. This flexibility of multi-hop feature gives a seamless experience to customers and ride-sharing companies, and thus improves ride-sharing services.
- 8 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (7) , 8595-8605
A Distributed Model-Free Algorithm for Multi-Hop Ride-Sharing Using Deep Reinforcement Learning
The growth of autonomous vehicles, ridesharing systems, and self-driving technology will bring a shift in the way ride hailing platforms plan out their services. However, these advances in technology coupled with road congestion, environmental concerns, fuel usage, vehicles emissions, and the high cost of the vehicle usage have brought more attention to better utilize the use of vehicles and their capacities. In this paper, we propose a novel distributed multi-hop ride-sharing (MHRS) algorithm that uses deep reinforcement learning to learn optimal vehicle dispatch and matching decisions by interacting with the external environment. By allowing customers to transfer between vehicles, i.e., ride with one vehicle for some time and then transfer to another one, MHRS helps in attaining 30% lower cost and 20% more efficient utilization of fleets, as compared to the ride-sharing algorithms. This flexibility of multi-hop feature gives a seamless experience to customers and ride-sharing companies, and thus improves ride-sharing services.
- Open Access
- 31 December 2020
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Performance Evaluation of Computing Systems
- Vol. 5 (4) , 1-32
VidCloud
As video-streaming services have expanded and improved, cloud-based video has evolved into a necessary feature of any successful business for reaching internal and external audiences. In this article, video streaming over distributed storage is considered where the video segments are encoded using an erasure code for better reliability. We consider a representative system architecture for a realistic (typical) content delivery network (CDN). Given multiple parallel streams/link between each server and the edge router, we need to determine, for each client request, the subset of servers to stream the video, as well as one of the parallel streams from each chosen server. To have this scheduling, this article proposes a two-stage probabilistic scheduling. The selection of video quality is also chosen with a certain probability distribution that is optimized in our algorithm. With these parameters, the playback time of video segments is determined by characterizing the download time of each coded chunk for each video segment. Using the playback times, a bound on the moment generating function of the stall duration is used to bound the mean stall duration. Based on this, we formulate an optimization problem to jointly optimize the convex combination of mean stall duration and average video quality for all requests, where the two-stage probabilistic scheduling, video quality selection, bandwidth split among parallel streams, and auxiliary bound parameters can be chosen. This non-convex problem is solved using an efficient iterative algorithm. Based on the offline version of our proposed algorithm, an online policy is developed where servers selection, quality, bandwidth split, and parallel streams are selected in an online manner. Experimental results show significant improvement in QoE metrics for cloud-based video as compared to the considered baselines.
- 31 December 2020
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Performance Evaluation of Computing Systems
- Vol. 5 (4) , 1-32
Open AccessVidCloud
As video-streaming services have expanded and improved, cloud-based video has evolved into a necessary feature of any successful business for reaching internal and external audiences. In this article, video streaming over distributed storage is considered where the video segments are encoded using an erasure code for better reliability. We consider a representative system architecture for a realistic (typical) content delivery network (CDN). Given multiple parallel streams/link between each server and the edge router, we need to determine, for each client request, the subset of servers to stream the video, as well as one of the parallel streams from each chosen server. To have this scheduling, this article proposes a two-stage probabilistic scheduling. The selection of video quality is also chosen with a certain probability distribution that is optimized in our algorithm. With these parameters, the playback time of video segments is determined by characterizing the download time of each coded chunk for each video segment. Using the playback times, a bound on the moment generating function of the stall duration is used to bound the mean stall duration. Based on this, we formulate an optimization problem to jointly optimize the convex combination of mean stall duration and average video quality for all requests, where the two-stage probabilistic scheduling, video quality selection, bandwidth split among parallel streams, and auxiliary bound parameters can be chosen. This non-convex problem is solved using an efficient iterative algorithm. Based on the offline version of our proposed algorithm, an online policy is developed where servers selection, quality, bandwidth split, and parallel streams are selected in an online manner. Experimental results show significant improvement in QoE metrics for cloud-based video as compared to the considered baselines.
- 7 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (2) , 387-391
A Novel OFDM Waveform With Enhanced Physical Layer Security
This paper proposes a secure orthogonal frequency division multiplexing (OFDM) waveform based on two physical-layer secrecy enhancing methods. The first method is time-domain pre-coding that involves interleaving and scaling based on a key shared between two legitimate parties adopting the OFDM waveform. The second method is a random change of the cyclic prefix (CP) size resulting in the randomization of the OFDM symbol time. The CP size is also changed based on a key agreed upon between the legitimate parties. The proposed methods not only increase the detection complexity at the eavesdropping node, but also suppress any cyclic features that distinguish OFDM waveforms. The evaluation of the proposed methods is carried out by deriving a closed-form expression for the ergodic secrecy rate of the system. Then, the effect of pre-coding on the quality-of-service performance is analyzed. The proposed methods achieve a considerable secrecy performance gain when proper equalization is implemented at the legitimate receiver.
- 7 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (2) , 387-391
A Novel OFDM Waveform With Enhanced Physical Layer Security
This paper proposes a secure orthogonal frequency division multiplexing (OFDM) waveform based on two physical-layer secrecy enhancing methods. The first method is time-domain pre-coding that involves interleaving and scaling based on a key shared between two legitimate parties adopting the OFDM waveform. The second method is a random change of the cyclic prefix (CP) size resulting in the randomization of the OFDM symbol time. The CP size is also changed based on a key agreed upon between the legitimate parties. The proposed methods not only increase the detection complexity at the eavesdropping node, but also suppress any cyclic features that distinguish OFDM waveforms. The evaluation of the proposed methods is carried out by deriving a closed-form expression for the ergodic secrecy rate of the system. Then, the effect of pre-coding on the quality-of-service performance is analyzed. The proposed methods achieve a considerable secrecy performance gain when proper equalization is implemented at the legitimate receiver.
- 4 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 17 (3) , 1582-1596
TTLCache: Taming Latency in Erasure-Coded Storage Through TTL Caching
Distributed storage systems are known to be susceptible to long response time, and higher latency leads to a reduction in customers satisfaction. An elegant solution to reduce latency in such systems is through two methods -having redundancy in contents at the storage nodes, and adding a cache close to end-users. Redundancy could be added using an erasure code because of its high resiliency with low storage overhead. It is important to quantify the performance of distributed storage systems in the presence of redundancy and caching, which is the focus of this work. This paper proposes a framework for quantifying and jointly optimizing mean and tail latency in erasure-coded storage systems with edge-caching capabilities. A novel caching policy for caching contents in erasure-coded storage systems, called time-to-live (TTLCache), is proposed. Using TTLCache policy and probabilistic server-selection techniques, bounds for mean latency and latency tail probability (LTP) are characterized. A convex combination of both metrics is optimized over the choices of probabilistic scheduling and TTLCache parameters using an efficient algorithm. In all tested cases, the experimental results show the superiority of our approach as compared to the state of the other algorithms and some competitive baselines. Implementation in a real cloud environment is further used to validate the results.
- 4 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 17 (3) , 1582-1596
TTLCache: Taming Latency in Erasure-Coded Storage Through TTL Caching
Distributed storage systems are known to be susceptible to long response time, and higher latency leads to a reduction in customers satisfaction. An elegant solution to reduce latency in such systems is through two methods -having redundancy in contents at the storage nodes, and adding a cache close to end-users. Redundancy could be added using an erasure code because of its high resiliency with low storage overhead. It is important to quantify the performance of distributed storage systems in the presence of redundancy and caching, which is the focus of this work. This paper proposes a framework for quantifying and jointly optimizing mean and tail latency in erasure-coded storage systems with edge-caching capabilities. A novel caching policy for caching contents in erasure-coded storage systems, called time-to-live (TTLCache), is proposed. Using TTLCache policy and probabilistic server-selection techniques, bounds for mean latency and latency tail probability (LTP) are characterized. A convex combination of both metrics is optimized over the choices of probabilistic scheduling and TTLCache parameters using an efficient algorithm. In all tested cases, the experimental results show the superiority of our approach as compared to the state of the other algorithms and some competitive baselines. Implementation in a real cloud environment is further used to validate the results.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
On the Information Freshness and Tail Latency Trade-Off in Mobile Networks
With the advent of emerging mission-critical applications, sampling information updates and scheduling mobile traffic in a timely manner are very challenging. In addition, maintaining fresh information and low latency communication is important to these applications. To that end, in this paper, we first derive closed-form expressions for the latency tail probability (LTP) and the average age of information (AoI) in M/G/1 systems, where shifted exponential service time is considered. Different from the majority of existing work in this domain, our analysis is derived assuming different update sizes with different priority levels. Next, we have developed novel policies for sampling and scheduling the information updates over the choice of one (or a set) of the parallel links, e.g., WiFi and LTE links. Then, a joint minimization of AoI and LTP is formulated and efficient algorithms are provided. Unlike queue-based policies, our scheduling approach over parallel links enjoys two key advantages. First, the scheduling decision is independent of the queue length and is thus less complex. Second, it can differentiate the updates of the apps to further prioritize the very-timely sensitive information (e.g control signals) over other messages that can tolerate more delay (e.g., status updates). Our evaluation results show significant improvements of the proposed approaches as compared to the state-of-the-art algorithms.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
On the Information Freshness and Tail Latency Trade-Off in Mobile Networks
With the advent of emerging mission-critical applications, sampling information updates and scheduling mobile traffic in a timely manner are very challenging. In addition, maintaining fresh information and low latency communication is important to these applications. To that end, in this paper, we first derive closed-form expressions for the latency tail probability (LTP) and the average age of information (AoI) in M/G/1 systems, where shifted exponential service time is considered. Different from the majority of existing work in this domain, our analysis is derived assuming different update sizes with different priority levels. Next, we have developed novel policies for sampling and scheduling the information updates over the choice of one (or a set) of the parallel links, e.g., WiFi and LTE links. Then, a joint minimization of AoI and LTP is formulated and efficient algorithms are provided. Unlike queue-based policies, our scheduling approach over parallel links enjoys two key advantages. First, the scheduling decision is independent of the queue length and is thus less complex. Second, it can differentiate the updates of the apps to further prioritize the very-timely sensitive information (e.g control signals) over other messages that can tolerate more delay (e.g., status updates). Our evaluation results show significant improvements of the proposed approaches as compared to the state-of-the-art algorithms.
- 9 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 20 (12) , 4714-4727
DeepPool: Distributed Model-Free Algorithm for Ride-Sharing Using Deep Reinforcement Learning
The success of modern ride-sharing platforms crucially depends on the profit of the ride-sharing fleet operating companies, and how efficiently the resources are managed. Further, ride-sharing allows sharing costs and, hence, reduces the congestion and emission by making better use of vehicle capacities. In this paper, we develop a distributed model-free, DeepPool, that uses deep Q-network (DQN) techniques to learn optimal dispatch policies by interacting with the environment. Further, DeepPool efficiently incorporates travel demand statistics and deep learning models to manage dispatching vehicles for improved ride sharing services. Using real-world dataset of taxi trip records in New York, DeepPool performs better than other strategies, proposed in the literature, that do not consider ride sharing or do not dispatch the vehicles to regions where the future demand is anticipated. Finally, DeepPool can adapt rapidly to dynamic environments since it is implemented in a distributed manner in which each vehicle solves its own DQN individually without coordination.
- 9 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 20 (12) , 4714-4727
DeepPool: Distributed Model-Free Algorithm for Ride-Sharing Using Deep Reinforcement Learning
The success of modern ride-sharing platforms crucially depends on the profit of the ride-sharing fleet operating companies, and how efficiently the resources are managed. Further, ride-sharing allows sharing costs and, hence, reduces the congestion and emission by making better use of vehicle capacities. In this paper, we develop a distributed model-free, DeepPool, that uses deep Q-network (DQN) techniques to learn optimal dispatch policies by interacting with the environment. Further, DeepPool efficiently incorporates travel demand statistics and deep learning models to manage dispatching vehicles for improved ride sharing services. Using real-world dataset of taxi trip records in New York, DeepPool performs better than other strategies, proposed in the literature, that do not consider ride sharing or do not dispatch the vehicles to regions where the future demand is anticipated. Finally, DeepPool can adapt rapidly to dynamic environments since it is implemented in a distributed manner in which each vehicle solves its own DQN individually without coordination.
- 5 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 9 (4) , 1453-1466
FastTrack: Minimizing Stalls for CDN-Based Over-the-Top Video Streaming Systems
Traffic for internet video streaming has been rapidly increasing and is further expected to increase with the higher definition videos and IoT applications, such as 360 degree videos and augmented virtual reality applications. While efficient management of heterogeneous cloud resources to optimize the quality of experience is important, existing work in this problem space often left out important factors. In this paper, we present a model for describing a today's representative system architecture for video streaming applications, typically composed of a centralized origin server and several CDN sites. Our model comprehensively considers the following factors: limited caching spaces at the CDN sites, allocation of CDN for a video request, choice of different ports from the CDN, and the central storage and bandwidth allocation. With the model, we focus on minimizing a performance metric, stall duration tail probability (SDTP), and present a novel, yet efficient, algorithm to solve the formulated optimization problem. The theoretical bounds with respect to the SDTP metric are also analyzed and presented. Our extensive simulation results demonstrate that the proposed algorithms can significantly improve the SDTP metric, compared to the baseline strategies. Small-scale video streaming system implementation in a real cloud environment further validates our results.
- 5 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 9 (4) , 1453-1466
FastTrack: Minimizing Stalls for CDN-Based Over-the-Top Video Streaming Systems
Traffic for internet video streaming has been rapidly increasing and is further expected to increase with the higher definition videos and IoT applications, such as 360 degree videos and augmented virtual reality applications. While efficient management of heterogeneous cloud resources to optimize the quality of experience is important, existing work in this problem space often left out important factors. In this paper, we present a model for describing a today's representative system architecture for video streaming applications, typically composed of a centralized origin server and several CDN sites. Our model comprehensively considers the following factors: limited caching spaces at the CDN sites, allocation of CDN for a video request, choice of different ports from the CDN, and the central storage and bandwidth allocation. With the model, we focus on minimizing a performance metric, stall duration tail probability (SDTP), and present a novel, yet efficient, algorithm to solve the formulated optimization problem. The theoretical bounds with respect to the SDTP metric are also analyzed and presented. Our extensive simulation results demonstrate that the proposed algorithms can significantly improve the SDTP metric, compared to the baseline strategies. Small-scale video streaming system implementation in a real cloud environment further validates our results.
- 14 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 16 (4) , 1609-1623
TTLoC: Taming Tail Latency for Erasure-Coded Cloud Storage Systems
Distributed storage systems are known to be susceptible to long tails in response time. In modern online storage systems such as Bing, Facebook, and Amazon, the long tails of the service latency are of particular concern, with 99.9th percentile response times being orders of magnitude worse than the mean. As erasure codes emerge as a popular technique to achieve high data reliability in distributed storage while attaining space efficiency, taming tail latency still remains an open problem due to the lack of mathematical models for analyzing such systems. To this end, we propose a framework for quantifying and optimizing tail latency in erasure-coded storage systems. In particular, we derive upper bounds on tail latency in closed-form for arbitrary service time distribution and heterogeneous files. Based on the model, we formulate an optimization problem to jointly minimize weighted latency tail probability of all files over the placement of files on the servers, and the choice of servers to access the requested files. The non-convex problem is solved using an efficient, alternating optimization algorithm. Further, we mathematically quantify, in closed form, the tail index, i.e, the exponent at which latency tail probability diminishes to zero, of the service latency for arbitrary erasure-coded storage, by characterizing the asymptotic behavior of latency distribution tails. We further show that probabilistic scheduling based algorithms are (asymptotically) optimal since they are able to achieve the exact tail index. Evaluation results show significant reduction of tail latency for erasure-coded storage systems with realistic workload. Based on the offline algorithm, an online version is developed and its superiorty over the state of the art algorithms, e.g., Join-Shortest-Queue (JSQ), Power-of-d (Pof(d)), Least-Load (LL(d)), is shown. Finally, a cloud storage system is implemented in a real cloud environment to show the superiority of our approach as compared to the considered baselines.
- 14 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 16 (4) , 1609-1623
TTLoC: Taming Tail Latency for Erasure-Coded Cloud Storage Systems
Distributed storage systems are known to be susceptible to long tails in response time. In modern online storage systems such as Bing, Facebook, and Amazon, the long tails of the service latency are of particular concern, with 99.9th percentile response times being orders of magnitude worse than the mean. As erasure codes emerge as a popular technique to achieve high data reliability in distributed storage while attaining space efficiency, taming tail latency still remains an open problem due to the lack of mathematical models for analyzing such systems. To this end, we propose a framework for quantifying and optimizing tail latency in erasure-coded storage systems. In particular, we derive upper bounds on tail latency in closed-form for arbitrary service time distribution and heterogeneous files. Based on the model, we formulate an optimization problem to jointly minimize weighted latency tail probability of all files over the placement of files on the servers, and the choice of servers to access the requested files. The non-convex problem is solved using an efficient, alternating optimization algorithm. Further, we mathematically quantify, in closed form, the tail index, i.e, the exponent at which latency tail probability diminishes to zero, of the service latency for arbitrary erasure-coded storage, by characterizing the asymptotic behavior of latency distribution tails. We further show that probabilistic scheduling based algorithms are (asymptotically) optimal since they are able to achieve the exact tail index. Evaluation results show significant reduction of tail latency for erasure-coded storage systems with realistic workload. Based on the offline algorithm, an online version is developed and its superiorty over the state of the art algorithms, e.g., Join-Shortest-Queue (JSQ), Power-of-d (Pof(d)), Least-Load (LL(d)), is shown. Finally, a cloud storage system is implemented in a real cloud environment to show the superiority of our approach as compared to the considered baselines.