Search

Your search keyword '"Osama Arouk"' showing total 21 results
Start Over Author "Osama Arouk"
21 results on '"Osama Arouk"'

1. Network Slicing for TSN-Based Transport Networks

Author

Sushmit Bhattacharjee, Kostas Katsalis, Osama Arouk, Robert Schmidt, Tongtong Wang, Xueli An, Thomas Bauschert, and Navid Nikaein

Subjects
DetNet, Ethernet, 5G, IEEE TSN, mobile network, network slicing, Electrical engineering. Electronics. Nuclear engineering, TK1-9971
Abstract

In this work, we present and analyze methods and mechanisms for interconnecting a network slice control and management system of the mobile network, with an IEEE Time-Sensitive Network (TSN) control plane. IEEE TSN is gaining momentum as a key technology that is able to provide network service guarantees for Ethernet-based communications. Although Ultra-Reliable Low-Latency Communications (URLLC) have been thoroughly investigated in 5G, incorporating TSN technologies in the Transport Network is expected to unleash the potential of end-to-end deterministic communications, especially in industrial environments and time-critical applications like factory automation.We elaborate on the concepts of a TSN-aware Xhaul network, present a novel architecture, and describe a set of amendments required in order to enable network slicing. With the devised approach, a slice-aware TSN-enabled transport network can be controlled and managed in an end-to-end orchestrated way. Implementation experience and evaluation results are reported using TSN-enabled prototype devices, OpenAirInterface (OAI), and JOX slice orchestrator.

Published
2021
Full Text
View/download PDF

15. Group Paging-Based Energy Saving for Massive MTC Accesses in LTE and Beyond Networks

Author

Tarik Taleb, Osama Arouk, and Adlen Ksentini

Subjects
Computer Networks and Communications, Computer science, Retransmission, Core network, 02 engineering and technology, Electronic mail, 0203 mechanical engineering, 0202 electrical engineering, electronic engineering, information engineering, Resource management, Electrical and Electronic Engineering, Radio access network, ta213, business.industry, 020302 automobile design & engineering, 020206 networking & telecommunications, congestion control, Energy consumption, Network congestion, Energy conservation, MTC, Paging, business, Energy efficient, 5G, Computer network, Efficient energy use
Abstract

Next generation cellular networks (5G) have to deal with massive deployment of machine-type-communication (MTC) devices, expected to cause congestion and system overload in both the radio access network (RAN) and the core network (CN). Moreover, not only would the network suffer from the system overload, but also the MTC devices would experience high latency to access the channel and high power consumption due to the retransmission attempts. Indeed, power consumption is a critical issue in MTC, as the devices are not plugged into the electrical supply, e.g., in the case of sensor devices. To alleviate system overload (caused by the massive MTC deployment), the 3GPP proposed the group paging (GP) method. However, its performances dramatically decrease when increasing the number of MTC devices being paged. In this paper, we devise a novel method, named further improvement-traffic scattering for group paging (FI-TSFGP), which aims to improve the performance of GP when the number of MTC devices is high. FI-TSFGP scatters the paging operation of the MTC devices over a GP interval instead of letting all of the devices start the channel access procedure at nearly the same time. By doing so, FI-TSFGP achieves high-channel access probability for MTC devices, leading to the reduction of both the channel access latency and power consumption. Compared to GP and two other schemes, simulation results clearly demonstrate the high performance of FI-TSFGP in terms of: success and collision probabilities, average access delay, average number of preamble transmissions, and ultimately energy conservation.

Published
2016
Full Text
View/download PDF

16. Slice Orchestration for Multi-Service Disaggregated Ultra Dense RANs

Author

Osama Arouk, Chia-Yu Chang, Thierry Turletti, Adlen Ksentini, Konstantinos Samdanis, Kostas Katsalis, Navid Nikaein, EURECOM, Eurecom [Sophia Antipolis]-Centre National de la Recherche Scientifique (CNRS), Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Huawei Technologies [Dusseldorf], ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), and European Project: 762057,H2020,5G-PICTURE(2017)

Subjects
Service (systems architecture), Computer Networks and Communications, Computer science, Distributed computing, 050801 communication & media studies, 02 engineering and technology, Network Embedding, RAN slicing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, Resource (project management), 0202 electrical engineering, electronic engineering, information engineering, Resource management, Orchestration (computing), Electrical and Electronic Engineering, Radio access network, 05 social sciences, Orchestration, 020206 networking & telecommunications, Computer Science Applications, Shared resource, Software deployment, Network Slicing, Service Chaining, 5G
Abstract

International audience; Ultra Dense Networks (UDNs) are a natural deployment evolution for handling the tremendous traffic increase related to the emerging 5G services, especially in urban environments. However, the associated infrastructure cost may become prohibitive. The evolving paradigm of network slicing can tackle such a challenge while optimizing the network resource usage, enabling multi-tenancy and facilitating resource sharing and efficient service-oriented communications. Indeed, network slicing in UDN deployments can offer the desired degree of customization in both vanilla Radio Access Network (RAN) designs, but also in the case of disaggregated multi-service RANs. In this article, we devise a novel multi-service RAN environment, i.e., RAN runtime, capable to support slice orchestration procedures and to enable flexible customization of slices as per tenant needs. Each network slice can exploit a number of services, which can either be dedicated or shared between multiple slices over a common RAN. The novel architecture we present concentrates on the orchestration and management systems. It interacts with the RAN modules, through the RAN runtime, via a number of new interfaces enabling a customized dedicated orchestration logic for each slice. We present results for a disaggregated UDN deployment where the RAN runtime is used to support slice-based multi-service chain creation and chain placement, with an auto-scaling mechanism to increase the performance.

Published
2018
Full Text
View/download PDF

17. General Model for RACH Procedure Performance Analysis

Author

Adlen Ksentini, Osama Arouk, Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)

Subjects
Computer science, 020302 automobile design & engineering, 020206 networking & telecommunications, 02 engineering and technology, Computer Science Applications, Network congestion, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, Random-access channel, Modeling and Simulation, 0202 electrical engineering, electronic engineering, information engineering, Electrical and Electronic Engineering, Focus (optics), Algorithm, Beta distribution, Simulation, ComputingMilieux_MISCELLANEOUS
Abstract

This letter introduces an analytical model aiming at modeling the performance of the Random Access CHannel (RACH) procedure, with a special focus on the case of highly synchronized machine type communication (MTC) traffic activated according to beta distribution. The accuracy of the proposed model is then verified through computer simulation. Obtained results demonstrate the effectiveness of the model to capture the RACH procedure behavior when MTC devices are activated in a highly synchronized way. Note that 1) the proposed model is not dedicated only to beta distribution, but other distributions could be used and 2) this model could be used with any congestion control method managing the number of new arrivals, such as access class barring (ACB).

Published
2016
Full Text
View/download PDF

18. How accurate is the RACH procedure model in LTE and LTE-A?

Author

Adlen Ksentini, Tarik Taleb, and Osama Arouk

Subjects
ta113, business.industry, Computer science, Multichannel slotted ALOHA, Balls and bins problem, RACH procedure, 020302 automobile design & engineering, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, LTE-A, Term (time), LTE Advanced, LTE, Base station, 0203 mechanical engineering, Random-access channel, Telecommunications link, 0202 electrical engineering, electronic engineering, information engineering, business, Computer network, Communication channel
Abstract

In Long Term Evolution (LTE) networks, User Equipments (UE)s should proceed Random Access CHannel (RACH) procedure to attach to the Base Station and access the channel. One limitation of this procedure is the congestion that may appear when high number of UEs are simultaneously trying to attach to the channel. Such use-case happens when high number of Machine Type Communication (MTC) devices are deployed in one LTE cell. In order to evaluate the RACH performances, in terms of success, collision and idle probabilities, when the traffic load is high, accurate models are needed. However, most of existing models ignore one important constraint, which is the fact that the eNB can knowledge only a limited number of UEs in each RACH round, leading to a mis-formulation of these metrics in the context of LTE, and especially in the presence of high number of devices competing for the channel access. In this paper, we tackle the above-mentioned issue by devising a new model for the RACH procedure taking in consideration this constraint. Computer simulation demonstrates that unlike the existing models, our proposed model achieve high accuracy to estimate the performance of the RACH procedure, whatever the traffic load.

Published
2016

19. Group Paging Optimization For Machine-Type-Communications

Author

Adlen Ksentini, Tarik Taleb, Osama Arouk, Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), Department of Communications and Networking [Aalto Univ], School of Electrical Engineering [Aalto Univ], Aalto University-Aalto University, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and Ksentini, Adlen

Subjects
Radio access network, Service (systems architecture), [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer science, business.industry, Quality of service, 05 social sciences, 050801 communication & media studies, 020206 networking & telecommunications, 02 engineering and technology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, Software deployment, 0202 electrical engineering, electronic engineering, information engineering, Paging, business, 5G, Computer network
Abstract

International audience; Machine-Type-Communication (MTC) is a promisingservice of the envisioned 5G mobile networks. However,deploying a massive number of MTC devices in these networksremains a challenge due to the overload that may appear atthe Radio Access Network (RAN), hence degrading the Qualityof Services (QoS) for both MTC and Non-MTC devices. Oneof the methods used to address the congestion’s problem inRAN is Group Paging (GP), wherein a single message is usedto activate a group of devices. Whilst the GP method has severaladvantages, its performance quickly decreases when the numberof MTC devices increases. In this paper, we devise a new method,namely Traffic Scattering For Group Paging (TSFGP) to improvethe performance of the GP method for massive deployment ofMTC devices. Numerical results demonstrate that TSFGP highlyimproves the performance of GP in terms of several performancemetrics, such as success probability, collision probability, andaccess delay.

Published
2015

20. Multi-Channel Slotted Aloha Optimization for Machine-Type-Communication

Author

Adlen Ksentini, Osama Arouk, Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)

Subjects
Radio access network, Optimal estimation, Computer science, business.industry, 05 social sciences, Core network, 050801 communication & media studies, 020206 networking & telecommunications, 02 engineering and technology, Type (model theory), Network congestion, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, Aloha, 0202 electrical engineering, electronic engineering, information engineering, business, Random access, ComputingMilieux_MISCELLANEOUS, Communication channel, Computer network
Abstract

Deploying a massive number of MTC (Machine - Type - Communication) devices in the current cellular mobile networks represents a great challenge as they may cause congestion and system overload for both RAN (Radio Access Network) and CN (Core Network) parts. To address this issue, we propose a novel algorithm, named Multi-Channel Slotted ALOHA-Optimal Estimation (MCSA-OE), which estimates the network status (the number of active devices), and thus better controlling the RAN access. Unlike most existing methods that consider only one channel, MCSA-OE uses the statistics of all the channels in order to estimate the number of arrivals (UE and MTC devices) in each RA (Random Access) slot. Simulation results demonstrate that MCSA-OE well tracks the number of arrivals as long as they are smaller than ln(RR), where R is the number of channels. Moreover, we propose to use MCSA-OE estimation to dynamically adjust the acbBarringFactor of the Access Class Barring (ACB) mechanism. Again, simulation results show that the behavior of our proposition merely tends to that of the best acknowledgment case, i.e. when the number of arrivals in each RA slot is well known.

Published
2014

21. Multi-objective placement of virtual network function chains in 5G

Author

Thierry Turletti, Navid Nikaein, Osama Arouk, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), EURECOM, Eurecom [Sophia Antipolis]-Centre National de la Recherche Scientifique (CNRS), ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), European Project: 762057,H2020,5G-PICTURE(2017), Turletti, Thierry, Laboratoires d'excellence - Réseau orienté utilisateur - - UCN@SOPHIA2011 - ANR-11-LABX-0031 - LABX - VALID, and 5G Programmable Infrastructure Converging disaggregated neTwork and compUte REsources - 5G-PICTURE - - H20202017-06-01 - 2019-11-30 - 762057 - VALID

Subjects
Speedup, Computer science, Distributed computing, Real-time computing, 050801 communication & media studies, Cloud computing, 02 engineering and technology, Base station, NFV, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, 0202 electrical engineering, electronic engineering, information engineering, Virtual network, Radio access network, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], business.industry, 05 social sciences, 020206 networking & telecommunications, Load balancing (computing), Embedding, C-RAN, business, 5G, function split, function placement
Abstract

International audience; In this paper we propose a novel algorithm, namely Multi-Objective Placement (MOP), for the efficient placement of Virtualized Network Function (VNF) chains in future 5G systems. Real datasets are used to evaluate the performance of MOP in terms of acceptance ratio and embedding time when placing the time critical radio access network (RAN) functions as a chain. In addition, we rely on a realistic infrastructure topology to assess the performance of MOP with two main objectives: maximizing the number of base stations that could be embedded in the Cloud and load balancing. The results reveal that the acceptance ratio of embedding RAN functions is only 5% less than the one obtained with the optimal solution for the majority of considered scenarios, with a speedup factor of up to 2000 times.

Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results