HAHatem Abou-Zeid

Hatem Abou-Zeid

*This is an algorithmically generated author record based on publicly available information.

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


Hatem Abou-Zeid has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Hybrid Wavelet Transform and Deep Stacking Ensemble Model for Network Traffic Prediction

    by Nader Joojili, Alexis Amezaga-Hechavarria, Omair Shafiq, Akram Bin Sediq, Peiliang Chang, Hatem Abou-Zeid

    Predicting packet volume accurately plays a vital role in network management and optimization. This study proposes a novel approach combining a hybrid wavelet transform and a deep stacking ensemble model to forecast packet volume. The proposed model leverages the wavelet transform's strengths and deep stacking ensemble techniques to enhance the predictive performance. The univariate prediction is conducted for different horizons, including 1, 3, 7, and 10 steps ahead. The wavelet transform is employed to capture the time-frequency characteristics of the packet volume data, enabling a more comprehensive analysis. The model can extract local and global features by decomposing the time series into different scales using wavelet analysis, improving prediction accuracy. The deep stacking ensemble model is utilized to leverage the collective intelligence of multiple base models. Through a series of stacking layers, the model learns to combine the predictions of individual models, allowing for a more robust and accurate forecast. The proposed hybrid wavelet transform and deep stacking ensemble model was subjected to experimental evaluations using real-world packet volume datasets. The outcomes of these evaluations exhibit the effectiveness of the model. The model achieves superior predictive performance compared to traditional methods, showcasing its potential for practical network management and optimization applications.

  • Delay-Aware and Energy-Efficient Carrier Aggregation in 5G Using Double Deep Q-Networks

    by Fahime Khoramnejad, Roghayeh Joda, Akram Bin Sediq, Hatem Abou-Zeid, Ramy Atawia, Gary Boudreau, Melike Erol-Kantarci

    As one of the key technologies in 5G networks, Carrier Aggregation (CA) is studied in this paper. In CA, Component Carriers (CCs) can be activated and deactivated depending on multiple factors, e.g., energy consumption and Quality of Service (QoS) demand of users. We propose CC management strategies where each User Equipment (UE) minimizes its average delay and at the same time minimizes its power consumption while considering that CCs can be activated and deactivated only at certain times, as in real-world CA implementations. We first model the problem as a centralized multi-objective optimum CC management problem. Since centralized approaches would impose a large overhead on the system, we then develop a semi-distributed solution by modeling the problem as a stochastic game and propose a multi-agent Double Deep Q-Network (DDQN) based CC management algorithm to solve the stochastic game. We finally compare the proposed approaches with single CC activation and all-CC activation baseline schemes. Simulation results show that our proposed algorithms outperform the all-CC algorithm in terms of UE power consumption and have the capability of transmitting a number of bits with delay close to the all-CC scheme. Meanwhile, our DDQN-based algorithm decreases the UE power consumption by about 20% with respect to the all-CC scheme.


  • Open Access

    Segmented Learning for Class-of-Service Network Traffic Classification

    by Yoga Suhas Kuruba Manjunath, Sihao Zhao, Hatem Abou-Zeid, Akram Bin Sediq, Ramy Atawia, Xiao-Ping Zhang

    Class-of-service (CoS) network traffic classification (NTC) classifies a group of similar traffic applications. The CoS classification is advantageous in resource scheduling for Internet service providers and avoids the necessity of remodelling. Our goal is to find a robust, lightweight, and fast-converging CoS classifier that uses fewer data in modelling and does not require specialized tools in feature extraction. The commonality of statistical features among the network flow segments motivates us to propose novel segmented learning that includes essential vector representation and a simple-segment method of classification. We represent the segmented traffic in the vector form using the EVR. Then, the segmented traffic is modelled for classification using random forest. Our solution's success relies on finding the optimal segment size and a minimum number of segments required in modelling. The solution is validated on multiple datasets for various CoS services, including virtual reality (VR). Significant findings of the research work are i) Synchronous services that require acknowledgment and request to continue communication are classified with 99% accuracy, ii) Initial 1,000 packets in any session are good enough to model a CoS traffic for promising results, and we therefore can quickly deploy a CoS classifier, and iii) Test results remain consistent even when trained on one dataset and tested on a different dataset. In summary, our solution is the first to propose segmentation learning NTC that uses fewer features to classify most CoS traffic with an accuracy of 99%. The implementation of our solution is available on GitHub.

  • Open Access

    Structure-aware reinforcement learning for node-overload protection in mobile edge computing

    by Anirudha Jitani, Aditya Mahajan, Zhongwen Zhu, Hatem Abou-Zeid, Emmanuel T. Fapi, Hakimeh Purmehdi

    Mobile Edge Computing (MEC) refers to the concept of placing computational capability and applications at the edge of the network, providing benefits such as reduced latency in handling client requests, reduced network congestion, and improved performance of applications. The performance and reliability of MEC are degraded significantly when one or several edge servers in the cluster are overloaded. Especially when a server crashes due to the overload, it causes service failures in MEC. In this work, an adaptive admission control policy to prevent edge node from getting overloaded is presented. This approach is based on a recently-proposed low complexity RL (Reinforcement Learning) algorithm called SALMUT (Structure-Aware Learning for Multiple Thresholds), which exploits the structure of the optimal admission control policy in multi-class queues for an average-cost setting. We extend the framework to work for node overload-protection problem in a discounted-cost setting. The proposed solution is validated using several scenarios mimicking real-world deployments in two different settings - computer simulations and a docker testbed. Our empirical evaluations show that the total discounted cost incurred by SALMUT is similar to state-of-the-art deep RL algorithms such as PPO (Proximal Policy Optimization) and A2C (Advantage Actor Critic) but requires an order of magnitude less time to train, outputs easily interpretable policy, and can be deployed in an online manner.

  • Open Access

    A Clustering-Driven Approach to Predict the Traffic Load of Mobile Networks for the Analysis of Base Stations Deployment

    by Basma Mahdy, Hazem Abbas, Hossam S. Hassanein, Aboelmagd Noureldin, Hatem Abou-Zeid

    Mobile network traffic is increasing in an unprecedented manner, resulting in growing demand from network operators to deploy more base stations able to serve more devices while maintaining a satisfactory level of service quality. Base stations are considered the leading energy consumer in network infrastructure; consequently, increasing the number of base stations will increase power consumption. By predicting the traffic load on base stations, network optimization techniques can be applied to decrease energy consumption. This research explores different machine learning and statistical methods capable of predicting traffic load on base stations. These methods are examined on a public dataset that provides records of traffic loads of several base stations over the span of one week. Because of the limited number of records in the dataset for each base station, different base stations are grouped while building the prediction model. Due to the different behavior of the base stations, forecasting the traffic load of multiple base stations together becomes challenging. The proposed solution involves clustering the base stations according to their behavior and forecasting the load on the base stations in each cluster individually. Clustering the time series data according to their behavior mitigates the dissimilar behavior problem of the time series when they are trained together. Our findings demonstrate that predictions based on deep recurrent neural networks perform better than other forecasting techniques.