Hyame Assem Alameddine
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hyame Assem Alameddine has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Chadi Assi
Concordia University
9 shared publications - Sanaa Sharafeddine
Department of Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon
3 shared publications - Mohammad Ali Salahuddin
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada
2 shared publications - Raouf Boutaba
University of Waterloo, Waterloo, Canada
2 shared publications Samir Sebbah
Concordia University
2 shared publications- Vahid Pourahmadi
Department of Electrical Engineering, Amirkabir University of Technology, Tehran, Iran
2 shared publications
Latest Publications
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (7) , 10061-10075
HTTP/2 DoS Attacks in 5G Networks: Impact Analysis and Anomaly Detection
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (7) , 10061-10075
HTTP/2 DoS Attacks in 5G Networks: Impact Analysis and Anomaly Detection
- Open Access
- 29 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 182-193
RAN-GUARD: A Hybrid Multi-Model Approach for Early Detection of IP-based DDoS Attacks in O-RAN
- 29 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 182-193
Open AccessRAN-GUARD: A Hybrid Multi-Model Approach for Early Detection of IP-based DDoS Attacks in O-RAN
- 5 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 12887-12902
PUL-Inter-Slice Defender: An Anomaly Detection Solution for Distributed Slice Mobility Attacks
Network Slices (NSs) are virtual networks operating over a shared physical infrastructure, each designed to meet specific application requirements while maintaining consistent Quality of Service (QoS). In Fifth Generation (5G) networks, User Equipment (UE) can connect to and seamlessly switch between multiple NSs to access diverse services. However, this flexibility, known as Inter-Slice Switching (ISS), introduces a potential vulnerability that can be exploited to launch Distributed Slice Mobility (DSM) attacks, a form of Distributed Denial of Service (DDoS) attack. To secure 5G networks and their NSs against DSM attacks, we present in this work, PUL-Inter-Slice Defender; an anomaly detection solution that leverages Positive Unlabeled Learning (PUL) and incorporates a combination of Long Short-Term Memory Autoencoders and K-Means clustering. PUL-Inter-Slice Defender leverages the Third Generation Partnership Project (3GPP) key performance indicators and performance measurement counters as features for its machine learning models to detect DSM attack variants while maintaining robustness in the presence of contaminated training data. When evaluated on data collected from our 5G testbed based on the open-source free 5GC and UERANSIM, a UE/ Radio Access Network (RAN) simulator; PUL-Inter-Slice Defender achieved F1-scores exceeding 98.50% on training datasets with 10% to 40% attack contamination, consistently outperforming its counterpart Inter-Slice Defender and other PUL based solutions combining One-Class Support Vector Machine (OCSVM) with Random Forest and XGBoost.
- 5 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 12887-12902
PUL-Inter-Slice Defender: An Anomaly Detection Solution for Distributed Slice Mobility Attacks
Network Slices (NSs) are virtual networks operating over a shared physical infrastructure, each designed to meet specific application requirements while maintaining consistent Quality of Service (QoS). In Fifth Generation (5G) networks, User Equipment (UE) can connect to and seamlessly switch between multiple NSs to access diverse services. However, this flexibility, known as Inter-Slice Switching (ISS), introduces a potential vulnerability that can be exploited to launch Distributed Slice Mobility (DSM) attacks, a form of Distributed Denial of Service (DDoS) attack. To secure 5G networks and their NSs against DSM attacks, we present in this work, PUL-Inter-Slice Defender; an anomaly detection solution that leverages Positive Unlabeled Learning (PUL) and incorporates a combination of Long Short-Term Memory Autoencoders and K-Means clustering. PUL-Inter-Slice Defender leverages the Third Generation Partnership Project (3GPP) key performance indicators and performance measurement counters as features for its machine learning models to detect DSM attack variants while maintaining robustness in the presence of contaminated training data. When evaluated on data collected from our 5G testbed based on the open-source free 5GC and UERANSIM, a UE/ Radio Access Network (RAN) simulator; PUL-Inter-Slice Defender achieved F1-scores exceeding 98.50% on training datasets with 10% to 40% attack contamination, consistently outperforming its counterpart Inter-Slice Defender and other PUL based solutions combining One-Class Support Vector Machine (OCSVM) with Random Forest and XGBoost.
- 25 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 20 (5) , 4002-4015
Spotting Anomalies at the Edge: Outlier Exposure-Based Cross-Silo Federated Learning for DDoS Detection
Distributed Denial-of-Service (DDoS) attacks are expected to continue plaguing service availability in emerging networks which rely on distributed edge clouds to offer critical, latency-sensitive applications. However, edge servers increase the network attack surface, which is exacerbated with the massive number of connected Internet of Things (IoT) devices that can be weaponized to launch DDoS attacks. Therefore, it is crucial to detect DDoS attacks early, i.e., at the network edge. In this paper, we empower the network edge with intelligent DDoS detection by learning from similarities between different data and DDoS attacks available across the edge servers. To this end, we develop a novel Outlier Exposure (OE)-enabled cross-silo Federated Learning framework, namely FedOE. FedOE enables distributed training of OE-based ML models using a limited number of labeled outliers (i.e., attack flows) experienced at edge servers. We propose a novel OE-based Autoencoder (oAE) that can better discriminate anomalies in comparison to the widely adopted traditional Autoencoder, using a tailored, OE-based loss function. We evaluate oAE in FedOE and demonstrate its ability to generalize to zero-day attacks, with just 50 labeled attack flows per edge server. The results show that oAE achieves a high F1-score for most DDoS attacks, outclassing its non-OE counterpart.
- 25 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 20 (5) , 4002-4015
Spotting Anomalies at the Edge: Outlier Exposure-Based Cross-Silo Federated Learning for DDoS Detection
Distributed Denial-of-Service (DDoS) attacks are expected to continue plaguing service availability in emerging networks which rely on distributed edge clouds to offer critical, latency-sensitive applications. However, edge servers increase the network attack surface, which is exacerbated with the massive number of connected Internet of Things (IoT) devices that can be weaponized to launch DDoS attacks. Therefore, it is crucial to detect DDoS attacks early, i.e., at the network edge. In this paper, we empower the network edge with intelligent DDoS detection by learning from similarities between different data and DDoS attacks available across the edge servers. To this end, we develop a novel Outlier Exposure (OE)-enabled cross-silo Federated Learning framework, namely FedOE. FedOE enables distributed training of OE-based ML models using a limited number of labeled outliers (i.e., attack flows) experienced at edge servers. We propose a novel OE-based Autoencoder (oAE) that can better discriminate anomalies in comparison to the widely adopted traditional Autoencoder, using a tailored, OE-based loss function. We evaluate oAE in FedOE and demonstrate its ability to generalize to zero-day attacks, with just 50 labeled attack flows per edge server. The results show that oAE achieves a high F1-score for most DDoS attacks, outclassing its non-OE counterpart.
- 1 October 2021
- Published by Elsevier in Computer Networks
- Vol. 197
NFV security survey in 5G networks: A three-dimensional threat taxonomy
- 1 October 2021
- Published by Elsevier in Computer Networks
- Vol. 197
NFV security survey in 5G networks: A three-dimensional threat taxonomy
- 12 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 69 (10) , 6838-6851
UAV-Aided Ultra-Reliable Low-Latency Computation Offloading in Future IoT Networks
Modern 5G services with stringent reliability and latency requirements such as smart healthcare and industrial automation have become possible through the advancement of Multi-access Edge Computing (MEC). However, the rigidity of ground MEC and its susceptibility to infrastructure failure would prevent satisfying the resiliency and strict requirements of those services. Unmanned Aerial Vehicles (UAVs) have been proposed for providing flexible edge computing capability through UAV-mounted cloudlets, harnessing their advantages such as mobility, low-cost, and line-of-sight communication. However, UAV-mounted cloudlets may have failure rates that would impact mission-critical applications, necessitating a novel study for the provisioned reliability considering UAV node reliability and task redundancy. In this paper, we investigate the novel problem of UAV-aided ultra-reliable low-latency computation offloading which would enable future IoT services with strict requirements. We aim at maximizing the rate of served requests, by optimizing the UAVs’ positions, the offloading decisions, and the allocated resources while respecting the stringent latency and reliability requirements. To do so, the problem is divided into two phases, the first being a planning problem to optimize the placement of UAVs and the second an operational problem to make optimized offloading and resource allocation decisions with constrained UAVs’ energy. We formulate both problems associated with each phase as non-convex mixed-integer programs, and due to their non-convexity, we propose a two-stage approximate algorithm where the two problems are transformed into approximate convex programs. Further, we approach the problem considering the task partitioning model which will be prevalent in 5G networks. Through numerical analysis, we demonstrate the efficiency of our solution considering various scenarios, and compare it to other baseline approaches.
- 12 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 69 (10) , 6838-6851
UAV-Aided Ultra-Reliable Low-Latency Computation Offloading in Future IoT Networks
Modern 5G services with stringent reliability and latency requirements such as smart healthcare and industrial automation have become possible through the advancement of Multi-access Edge Computing (MEC). However, the rigidity of ground MEC and its susceptibility to infrastructure failure would prevent satisfying the resiliency and strict requirements of those services. Unmanned Aerial Vehicles (UAVs) have been proposed for providing flexible edge computing capability through UAV-mounted cloudlets, harnessing their advantages such as mobility, low-cost, and line-of-sight communication. However, UAV-mounted cloudlets may have failure rates that would impact mission-critical applications, necessitating a novel study for the provisioned reliability considering UAV node reliability and task redundancy. In this paper, we investigate the novel problem of UAV-aided ultra-reliable low-latency computation offloading which would enable future IoT services with strict requirements. We aim at maximizing the rate of served requests, by optimizing the UAVs’ positions, the offloading decisions, and the allocated resources while respecting the stringent latency and reliability requirements. To do so, the problem is divided into two phases, the first being a planning problem to optimize the placement of UAVs and the second an operational problem to make optimized offloading and resource allocation decisions with constrained UAVs’ energy. We formulate both problems associated with each phase as non-convex mixed-integer programs, and due to their non-convexity, we propose a two-stage approximate algorithm where the two problems are transformed into approximate convex programs. Further, we approach the problem considering the task partitioning model which will be prevalent in 5G networks. Through numerical analysis, we demonstrate the efficiency of our solution considering various scenarios, and compare it to other baseline approaches.
- 10 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 19 (1) , 627-641
Chronos: DDoS Attack Detection Using Time-Based Autoencoder
Cognitive network management is becoming quintessential to realize autonomic networking. However, the wide spread adoption of the Internet of Things (IoT) devices, increases the risk of cyber attacks. Adversaries can exploit vulnerabilities in IoT devices, which can be harnessed to launch massive Distributed Denial of Service (DDoS) attacks. Therefore, intelligent security mechanisms are needed to harden network security against these threats. In this paper, we propose Chronos, a novel time-based anomaly detection system. The anomaly detector, primarily an Autoencoder, leverages time-based features over multiple time windows to efficiently detect anomalous DDoS traffic. We develop a threshold selection heuristic that maximizes the F1-score across various DDoS attacks. Further, we compare the performance of Chronos against state-of-the-art approaches. We show that Chronos marginally outperforms another time-based system using a less complex anomaly detection pipeline, while out classing flow-based approaches with superior precision. In addition, we showcase the robustness of Chronos in the face of zero-day attacks, noise in training data, and a small number of training packets, asserting its suitability for online deployment.
- 10 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 19 (1) , 627-641
Chronos: DDoS Attack Detection Using Time-Based Autoencoder
Cognitive network management is becoming quintessential to realize autonomic networking. However, the wide spread adoption of the Internet of Things (IoT) devices, increases the risk of cyber attacks. Adversaries can exploit vulnerabilities in IoT devices, which can be harnessed to launch massive Distributed Denial of Service (DDoS) attacks. Therefore, intelligent security mechanisms are needed to harden network security against these threats. In this paper, we propose Chronos, a novel time-based anomaly detection system. The anomaly detector, primarily an Autoencoder, leverages time-based features over multiple time windows to efficiently detect anomalous DDoS traffic. We develop a threshold selection heuristic that maximizes the F1-score across various DDoS attacks. Further, we compare the performance of Chronos against state-of-the-art approaches. We show that Chronos marginally outperforms another time-based system using a less complex anomaly detection pipeline, while out classing flow-based approaches with superior precision. In addition, we showcase the robustness of Chronos in the face of zero-day attacks, noise in training data, and a small number of training packets, asserting its suitability for online deployment.
- 8 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (7) , 6952-6963
Demand-Aware Provisioning of Electric Vehicles Fast Charging Infrastructure
The concept of smart city urges for green technology to reduce carbon emission to ameliorate the global warming. Following this footprint, transportation sector is experiencing a paradigm shift and the transition to electric vehicles (EVs) has prodigious plausibility in reducing carbon emission. However, the anticipated EV penetration is hindered by several challenges, among them are their shorter driving range, slower charging rate and the lack of ubiquitous availability of charging locations, which collectively contribute to range anxieties for EVs drivers. Meanwhile, the expected immense EV load onto the power distribution network may compromise the power quality. To reduce the range anxiety, we present a two-stage solution to provision and dimension a DC fast charging station (CS) network that minimizes the deployment cost while ensuring a certain quality of experience for charging e.g., acceptable waiting times and shorter travel distances to charge. This solution also maintains the power quality by considering the distribution grid capacity, determining transformers' rating to support peak demand of EV charging and adding a minimum number of voltage regulators based on the impact over the power distribution network. We propose, evaluate and compare two CS network expansion models to determine a cost-effective and adaptive CSs provisioning solution that can efficiently expand the CS network to accommodate future EV charging and conventional load demands. We also propose two heuristic methods and compare our solution with them. Finally, a custom built Python-based discrete event simulator is developed to test our outcomes.
- 8 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (7) , 6952-6963
Demand-Aware Provisioning of Electric Vehicles Fast Charging Infrastructure
The concept of smart city urges for green technology to reduce carbon emission to ameliorate the global warming. Following this footprint, transportation sector is experiencing a paradigm shift and the transition to electric vehicles (EVs) has prodigious plausibility in reducing carbon emission. However, the anticipated EV penetration is hindered by several challenges, among them are their shorter driving range, slower charging rate and the lack of ubiquitous availability of charging locations, which collectively contribute to range anxieties for EVs drivers. Meanwhile, the expected immense EV load onto the power distribution network may compromise the power quality. To reduce the range anxiety, we present a two-stage solution to provision and dimension a DC fast charging station (CS) network that minimizes the deployment cost while ensuring a certain quality of experience for charging e.g., acceptable waiting times and shorter travel distances to charge. This solution also maintains the power quality by considering the distribution grid capacity, determining transformers' rating to support peak demand of EV charging and adding a minimum number of voltage regulators based on the impact over the power distribution network. We propose, evaluate and compare two CS network expansion models to determine a cost-effective and adaptive CSs provisioning solution that can efficiently expand the CS network to accommodate future EV charging and conventional load demands. We also propose two heuristic methods and compare our solution with them. Finally, a custom built Python-based discrete event simulator is developed to test our outcomes.
- 27 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 9 (3) , 1220-1235
Scheduling of Low Latency Services in Softwarized Networks
The fifth generation (5G) networks are expected to support diverse business verticals (i.e., manufacturing, health care, etc.) with varying quality of service requirements. While today's mobile networks are a one size fits all architecture, tomorrow 5G mobile networks are envisioned to encourage agility, programmability and elasticity through enabling a software-based architecture promoted by network slicing. Network slicing is a new paradigm consisting of partitioning the underlying network infrastructure into different logical network slices, each dedicated to address the requirements (i.e., ultra-low latency, ultra-reliability, etc.) of a group of services. Network Function Virtualization (NFV) and Software Defined Network (SDN) technologies have been identified as main enablers of network slicing and facilitating the fulfillment of the aforementioned services' requirements. In this paper, we study the Latency-Aware service scheduling (LASS) problem to solve the network functions mapping, the traffic routing and network service scheduling in the context of an ultra-low latency network slice to consider services with stringent deadlines. We propose the LASS-Game, a novel game theoretic approach presenting a scalable solution for the LASS-problem that accounts for the centralized aspect of this latter while leveraging a decentralized mapping, routing and scheduling decisions.
- 27 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 9 (3) , 1220-1235
Scheduling of Low Latency Services in Softwarized Networks
The fifth generation (5G) networks are expected to support diverse business verticals (i.e., manufacturing, health care, etc.) with varying quality of service requirements. While today's mobile networks are a one size fits all architecture, tomorrow 5G mobile networks are envisioned to encourage agility, programmability and elasticity through enabling a software-based architecture promoted by network slicing. Network slicing is a new paradigm consisting of partitioning the underlying network infrastructure into different logical network slices, each dedicated to address the requirements (i.e., ultra-low latency, ultra-reliability, etc.) of a group of services. Network Function Virtualization (NFV) and Software Defined Network (SDN) technologies have been identified as main enablers of network slicing and facilitating the fulfillment of the aforementioned services' requirements. In this paper, we study the Latency-Aware service scheduling (LASS) problem to solve the network functions mapping, the traffic routing and network service scheduling in the context of an ultra-low latency network slice to consider services with stringent deadlines. We propose the LASS-Game, a novel game theoretic approach presenting a scalable solution for the LASS-problem that accounts for the centralized aspect of this latter while leveraging a decentralized mapping, routing and scheduling decisions.
- Top Cited Papers
- 31 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 37 (3) , 668-682
Dynamic Task Offloading and Scheduling for Low-Latency IoT Services in Multi-Access Edge Computing
Multi-access Edge Computing (MEC) has recently emerged as a novel paradigm to facilitate access to advanced computing capabilities at the edge of the network, in close proximity to end devices, thereby enabling a rich variety of latency sensitive services demanded by various emerging industry verticals. Internet of Things (IoT) devices, being highly ubiquitous and connected, can offload their computational tasks to be processed by applications hosted on MEC servers due to their limited battery, computing, and storage capacities. Such IoT applications providing services to offloaded tasks of IoT devices are hosted on edge servers with limited computing capabilities. Given the heterogeneity in the requirements of the offloaded tasks (different computing requirements, latency, etc.), and limited MEC capabilities, we jointly decide on the task offloading (tasks to application assignment) and scheduling (order of executing them) which yields a challenging problem of combinatorial nature. Further, we jointly decide on the computing resource allocation for the hosted applications, and we refer to this problem as the Dynamic Task Offloading and Scheduling (DTOS) problem, encompassing the three subproblems mentioned before. We mathematically formulate this problem and owing to its complexity, we design a novel thoughtful decomposition based on the technique of Logic Based Benders Decomposition. This technique solves a relaxed Master, with fewer constraints, and a subproblem, whose resolution allows the generation of cuts which will, iteratively, guide the master to tighten its search space. Ultimately, both the master and the sub-problem will converge to yield the optimal solution. We show that this technique offers several order of magnitude (more than 140 times) improvement in the run time for the studied instances. One other advantage of this method is its capability of providing solutions with performance guarantees. Finally, we use this method to highlight insightful performance trends for different vertical industries as a function of multiple system parameters with focus on delay sensitive use cases.
- 31 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 37 (3) , 668-682
Top Cited PapersDynamic Task Offloading and Scheduling for Low-Latency IoT Services in Multi-Access Edge Computing
Multi-access Edge Computing (MEC) has recently emerged as a novel paradigm to facilitate access to advanced computing capabilities at the edge of the network, in close proximity to end devices, thereby enabling a rich variety of latency sensitive services demanded by various emerging industry verticals. Internet of Things (IoT) devices, being highly ubiquitous and connected, can offload their computational tasks to be processed by applications hosted on MEC servers due to their limited battery, computing, and storage capacities. Such IoT applications providing services to offloaded tasks of IoT devices are hosted on edge servers with limited computing capabilities. Given the heterogeneity in the requirements of the offloaded tasks (different computing requirements, latency, etc.), and limited MEC capabilities, we jointly decide on the task offloading (tasks to application assignment) and scheduling (order of executing them) which yields a challenging problem of combinatorial nature. Further, we jointly decide on the computing resource allocation for the hosted applications, and we refer to this problem as the Dynamic Task Offloading and Scheduling (DTOS) problem, encompassing the three subproblems mentioned before. We mathematically formulate this problem and owing to its complexity, we design a novel thoughtful decomposition based on the technique of Logic Based Benders Decomposition. This technique solves a relaxed Master, with fewer constraints, and a subproblem, whose resolution allows the generation of cuts which will, iteratively, guide the master to tighten its search space. Ultimately, both the master and the sub-problem will converge to yield the optimal solution. We show that this technique offers several order of magnitude (more than 140 times) improvement in the run time for the studied instances. One other advantage of this method is its capability of providing solutions with performance guarantees. Finally, we use this method to highlight insightful performance trends for different vertical industries as a function of multiple system parameters with focus on delay sensitive use cases.