HAHaftay Gebreslasie Abreha

Haftay Gebreslasie Abreha

*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


Haftay Gebreslasie Abreha has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Revenue-Aware Seamless Content Distribution in Satellite-Terrestrial Integrated Networks

    by Haftay Gebreslasie Abreha, Ilora Maity, Youssouf Drif, Christos Politis, Symeon Chatzinotas

    With the surging demand for data-intensive applications, ensuring seamless content delivery in Satellite-Terrestrial Integrated Networks (STINs) is crucial, especially for remote users. Dynamic Ad Insertion (DAI) enhances monetization and user experience, while Mobile Edge Computing (MEC) in STINs enables distributed content caching and ad insertion. However, satellite mobility and time-varying topologies cause service disruptions, while excessive or poorly placed ads risk user disengagement, impacting revenue. This paper proposes a novel framework that jointly addresses three challenges: (i) service continuity-and topology-aware content caching to adapt to STIN dynamics, (ii) Distributed DAI (D-DAI) that minimizes feeder link load and storage overhead by avoiding redundant ad-variant content storage through distributed ad stitching, and (iii) revenue-aware content distribution that explicitly models user disengagement due to ad overload to balance monetization and user satisfaction. We formulate the problem as two hierarchical Integer Linear Programming (ILP) optimizations: one content caching that aims to maximize cache hit rate and another optimizing content distribution with DAI to maximize revenue, minimize end-user costs, and enhance user experience. We develop greedy algorithms for fast initialization and a Binary Particle Swarm Optimization (BPSO)–based strategy for enhanced performance. Simulation results demonstrate that the proposed approach achieves over a 4.5% increase in revenue and reduces cache retrieval delay by more than 39% compared to the benchmark algorithms.


  • Open Access

    On-Board Content Caching With Dynamic Cache Reconfiguration in Multi-Layer Satellite Edge Networks

    by Haftay Gebreslasie Abreha, Ilora Maity, Houcine Chougrani, Christos Politis, Symeon Chatzinotas

    Satellite Edge Computing (SEC) integrated with multi-layer networks is a promising solution for on-board content caching to meet the stringent content delivery requirements in the future network. However, designing an efficient on-board content caching strategy is challenging in satellite edge networks because of limited on-board resources, dynamic topology, and fluctuating traffic demand. Frequent cache updates are required to adapt to these dynamic conditions, but incur cache reconfiguration overhead, which can overload feeder links and increase cache update delays. To address these challenges, in this paper, we propose an on-board dynamic cache reconfiguration strategy that maximizes the cache hit rate while minimizing reconfiguration overhead. We design a proximity-based content popularity model and an Age of Information (AoI)-aware caching strategy to optimize on-board satellite resources, enhancing the cache hit rate and ensuring content freshness. We employ a greedy algorithm for an initial and fast solution for caching contents and enhance it with a Genetic Algorithm (GA)-based approach. Simulations with realistic datasets demonstrate that the proposed solution outperforms the Cooperative Content Caching (CCC) benchmark by 11.63% and 9.25% in terms of cache hit rate and feeder link load, respectively.


  • Open Access

    Fairness-Aware VNF Mapping and Scheduling in Satellite Edge Networks for Mission-Critical Applications

    by Haftay Gebreslasie Abreha, Houcine Chougrani, Ilora Maity, Youssouf Drif, Christos Politis, Symeon Chatzinotas

    Satellite Edge Computing (SEC) is seen as a promising solution for deploying network functions in orbit to provide ubiquitous services with low latency and bandwidth. Software Defined Networks (SDN) and Network Function Virtualization (NFV) enable SEC to manage and deploy services more flexibly. In this paper, we study a dynamic and topology-aware VNF mapping and scheduling strategy within an SDN/NFV-enabled SEC infrastructure. Our focus is on meeting the stringent requirements of mission-critical (MC) applications, recognizing their significance in both satellite-to-satellite and edge-to-satellite communications while ensuring service delay margin fairness across various time-sensitive service requests. We formulate the VNF mapping and scheduling problem as an Integer Nonlinear Programming problem (), with the objective of minimax fairness among specified requests while considering dynamic satellite network topology, traffic, and resource constraints. We then propose two algorithms for solving the problem: Fairness-Aware Greedy Algorithm for Dynamic VNF Mapping and Scheduling () and Fairness-Aware Simulated Annealing-Based Algorithm for Dynamic VNF Mapping and Scheduling () which are suitable for low and high service arrival rates, respectively. Our extensive simulations demonstrate that both and approaches are very close to the optimization-based solution and outperform the benchmark solution in terms of service acceptance rates.


  • Open Access

    On-board Content Caching in Multi-layer Satellite Edge Networks with Dynamic Cache Reconfiguration

    by Haftay Gebreslasie Abreha, Ilora Maity, Houcine Chougrani, Christos Politis, Symeon Chatzinotas

    Satellite Edge Computing (SEC), equipped with onboard content caching, aims to reduce content delivery delay and feeder link load. However, effective content placement and timely reconfiguration are challenging due to various factors, such as dynamic satellite coverage, content popularity and freshness, and limited cache resources. This paper investigates on-board content caching in multi-layer satellite edge networks, incorporating LEO, MEO, and GEO satellites with dynamic cache reconfiguration. Our goal is to devise a strategy for content placement and source server selection to optimize on-board storage utilization, maximize cache hit rate, and minimize reconfiguration overhead while ensuring content freshness and relevance. We introduce a novel proximity-based hierarchical content popularity model and integrate SEC-enabled nodes as content source servers alongside traditional cloud content provider servers. Formulating the problem as Integer Linear Programming (ILP). We propose a Greedy-enhanced Genetic algorithm for content Cache placement and source server selection (G-GenCache) algorithm to optimize resource utilization and minimize reconfiguration overhead. Extensive simulations demonstrate that the proposed solution is near-optimal, outperforming the benchmarks in cache hit rate, feeder link load, content placement delay, and cache fetching duration.


  • Open Access

    Dynamic Data Sample Selection and Scheduling in Edge Federated Learning

    by Mohamed Adel Serhani, Haftay Gebreslasie Abreha, Asadullah Tariq, Mohammad Hayajneh, Yang Xu, Kadhim Hayawi

    Federated Learning (FL) is a state-of-the-art paradigm used in Edge Computing (EC). It enables distributed learning to train on cross-device data, achieving efficient performance, and ensuring data privacy. In the era of Big Data, the Internet of Things (IoT), and data streaming, challenges such as monitoring and management remain unresolved. Edge IoT devices produce and stream huge amounts of sample sources, which can incur significant processing, computation, and storage costs during local updates using all data samples. Many research initiatives have improved the algorithm for FL in homogeneous networks. However, in the typical distributed learning application scenario, data is generated independently by each device, and this heterogeneous data has different distribution characteristics. As a result, the data stream, often characterized as Big Data, used by each device for local learning is unbalanced and is not independent or identically distributed. Such data heterogeneity can degrade the performance of FL and reduce resource utilization. In this paper, we present the DSS-Edge-FL, a Dynamic Sample Selection optimization algorithm that aims to optimize resources and address data heterogeneity. The extensive results of the experiment demonstrate that our proposed approach outperforms the resource efficiency of conventional training methods, with a lower convergence time and improved resource efficiency.


  • Open Access

    NFV-Enabled Satellite Edge Networks for Mission-Critical Applications

    by Haftay Gebreslasie Abreha, Houcine Chougrani, Ilora Maity, Christos Politis, Symeon Chatzinotas

    Satellite Edge Computing (SEC) is seen as a promising solution for deploying network functions in orbit to provide ubiquitous services with low latency and bandwidth to support mission-critical applications. Software Defined Networks (SDN) and Network Function Virtualization (NFV) enable SEC to manage and deploy services more flexibly. In this paper, we study a dynamic and topology-aware VNF mapping and scheduling strategy in an SDN/NVF-enabled SEC infrastructure to maximize fairness in terms of end-to-end service delay margins. We formulate the VNF mapping and scheduling problem as an Integer Nonlinear Programming problem (INLP) with the objective of minimax fairness among specified service requests taking into account the time-varying satellite network topology, traffic workload, and limited resources. We then propose the following two algorithms to solve the INLP problem: Fairness-Aware Greedy Algorithm for Dynamic VNF Mapping and Scheduling (FAGD_MASC) and Fairness-Aware Simulated Annealing-Based Algorithm for Dynamic VNF Mapping and Scheduling (FASD_MASC), which are suitable for low and high service arrival rates, respectively. Finally, we evaluate the proposed algorithms through extensive simulations. The results show that both FAGD_MASC and FASD_MASC algorithms are very close to the optimizationbased solution and outperform a benchmark solution in terms of service acceptance rate and fairness.