Ehsan Saeedizade

dblp:306/6621 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2026
0000-0002-8455-8313ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021
YearPublicationVenuePosition
2026 Benchmarking Machine Learning Models for IoT Malware Detection under Data Scarcity and Drift
abstract
The rapid expansion of the Internet of Things (IoT) in domains such as smart cities, transportation, and industrial systems has heightened the urgency of addressing their security vulnerabilities. IoT devices often operate under limited computational resources, lack robust physical safeguards, and are deployed in heterogeneous and dynamic networks, making them prime targets for cyberattacks and malware applications. Machine learning (ML) offers a promising approach to automated malware detection and classification, but practical deployment requires models that are both effective and lightweight. The goal of this study is to investigate the effectiveness of four supervised learning models (Random Forest, LightGBM, Logistic Regression, and a Multi-Layer Perceptron) for malware detection and classification using the IoT-23 dataset. We evaluate model performance in both binary and multiclass classification tasks, assess sensitivity to training data volume, and analyze temporal robustness to simulate deployment in evolving threat landscapes. Our results show that tree-based models achieve high accuracy and generalization, even with limited training data, while performance deteriorates over time as malware diversity increases. These findings underscore the importance of adaptive, resource-efficient ML models for securing IoT systems in real-world environments.
Jake Lyon, Ehsan Saeedizade, Shamik Sengupta
CCNC2
2026 Lightweight IoT Device Fingerprinting Approach using Locality-Sensitive Hashing
abstract
The resource constraints of Internet of Things (IoT) devices limit the use of heavy security mechanisms, which leaves them more exposed to cyberattacks. Detecting malicious devices from network traffic is therefore critical. This paper proposes a lightweight fingerprinting method based on locality-sensitive hashing (LSH) that builds device-specific signatures from combined packet headers rather than payloads, avoiding payload variability and the overhead of full packet processing. Experiments on the LSIF and IoTSentinel datasets show that combined headers reach up to 99.3% and 95.8% accuracy, respectively, outperforming payload-based methods, while reducing processing time, making it suitable for real-time processing.
Roya Taheri, Ehsan Saeedizade, Shamik Sengupta
CCNC2
2023 I/O Burst Prediction for HPC Clusters Using Darshan Logs
abstract
Understanding cluster-wide I/O patterns of large-scale HPC clusters is essential to minimize the occurrence and impact of I/O interference. Yet, most previous work in this area focused on monitoring and predicting task and node-level I/O burst events. This paper analyzes Darshan reports from three supercomputers to extract system-level read and write I/O rates in five minutes intervals. We observe significant (over 100×) fluctuations in read and write I/O rates in all three clusters. We then train machine learning models to estimate the occurrence of system-level I/O bursts 5–120 minutes ahead. Evaluation results show that we can predict I/O bursts with more than 90% accuracy (F-1 score) five minutes ahead and more than 87% accuracy two hours ahead. We also show that the ML models attain more than 70% accuracy when estimating the degree of the I/O burst. We believe that high-accuracy predictions of I/O bursts can be used in multiple ways, such as postponing delay-tolerant I/O operations (e.g., checkpointing), pausing nonessential applications (e.g., file system scrubbers), and devising I/O-aware job scheduling methods. To validate this claim, we simulated a burst-aware job scheduler that can postpone the start time of applications to avoid I/O bursts. We show that the burst-aware job scheduling can lead to an up to 5× decrease in application runtime.
Ehsan Saeedizade, Roya Taheri, Engin Arslan
e-Science1
2023 Demystifying the Performance of Data Transfers in High-Performance Research Networks
abstract
High-speed research networks are built to meet the ever-increasing needs of data-intensive distributed workflows. However, data transfers in these networks often fail to attain the promised transfer rates for several reasons, including I/O and network interference, server misconfigurations, and network anomalies. Although understanding the root causes of performance issues is critical to mitigating them and increasing the utilization of expensive network infrastructures, there is currently no available mechanism to monitor data transfers in these networks. In this paper, we present a scalable, end-to-end monitoring framework to gather and store key performance metrics for file transfers to shed light on the performance of transfers. The evaluation results show that the proposed framework can monitor up to 400 transfers per host and more than 40, 000 transfers in total while collecting performance statistics at one-second precision. We also introduce a heuristic method to automatically process the gathered performance metrics and identify the root causes of performance anomalies with an F-score of 87–98%.
Ehsan Saeedizade, Bing Zhang 0018, Engin Arslan
e-Science1
2023 A Package-Aware Approach for Function Scheduling in Serverless Computing Environments
Faeze Azimi Chetabi, Mehrdad Ashtiani, Ehsan Saeedizade
J. Grid Comput.3
2021 DDBWS: a dynamic deadline and budget-aware workflow scheduling algorithm in workflow-as-a-service environments
Ehsan Saeedizade, Mehrdad Ashtiani
J. Supercomput.1