SearcharxivSearch

arXiv subjects

Halima Elbiaze

Publications and source records attributed to Halima Elbiaze.

At least 19 recordsLinked to original sources

A Green Multi-Attribute Client Selection for Over-The-Air Federated Learning: A Grey-Wolf-Optimizer Approach

Federated Learning (FL) has gained attention across various industries for its capability to train machine learning models without centralizing sensitive data. While this approach offers significant benefits such as privacy preservation and decreased communication overhead, it presents several challenges, including deployment complexity and interoperability issues, particularly in heterogeneous scenarios or resource-constrained environments. Over-the-air (OTA) FL was introduced to tackle these challenges by disseminating model updates without necessitating direct device-to-device connections or centralized servers. However, OTA-FL brought forth limitations associated with heightened energy consumption and network latency. In this paper, we propose a multi-attribute client selection framework employing the grey wolf optimizer (GWO) to strategically control the number of participants in each round and optimize the OTA-FL process while considering accuracy, energy, delay, reliability, and fairness constraints of participating devices. We evaluate the performance of our multi-attribute client selection approach in terms of model loss minimization, convergence time reduction, and energy efficiency. In our experimental evaluation, we assessed and compared the performance of our approach against the existing state-of-the-art methods. Our results demonstrate that the proposed GWO-based client selection outperforms these baselines across various metrics. Specifically, our approach achieves a notable reduction in model loss, accelerates convergence time, and enhances energy efficiency while maintaining high fairness and reliability indicators.

cs.LG

Grant-Free Power Allocation for Ultra-Dense Internet of Things Environments: A Mean-Field Perspective

Grant free access, in which each Internet of Things (IoT) device delivers its packets through a randomly selected resource without spending time on handshaking procedures, is a promising solution for supporting the massive connectivity required for IoT systems. In this paper, we explore grant free access with multi packet reception capabilities, with an emphasis on ultra low end IoT applications with small data sizes, sporadic activity, and energy usage constraints. We propose a power allocation scheme that integrates the IoT device's traffic and energy budget by using a stochastic geometry framework and meanfield game theory to model and analyze mutual interference among active IoT devices.We also derive a Markov chain model to capture and track the IoT device's queue length and derive the successful transmission probability at steady state. Simulation results illustrate the optimal power allocation strategy and show the effectiveness of the proposed approach.

cs.NI

Federated Learning for 6G: Paradigms, Taxonomy, Recent Advances and Insights

Artificial Intelligence (AI) is expected to play an instrumental role in the next generation of wireless systems, such as sixth-generation (6G) mobile network. However, massive data, energy consumption, training complexity, and sensitive data protection in wireless systems are all crucial challenges that must be addressed for training AI models and gathering intelligence and knowledge from distributed devices. Federated Learning (FL) is a recent framework that has emerged as a promising approach for multiple learning agents to build an accurate and robust machine learning models without sharing raw data. By allowing mobile handsets and devices to collaboratively learn a global model without explicit sharing of training data, FL exhibits high privacy and efficient spectrum utilization. While there are a lot of survey papers exploring FL paradigms and usability in 6G privacy, none of them has clearly addressed how FL can be used to improve the protocol stack and wireless operations. The main goal of this survey is to provide a comprehensive overview on FL usability to enhance mobile services and enable smart ecosystems to support novel use-cases. This paper examines the added-value of implementing FL throughout all levels of the protocol stack. Furthermore, it presents important FL applications, addresses hot topics, provides valuable insights and explicits guidance for future research and developments. Our concluding remarks aim to leverage the synergy between FL and future 6G, while highlighting FL's potential to revolutionize wireless industry and sustain the development of cutting-edge mobile services.

cs.LG

A Review of the In-Network Computing and Its Role in the Edge-Cloud Continuum

Future networks are anticipated to enable exciting applications and industrial services ranging from Multisensory Extended Reality to Holographic and Haptic communication. These services are accompanied by high bandwidth requirements and/or require low latency and low reliability, which leads to the need for scarce and expensive resources. Cloud and edge computing offer different functionalities to these applications that require communication, computing, and caching (3C) resources working collectively. Hence, a paradigm shift is necessary to enable the joint management of the 3Cs in the edge-cloud continuum. We argue that In-Network Computing (INC) is the missing element that completes the edge-cloud continuum. This paper provides a detailed analysis of the driving use-cases, explores the synergy between INC and 3C, and emphasizes the crucial role of INC. A discussion on the opportunities and challenges posed by INC is held from various perspectives, including hardware implementation, architectural design, and regulatory and commercial aspects.

cs.NI

On Computing In the Network: Covid-19 Coughs Detection Case Study

Computing in the network (COIN) is a promising technology that allows processing to be carried out within network devices such as switches and network interface cards. Time sensitive application can achieve their quality of service (QoS) target by flexibly distributing the caching and computing tasks in the cloud-edge-mist continuum. This paper highlights the advantages of in-network computing, comparing to edge computing, in terms of latency and traffic filtering. We consider a critical use case related to Covid-19 alert application in an airport setting. Arriving travelers are monitored through cough analysis so that potentially infected cases can be detected and isolated for medical tests. A performance comparison has been done between an architecture using in-network computing and another one using edge computing. We show using simulations that in-network computing outperforms edge computing in terms of Round Trip Time (RTT) and traffic filtering.

cs.NI

An Architecture for Provisioning In-Network Computing-Enabled Slices for Holographic Applications in Next-Generation Networks

Applications such as holographic concerts are now emerging. However, their provisioning remains highly challenging. Requirements such as high bandwidth and ultra-low latency are still very challenging for the current network infrastructure. In-network computing (INC) is an emerging paradigm that enables the distribution of computing tasks across the network instead of computing on servers outside the network. It aims at tackling these two challenges. This article advocates the use of the INC paradigm to tackle holographic applications' high bandwidth and low latency challenges instead of the edge computing paradigm that has been used so far. Slicing brings flexibility to next-generation networks by enabling the deployment of applications/verticals with different requirements on the same network infrastructure. We propose an architecture that enables the provisioning of INC-enabled slices for holographic-type application deployment. The architecture is validated through a proof of concept and extensive simulations. Our experimental results show that INC significantly outperforms edge computing when it comes to these two key challenges. In addition, low jitter was maintained to preserve the hologram's stability.

cs.NI

Deep Reinforcement Learning-based Content Migration for Edge Content Delivery Networks with Vehicular Nodes

With the explosive demands for data, content delivery networks are facing ever-increasing challenges to meet end-users quality-of-experience requirements, especially in terms of delay. Content can be migrated from surrogate servers to local caches closer to end-users to address delay challenges. Unfortunately, these local caches have limited capacities, and when they are fully occupied, it may sometimes be necessary to remove their lower-priority content to accommodate higher-priority content. At other times, it may be necessary to return previously removed content to local caches. Downloading this content from surrogate servers is costly from the perspective of network usage, and potentially detrimental to the end-user QoE in terms of delay. In this paper, we consider an edge content delivery network with vehicular nodes and propose a content migration strategy in which local caches offload their contents to neighboring edge caches whenever feasible, instead of removing their contents when they are fully occupied. This process ensures that more contents remain in the vicinity of end-users. However, selecting which contents to migrate and to which neighboring cache to migrate is a complicated problem. This paper proposes a deep reinforcement learning approach to minimize the cost. Our simulation scenarios realized up to a 70% reduction of content access delay cost compared to conventional strategies with and without content migration.

cs.NI

CaMP-INC: Components-aware Microservices Placement for In-Network Computing Cloud-Edge Continuum

Microservices are a promising technology for future networks, and many research efforts have been devoted to optimally placing microservices in cloud data centers. However, microservices deployment in edge and in-network devices is more expensive than the cloud. Additionally, several works do not consider the main requirements of microservice architecture, such as service registry, failure detection, and each microservice's specific database. This paper investigates the problem of placing components (i.e. microservices and their corresponding databases) while considering physical nodes' failure and the distance to service registries. We propose a Components-aware Microservices Placement for In-Network Computing Cloud-Edge Continuum (CaMP-INC). We formulate an Integer Linear Programming (ILP) problem with the objective of cost minimization. Due to the problem's NP-hardness, we propose a heuristic solution. Numerical results demonstrate that our proposed solution CaMP-INC reduces the total cost by 15.8 % on average and has a superior performance in terms of latency minimization compared to benchmarks.

cs.NI

Market Driven Multi-domain Network Service Orchestration in 5G Networks

The advent of a new breed of enhanced multimedia services has put network operators into a position where they must support innovative services while ensuring both end-to-end Quality of Service requirements and profitability. Recently, Network Function Virtualization (NFV) has been touted as a cost-effective underlying technology in 5G networks to efficiently provision novel services. These NFV-based services have been increasingly associated with multi-domain networks. However, several orchestration issues, linked to cross-domain interactions and emphasized by the heterogeneity of underlying technologies and administrative authorities, present an important challenge. In this paper, we tackle the cross-domain interaction issue by proposing an intelligent and profitable auction-based approach to allow inter-domains resource allocation.

cs.NI

Traffic-Aware Mean-Field Power Allocation for Ultra-Dense NB-IoT Networks

The Narrowband Internet of Things (NB-IoT) is a cellular technology introduced by the Third Generation Partnership Project (3GPP) to provide connectivity to a large number of low-cost IoT devices with strict energy consumption limitations. However, in an ultra-dense small cell network employing NB-IoT technology, inter-cell interference can be a problem, raising serious concerns regarding the performance of NB-IoT, particularly in uplink transmission. Thus, a power allocation method must be established to analyze uplink performance, control and predict inter-cell interference, and avoid excessive energy waste during transmission. Unfortunately, standard power allocation techniques become inappropriate as their computational complexity grows in an ultra-dense environment. Furthermore, the performance of NB-IoT is strongly dependent on the traffic generated by IoT devices. In order to tackle these challenges, we provide a consistent and distributed uplink power allocation solution under spatiotemporal fluctuation incorporating NB-IoT features such as the number of repetitions and the data rate, as well as the IoT device's energy budget, packet size, and traffic intensity, by leveraging stochastic geometry analysis and Mean-Field Game (MFG) theory. The effectiveness of our approach is illustrated via extensive numerical analysis, and many insightful discussions are presented.

cs.IT

VNF and Container Placement: Recent Advances and Future Trends

With the growing demand for openness, scalability, and granularity, mobile network function virtualization (NFV) has emerged as a key enabler for most mobile network operators. NFV decouples network functions from hardware devices. This decoupling allows network services, referred to as Virtualized Network Functions (VNFs), to be hosted on commodity hardware which simplifies and enhances service deployment and management for providers, improves flexibility, and leads to efficient and scalable resource usage, and lower costs. The proper placement of VNFs in the hosting infrastructures is one of the main technical challenges. This placement significantly influences the network's performance, reliability, and operating costs. The VNF placement is NP-Hard. Hence, there is a need for placement methods that can scale with the issue's complexity and find appropriate solutions in a reasonable duration. The primary purpose of this study is to provide a taxonomy of optimization techniques used to tackle the VNF placement problems. We classify the studied papers based on performance metrics, methods, algorithms, and environment. Virtualization is not limited to simply replacing physical machines with virtual machines or VNFs, but may also include micro-services, containers, and cloud-native systems. In this context, the second part of our article focuses on the placement of containers in edge/fog computing. Many issues have been considered as traffic congestion, resource utilization, energy consumption, performance degradation, security, etc. For each matter, various solutions are proposed through different surveys and research papers in which each one addresses the placement problem in a specific manner by suggesting single objective or multi-objective methods based on different types of algorithms such as heuristic, meta-heuristic, and machine learning algorithms.

cs.NI

The Meshing of the Sky: Delivering Ubiquitous Connectivity to Ground Internet of Things

Nowadays, Unmanned Aerial Vehicles (UAVs) are being used in several novel applications, especially in the telecommunication domain. However, ensuring UAV communication and networking for the purpose of a specific application is still challenging. Indeed, due to the mobility of a UAV in a vast area, permanent connectivity over the back-haul is very sporadic and might be lost. In this paper, we consider an aerial mesh network where each UAV can serve as a flying base station to boost terrestrial base station in case of damaged infrastructure case for example, or/and provide connectivity for uncovered or poorly covered nodes, and behaves as a relay to establish communication between two components owing to a lack of reliable direct communication link between them. We then detail a case study where a UAV-fleet are used to collect data from the ground Internet of Things (IoT) devices and forward it to cloud for further processing passing by a remote gateway. We aim here to build a queueing framework including network layer, MAC layer, and physical layer and investigate both uplink and downlink communication links. Next, we derive some closed forms allowing us to predict the network performance in terms of traffic intensity at every UAV of the aerial mesh network, end-to-end (E2E) throughput and e2e delay of ongoing streams. Next, we conduct extensive simulations to illustrate the benefit of our framework. Results discussion and numerous insights on parameter setting, target quality of service and design consideration are also drawn.

cs.NI

On Byzantine Fault Tolerance in Multi-Master Kubernertes Clusters

Docker container virtualization technology is being widely adopted in cloud computing environments because of its lightweight and effiency. However, it requires adequate control and management via an orchestrator. As a result, cloud providers are adopting the open-access Kubernetes platform as the standard orchestrator of containerized applications. To ensure applications' availability in Kubernetes, the latter uses Raft protocol's replication mechanism. Despite its simplicity, Raft assumes that machines fail only when shutdown. This failure event is rarely the only reason for a machine's malfunction. Indeed, software errors or malicious attacks can cause machines to exhibit Byzantine (i.e. random) behavior and thereby corrupt the accuracy and availability of the replication protocol. In this paper, we propose a Kubernetes multi-Master Robust (KmMR) platform to overcome this limitation. KmMR is based on the adaptation and integration of the BFT-SMaRt fault-tolerant replication protocol into Kubernetes environment. Unlike Raft protocol, BFT-SMaRt is resistant to both Byzantine and non-Byzantine faults. Experimental results show that KmMR is able to guarantee the continuity of services, even when the total number of tolerated faults is exceeded. In addition, KmMR provides on average a consensus time 1000 times shorter than that achieved by the conventional platform (with Raft), in such condition. Finally, we show that KmMR generates a small additional cost in terms of resource consumption compared to the conventional platform.

cs.DC

Joint Caching and Resource Allocation in D2D-Assisted Wireless HetNet

5G networks are required to provide very fast and reliable communications while dealing with the increase of users traffic. In Heterogeneous Networks (HetNets) assisted with Device-to-Device (D2D) communication, traffic can be offloaded to Small Base Stations or to users to improve the network's successful data delivery rate. In this paper, we aim at maximizing the average number of files that are successfully delivered to users, by jointly optimizing caching placement and channel allocation in cache-enabled D2D-assisted HetNets. At first, an analytical upper-bound on the average content delivery delay is derived. Then, the joint optimization problem is formulated. The non-convexity of the problem is alleviated, and the optimal solution is determined. Due to the high time complexity of the obtained solution, a low-complex sub-optimal approach is proposed. Numerical results illustrate the efficacy of the proposed solutions and compare them to conventional approaches. Finally, by investigating the impact of key parameters, e.g. power, caching capacity, QoS requirements, etc., guidelines to design these networks are obtained.

cs.NI

Resource Allocation Mechanism for Media Handling Services in Cloud Multimedia Conferencing

Multimedia conferencing is the conversational exchange of multimedia content between multiple parties. It has a wide range of applications (e.g., Massively Multiplayer Online Games (MMOGs) and distance learning). Media handling services (e.g., video mixing, transcoding, and compressing) are critical to multimedia conferencing. However, efficient resource usage and scalability still remain important challenges. Unfortunately, the cloud-based approaches proposed so far have several deficiencies in terms of efficiency in resource usage and scaling, while meeting Quality of Service (QoS) requirements. This paper proposes a solution which optimizes resource allocation and scales in terms of the number of participants while guaranteeing QoS. Moreover, our solution composes different media handling services to support the participants' demands. We formulate the resource allocation problem mathematically as an Integer Linear Programming (ILP) problem and design a heuristic for it. We evaluate our proposed solution for different numbers of participants and different participants' geographical distributions. Simulation results show that our resource allocation mechanism can compose the media handling services and allocate the required resources in an optimal manner while honoring the QoS in terms of end-to-end delay.

cs.MM

Slicing Virtualized EPC-based 5G Core Network for Content Delivery

Traditional Content Delivery Networks (CDNs) built with traditional Internet technology are less and less able to cope with today's tremendous growth of content. Information Centric Networks (ICN), a proposed future Internet technology, may aid in remedying the situation. Unlike the current Internet, it decouples information from its sources and provides in-network storage. We expect traditional CDN and ICN-based CDN to co-exist in the foreseeable future, especially as it is now known that it might be possible to evolve traditional CDNs to gain the benefits promised by ICN. 5G providers must therefore aim to offer core network slices on which both ICN-based CDNs and traditional CDNs can be built. These slices could of course also be offered to providers of other applications with requirements similar to those of content delivery. This paper tackles the problem of slicing 5G for content delivery over ICN-based CDNs and traditional CDNs. Only virtualized Evolved Packet Core (EPC)-based 5G is considered. The problem is defined as a resource allocation problem which aims at minimizing the cost of slice assignment, while meeting QoS requirements. An Integer linear programming (ILP) formulation is provided and evaluated in a small-scale scenario.

cs.NI

CPVNF:Cost-efficient Proactive VNF Placement and Chaining for Value-Added Services in Content Delivery Networks

Value-added services (e.g., overlaid video advertisements) have become an integral part of today's Content Delivery Networks (CDNs). To offer cost-efficient, scalable and more agile provisioning of new value-added services in CDNs, Network Functions Virtualization (NFV) paradigm may be leveraged to allow implementation of fine-grained services as a chain of Virtual Network Functions (VNFs) to be placed in CDN. The manner in which these chains are placed is critical as it both affects the quality of service (QoS) and provider cost. The problem is however, very challenging due to the specifics of the chains (e.g.,one of their end-points is not known prior to the placement). We formulate it as an Integer Linear Program (ILP) and propose a cost efficient Proactive VNF placement and chaining (CPVNF)algorithm. The objective is to find the optimal number of VNFs along with their locations in such a manner that the cost is minimized while QoS is met. Apart from cost minimization, the support for large-scale CDNs with a large number of servers and end-users is an important feature of the proposed algorithm. Through simulations, the algorithm's behaviour for small-scale to large-scale CDN networks is analyzed.

cs.NI

ADS: Adaptive and Dynamic Scaling Mechanism for Multimedia Conferencing Services in the Cloud

Multimedia conferencing is used extensively in a wide range of applications, such as online games and distance learning. These applications need to efficiently scale the conference size as the number of participants fluctuates. Cloud is a technology that addresses the scalability issue. However, the proposed cloud-based solutions have several shortcomings in considering the future demand of applications while meeting both Quality of Service (QoS) requirements and efficiency in resource usage. In this paper, we propose an Adaptive and Dynamic Scaling mechanism (ADS) for multimedia conferencing services in the cloud. This mechanism enables scalable and elastic resource allocation with respect to the number of participants. ADS produces a cost-efficient scaling schedule while considering the QoS requirements and the future demand of the conferencing service. We formulate the problem using Integer Linear Programming (ILP) and design a heuristic for it. Simulation results show that ADS mechanism elastically scales conferencing services. Moreover, the ADS heuristic is shown to outperform a greedy algorithm from a resource-efficiency perspective.

cs.MM