Muhammad Shahzad
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Muhammad Shahzad has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Tong Yang
Peking University, Beijing, China
4 shared publications - Alex X. Liu
Midea Group, Foshan, China
3 shared publications - Raghav H. Venkatnarayan
North Carolina State University, Raleigh, NC, USA
2 shared publications - Anand Singh
IBM Corporation, Durham, NC 27709, USA; Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27606, USA
1 shared publication - Bin Cui
Peking University
1 shared publication - Fatma Patlar Akbulut
Department of Software Engineering, Istanbul Kültür University, Istanbul, Turkey
1 shared publication
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5385-5395
NetSight: Joint Spatio-Temporal Dependency Modeling for Network Traffic Prediction
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5385-5395
Open AccessNetSight: Joint Spatio-Temporal Dependency Modeling for Network Traffic Prediction
- Open Access
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 697-700
Dockless Electric Scooters Worldwide: Methods and Analysis
Usage data on Dockless Electric Scooters (DES) is crucial for developing policies and mobility applications to support shared transportation by understanding their supply and utilization. However, such data is not publicly available and prior DES studies relied on DES providers for the provision of usage data, which is often incomplete and difficult to obtain. This limits the ability to audit these datasets and study DES usage trends globally and over time. This paper addresses these limitations by introducing scalable methods to continuously collect DES data globally without relying on providers. We collect DES usage trends from 12 providers across 11 cities worldwide and examine supply and utilization trends and provider competition in this study.
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 697-700
Open AccessDockless Electric Scooters Worldwide: Methods and Analysis
Usage data on Dockless Electric Scooters (DES) is crucial for developing policies and mobility applications to support shared transportation by understanding their supply and utilization. However, such data is not publicly available and prior DES studies relied on DES providers for the provision of usage data, which is often incomplete and difficult to obtain. This limits the ability to audit these datasets and study DES usage trends globally and over time. This paper addresses these limitations by introducing scalable methods to continuously collect DES data globally without relying on providers. We collect DES usage trends from 12 providers across 11 cities worldwide and examine supply and utilization trends and provider competition in this study.
- Open Access
- 31 January 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
- Vol. 19 (1) , 1-30
Using RF Signals to Generate Indoor Maps
Generating maps of indoor environments beyond the line-of-sight finds applications in several areas such as planning, navigation, and security. While researchers have previously explored the use of RF signals to generate maps, prior work has two important limitations: (i) it requires moving the mapping setup along the entire lengths of the sides of the building, and (ii) it generates maps that are not fully connected, rather are scatter plots of locations from where some obstacles reflected the signals. Thus, prior approaches require human interpretation to locate the walls and determine how they merge. In this article, we address these limitations and propose RFMap, which generates fully connected maps, and does not require the measurement setup to be moved along the sides of the buildings. To generate the map, RFMap first transmits RF signals in many different directions and then measures the distances of different reflectors inside the building. Next, it identifies these reflectors and classifies them into various types based on the properties of the reflections. A key challenge is that RFMap does not receive reflections from all the directions due to the specular nature of the reflectors. Due to this, it only gets sparse data about the objects in the environment. To address this challenge, RFMap trains a deep generative adversarial network (GAN) to intelligently predict the missing information. At runtime, it feeds the locations and types of the detected reflectors to the trained GAN and generates complete and accurate map. We implemented RFMap using software defined radios and extensively evaluated it in several real-world environments. Our results show that RFMap generated the maps of all the buildings that we tested it on with high accuracy.
- 31 January 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
- Vol. 19 (1) , 1-30
Open AccessUsing RF Signals to Generate Indoor Maps
Generating maps of indoor environments beyond the line-of-sight finds applications in several areas such as planning, navigation, and security. While researchers have previously explored the use of RF signals to generate maps, prior work has two important limitations: (i) it requires moving the mapping setup along the entire lengths of the sides of the building, and (ii) it generates maps that are not fully connected, rather are scatter plots of locations from where some obstacles reflected the signals. Thus, prior approaches require human interpretation to locate the walls and determine how they merge. In this article, we address these limitations and propose RFMap, which generates fully connected maps, and does not require the measurement setup to be moved along the sides of the buildings. To generate the map, RFMap first transmits RF signals in many different directions and then measures the distances of different reflectors inside the building. Next, it identifies these reflectors and classifies them into various types based on the properties of the reflections. A key challenge is that RFMap does not receive reflections from all the directions due to the specular nature of the reflectors. Due to this, it only gets sparse data about the objects in the environment. To address this challenge, RFMap trains a deep generative adversarial network (GAN) to intelligently predict the missing information. At runtime, it feeds the locations and types of the detected reflectors to the trained GAN and generates complete and accurate map. We implemented RFMap using software defined radios and extensively evaluated it in several real-world environments. Our results show that RFMap generated the maps of all the buildings that we tested it on with high accuracy.
- 1 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (4) , 957-970
Enhanced Machine Learning Sketches for Network Measurements
Network monitoring and management require accurate statistics of a variety of flow-level metrics such as flow sizes, top-$k$ flows, and number of flows. Arguably, the current best technique to measure these metrics is sketches. While a significant amount of work has already been done on sketching techniques, there is still a lot of room for improvement because the accuracy of existing sketches varies with changing characteristics of network traffic. In this paper, we propose the idea of using machine learning to improve the accuracy of sketches, and propose a generic machine learning framework to reduce the dependence of accuracy of sketches on network traffic characteristics. We further present three case studies, where we applied our machine learning framework on sketches for measuring three flow-level network metrics, namely flow sizes, top-$k$ flows, and number of flows. We implemented and extensively evaluated this framework for these three metrics using both real-world and synthetic traffic traces. To the best of our knowledge, this is the first work that uses machine learning to reduce the dependence of sketching techniques on the characteristics of network traffic. We have released all our traces and implementation codes at Github.- 1 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (4) , 957-970
Enhanced Machine Learning Sketches for Network Measurements
Network monitoring and management require accurate statistics of a variety of flow-level metrics such as flow sizes, top-$k$ flows, and number of flows. Arguably, the current best technique to measure these metrics is sketches. While a significant amount of work has already been done on sketching techniques, there is still a lot of room for improvement because the accuracy of existing sketches varies with changing characteristics of network traffic. In this paper, we propose the idea of using machine learning to improve the accuracy of sketches, and propose a generic machine learning framework to reduce the dependence of accuracy of sketches on network traffic characteristics. We further present three case studies, where we applied our machine learning framework on sketches for measuring three flow-level network metrics, namely flow sizes, top-$k$ flows, and number of flows. We implemented and extensively evaluated this framework for these three metrics using both real-world and synthetic traffic traces. To the best of our knowledge, this is the first work that uses machine learning to reduce the dependence of sketching techniques on the characteristics of network traffic. We have released all our traces and implementation codes at Github.- 23 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 30 (4) , 1554-1568
Characterizing the Availability and Latency in AWS Network From the Perspective of Tenants
Scalability and performance requirements are driving tenants to increasingly move their applications to public clouds. Unfortunately, cloud providers do not provide a view of their networking infrastructure to the tenants, rather only provide some generic service level agreements (SLAs). Tenants are, therefore, forced to plan the deployments of their applications based on these SLAs. This limits the performance that the tenants can achieve. Keeping this in view, we present a detailed network measurement study of the largest public cloud, Amazon Web Services (AWS). We collected network data to characterize the availability and latency of AWS over a period of 100 days and studied various temporal trends across several geographical locations of AWS throughout the world. We performed our study at all three levels of cloud hierarchy: inside availability zones (AZs), across AZs, and across regions. Our results show that network behavior varies significantly over time at different geographical locations, levels of hierarchy, and temporal granularities. For example, while we observed high availability at monthly granularity, it deteriorates at daily and hourly granularities. This and many other such observations that we present have significant implications for cloud tenants. We further implemented our measurement approach on Google Cloud Platform (GCP) to demonstrate that it can be deployed on any cloud platform and present some preliminary comparative observations from this implementation. Based on our observations, we present several recommendations that tenants can use to better deploy their applications.
- 23 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 30 (4) , 1554-1568
Characterizing the Availability and Latency in AWS Network From the Perspective of Tenants
Scalability and performance requirements are driving tenants to increasingly move their applications to public clouds. Unfortunately, cloud providers do not provide a view of their networking infrastructure to the tenants, rather only provide some generic service level agreements (SLAs). Tenants are, therefore, forced to plan the deployments of their applications based on these SLAs. This limits the performance that the tenants can achieve. Keeping this in view, we present a detailed network measurement study of the largest public cloud, Amazon Web Services (AWS). We collected network data to characterize the availability and latency of AWS over a period of 100 days and studied various temporal trends across several geographical locations of AWS throughout the world. We performed our study at all three levels of cloud hierarchy: inside availability zones (AZs), across AZs, and across regions. Our results show that network behavior varies significantly over time at different geographical locations, levels of hierarchy, and temporal granularities. For example, while we observed high availability at monthly granularity, it deteriorates at daily and hourly granularities. This and many other such observations that we present have significant implications for cloud tenants. We further implemented our measurement approach on Google Cloud Platform (GCP) to demonstrate that it can be deployed on any cloud platform and present some preliminary comparative observations from this implementation. Based on our observations, we present several recommendations that tenants can use to better deploy their applications.
- 1 October 2020
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 195, 105571
Bimodal affect recognition based on autoregressive hidden Markov models from physiological signals
- 1 October 2020
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 195, 105571
Bimodal affect recognition based on autoregressive hidden Markov models from physiological signals
- 15 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 31 (10) , 2263-2276
SF-Sketch: A Two-Stage Sketch for Data Streams
Sketches are probabilistic data structures designed for recording frequencies of items in a multi-set. They are widely used in various fields, especially for gathering Internet statistics from distributed data streams in network measurements. In a distributed streaming application with high data rates, a sketch in each monitoring node “fills up” very quickly and then its content is transferred to a remote collector responsible for answering queries. Thus, the size of the contents transferred must be kept as small as possible while meeting the desired accuracy requirement. To obtain significantly higher accuracy while keeping the same update and query speed as the best prior sketches, in this article, we propose a new sketch - the Slim-Fat (SF) sketch. The key idea behind the SF-sketch is to maintain two separate sketches: a larger sketch, the Fat-subsketch, and a smaller sketch, the Slim-subsketch. The Fat-subsketch is used for updating and periodically producing the Slim-subsketch, which is then transferred to the remote collector for answering queries quickly and accurately. We also present the error bound as well as an accurate model of the correct rate of the SF-sketch, and verify their correctness through experiments. We implemented and extensively evaluated the SF-sketch along with several prior sketches. Our results show that when the size of our Slim-subsketch and of the widely used Count-Min (CM) sketch are kept the same, our SF-sketch outperforms the CM-sketch by up to 33.1 times in terms of accuracy (when the ratio of the sizes of the Fat-subsketch and the Slim-subsketch is 16:1). We have made all source codes publicly available at Github [“Source code of SF sketches,” [Online]. Available: https://github.com/paper2017/SF-sketch].
- 15 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 31 (10) , 2263-2276
SF-Sketch: A Two-Stage Sketch for Data Streams
Sketches are probabilistic data structures designed for recording frequencies of items in a multi-set. They are widely used in various fields, especially for gathering Internet statistics from distributed data streams in network measurements. In a distributed streaming application with high data rates, a sketch in each monitoring node “fills up” very quickly and then its content is transferred to a remote collector responsible for answering queries. Thus, the size of the contents transferred must be kept as small as possible while meeting the desired accuracy requirement. To obtain significantly higher accuracy while keeping the same update and query speed as the best prior sketches, in this article, we propose a new sketch - the Slim-Fat (SF) sketch. The key idea behind the SF-sketch is to maintain two separate sketches: a larger sketch, the Fat-subsketch, and a smaller sketch, the Slim-subsketch. The Fat-subsketch is used for updating and periodically producing the Slim-subsketch, which is then transferred to the remote collector for answering queries quickly and accurately. We also present the error bound as well as an accurate model of the correct rate of the SF-sketch, and verify their correctness through experiments. We implemented and extensively evaluated the SF-sketch along with several prior sketches. Our results show that when the size of our Slim-subsketch and of the widely used Count-Min (CM) sketch are kept the same, our SF-sketch outperforms the CM-sketch by up to 33.1 times in terms of accuracy (when the ratio of the sizes of the Fat-subsketch and the Slim-subsketch is 16:1). We have made all source codes publicly available at Github [“Source code of SF sketches,” [Online]. Available: https://github.com/paper2017/SF-sketch].
- 21 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 20 (3) , 1242-1256
WiFi based Multi-User Gesture Recognition
WiFi based gesture recognition has received significant attention over the past few years. However, the key limitation of prior WiFi based gesture recognition systems is that they cannot recognize the gestures of multiple users performing them simultaneously. In this article, we address this limitation and propose WiMU, a Wi Fi based M ulti- U ser gesture recognition system. The key idea behind WiMU is that when it detects that some users have performed some gestures simultaneously, it first automatically determines the number of simultaneously performed gestures ($N_a$ ) and then, using the training samples collected from a single user, generates virtual samples for various plausible combinations of$N_a$ gestures. The key property of these virtual samples is that the virtual samples for any given combination of gestures are identical to the real samples that would result from real users performing that combination of gestures. WiMU compares the detected sample against these virtual samples and recognizes the simultaneously performed gestures. We implemented and extensively evaluated WiMU using commodity WiFi devices. Our results show that WiMU recognizes 2, 3, 4, 5, 6, 7, and 8 simultaneously performed gestures with accuracies of 95.6, 94.9, 93.9, 92.7, 91.6, 91.0, and 90.1 percent, respectively.- 21 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 20 (3) , 1242-1256
WiFi based Multi-User Gesture Recognition
WiFi based gesture recognition has received significant attention over the past few years. However, the key limitation of prior WiFi based gesture recognition systems is that they cannot recognize the gestures of multiple users performing them simultaneously. In this article, we address this limitation and propose WiMU, a Wi Fi based M ulti- U ser gesture recognition system. The key idea behind WiMU is that when it detects that some users have performed some gestures simultaneously, it first automatically determines the number of simultaneously performed gestures ($N_a$ ) and then, using the training samples collected from a single user, generates virtual samples for various plausible combinations of$N_a$ gestures. The key property of these virtual samples is that the virtual samples for any given combination of gestures are identical to the real samples that would result from real users performing that combination of gestures. WiMU compares the detected sample against these virtual samples and recognizes the simultaneously performed gestures. We implemented and extensively evaluated WiMU using commodity WiFi devices. Our results show that WiMU recognizes 2, 3, 4, 5, 6, 7, and 8 simultaneously performed gestures with accuracies of 95.6, 94.9, 93.9, 92.7, 91.6, 91.0, and 90.1 percent, respectively.- 18 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 17 (4) , 730-744
Large Scale Characterization of Software Vulnerability Life Cycles
Software systems inherently contain vulnerabilities that have been exploited in the past resulting in significant revenue losses. % The study of various aspects related to vulnerabilities such as their severity, rates of disclosure, exploit and patch release, and existence of common vulnerabilities in different products can help in improving the development, deployment, and maintenance process of software systems. % It can also help in designing future security policies and conducting audits of past incidents. % Furthermore, such an analysis can help customers to assess the security risks associated with software products of different vendors. % In this paper, we conduct an exploratory measurement study of a large software vulnerability data set containing 56077 vulnerabilities disclosed since 1988 till 2013. % We investigate vulnerabilities along following eight dimensions: (1) phases in the life cycle of vulnerabilities, (2) evolution of vulnerabilities over the years, (3) functionality of vulnerabilities, (4) access requirement for exploitation of vulnerabilities, (5) risk level of vulnerabilities, (6) software vendors, (7) software products, and (8) existence of common vulnerabilities in multiple software products. % Our exploratory analysis uncovers several statistically significant findings that have important implications for software development and deployment.
- 18 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 17 (4) , 730-744
Large Scale Characterization of Software Vulnerability Life Cycles
Software systems inherently contain vulnerabilities that have been exploited in the past resulting in significant revenue losses. % The study of various aspects related to vulnerabilities such as their severity, rates of disclosure, exploit and patch release, and existence of common vulnerabilities in different products can help in improving the development, deployment, and maintenance process of software systems. % It can also help in designing future security policies and conducting audits of past incidents. % Furthermore, such an analysis can help customers to assess the security risks associated with software products of different vendors. % In this paper, we conduct an exploratory measurement study of a large software vulnerability data set containing 56077 vulnerabilities disclosed since 1988 till 2013. % We investigate vulnerabilities along following eight dimensions: (1) phases in the life cycle of vulnerabilities, (2) evolution of vulnerabilities over the years, (3) functionality of vulnerabilities, (4) access requirement for exploitation of vulnerabilities, (5) risk level of vulnerabilities, (6) software vendors, (7) software products, and (8) existence of common vulnerabilities in multiple software products. % Our exploratory analysis uncovers several statistically significant findings that have important implications for software development and deployment.
- 11 April 2018
- Published by Springer Nature in World Wide Web
- Vol. 22 (6) , 2675-2696
FID-sketch: an accurate sketch to store frequencies in data streams
- 11 April 2018
- Published by Springer Nature in World Wide Web
- Vol. 22 (6) , 2675-2696
FID-sketch: an accurate sketch to store frequencies in data streams