ABAbdella Battou

Abdella Battou

*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


Abdella Battou has a total of 65 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Multiverse: A Simulator for Evaluating Entanglement Routing in Quantum Networks

    by Amar Abane, Junxiao Shi, Van Sy Mai, Abderrahim Amlou, Abdella Battou

    We present MQNS, a discrete-event simulator for rapid evaluation of entanglement routing under dynamic, heterogeneous configurations. MQNS supports runtime-configurable purification, swapping, memory management, and routing, within a unified qubit lifecycle and integrated link-architecture models. A modular, minimal design keeps MQNS architecture-agnostic, enabling fair, reproducible comparisons across paradigms and facilitating future emulation.

  • Open Access

    Bridging Language Models and Formal Methods for Intent-Driven Optical Network Design

    by Anis Bekri, Amar Abane, Abdella Battou, Saddek Bensalem

    Intent-Based Networking (IBN) aims to simplify network management by enabling users to specify high-level goals that drive automated network design and configuration. However, translating informal natural-language intents into formally correct optical network topologies remains challenging due to inherent ambiguity and lack of rigor in Large Language Models (LLMs). To address this, we propose a novel hybrid pipeline that integrates LLM-based intent parsing, formal methods, and Optical Retrieval-Augmented Generation (RAG). By enriching design decisions with domain-specific optical standards and systematically incorporating symbolic reasoning and verification techniques, our pipeline generates explainable, verifiable, and trustworthy optical network designs. This approach significantly advances IBN by ensuring reliability and correctness, essential for mission-critical networking tasks.

  • Open Access

    A Scalable Framework for Real-Time Network Security Traffic Analysis and Attack Detection Using Machine and Deep Learning

    by Zineb Maasaoui, Mheni Merzouki, Abdella Battou, Ahmed Lbath

    This paper presents an advanced framework for real-time monitoring and analysis of network traffic and endpoint security in large-scale enterprises by addressing the increasing complexity and frequency of cyber-attacks. Our Network Security Traffic Analysis Platform employs a comprehensive technology stack including the Elastic Stack, ZEEK, Osquery, Kafka, and GeoLocation data. By integrating supervised machine learning models trained on the UNSW-NB15 dataset, we evaluate Random Forest (RF), Decision Trees (DT), and Support Vector Machines (SVM), with the Random Forest classifier achieving a notable accuracy of 99.32%. Leveraging Artificial Intelligence and Natural Language Processing, we apply the BERT model with a Byte-level Byte-pair tokenizer to enhance network-based attack detection in IoT systems. Experiments on UNSW-NB15, TON-IoT, and Edge-IIoT datasets demonstrate our platform’s superiority over traditional methods in multi-class classification tasks, achieving near-perfect accuracy on the Edge-IIoT dataset. Furthermore, Network Security Traffic Analysis Platform’s ability to produce actionable insights through charts, tables, histograms, and other visualizations underscores its capability in static analysis of traffic data. This dual approach of real-time and static analysis provides a robust foundation for developing scalable, efficient, and automated security solutions, essential for managing the evolving threats in modern networks.


  • Top Cited Papers
    Open Access

    Entanglement Routing in Quantum Networks: A Comprehensive Survey

    by Amar Abane, Michael Cubeddu, Van Sy Mai, Abdella Battou

    Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to traditional routing technologies, a quantum routing protocol uses network information to choose the best paths to satisfy a set of end-to-end entanglement requests. However, in addition to network state information, a quantum routing protocol must also take into account the requested entanglement fidelity, the probabilistic nature of swapping operations, and the short lifetime of entangled states. In this work, we formulate a practical entanglement routing problem and analyze and categorize the main approaches to address it, drawing comparisons to, and inspiration from, classical network routing strategies where applicable. We classify and discuss the studied quantum routing schemes into reactive, proactive, and hybrid routing.


  • Open Access

    Clock synchronization characterization of the Washington DC metropolitan quantum network (DC-QNet)

    by Wayne McKenzie, Anne Marie Richards, Shirali Patel, Thomas Gerrits, T. G. Akin, Steven Peil, Adam T. Black, David Tulchinsky, Alexander Hastings, Ya-Shian Li-Baboud, et al.

    Quantum networking protocols relying on interference and precise time-of-flight measurements require high-precision clock synchronization. This study describes the design, implementation, and characterization of two optical time transfer methods in a metropolitan-scale quantum networking research testbed. With active electronic stabilization, sub-picosecond time deviation (TDEV) was achieved at integration times between 1 and 105 s over 53 km of deployed fiber. Over the same integration periods, 10-ps level TDEV was observed using the White Rabbit–Precision Time Protocol over 128 km. Measurement methods are described to understand the sources of environmental fluctuations on clock synchronization toward the development of in situ compensation methods. Path delay gradients, chromatic dispersion, polarization drift, and optical power variations all contributed to clock synchronization errors. The results from this study will inform future work in the development of compensation methods essential for enabling experimental research in developing practical quantum networking protocols.


  • A Smart Network Repository Based on Graph Database

    by Amar Abane, Abdella Battou, Mheni Merzouki, Tao Zhang


  • Modulation-agnostic single-shot estimation of quantum measurement confidence

    by M. V. Jabir, N. Fajar R. Annafianto, A. Battou, I. A. Burenkov, Sergey V. Polyakov

    We experimentally explore single-shot state identification using long alphabets of states and employing different modulation schemes. We use time-resolved quantum measurement and Bayesian inference to identify the input state and demonstrate the advantage of this single-shot measurement over classical state identification. For each single-shot measurement, we estimate the confidence of state identification based on the quantum measurement and demonstrate the physical significance of confidence estimates. Particularly, we show that a set of confidence values correctly represents the probabilities of successful state identification for a given experimental outcome. We investigate the alphabets of coherent states with different modulations and show that confidence estimates yield the reliability of each act of measurement independently of the modulation used.


  • Open Access

    Investigating Multi-Tier and QoS-Aware Caching Based on ARC

    by Lydia Ait-Oucheggou, Stéphane Rubini, Abdella Battou, Jalil Boukhobza

    Memory caching is a common practice to reduce application latencies by buffering relevant data in high speed memory. When the volume of data to cache is too large or a DRAM - based solution too expensive, several technologies such as NVM or high speed SSDs could complement DRAM to form a multi-tier cache. Additionally, most existing policies focus on categorizing the data based on factors like recency and frequency, setting aside the fact that applications/customers have varying Quality-of-Service requirements. This concept is well established in Cloud environment with Service Level Agreement (SLA). In this paper, by extending the Adaptive Replacement Cache (ARC), that uses recency and frequency lists, we propose a QoS-aware Multi-tier Adaptive Replacement Cache (QM-ARC) policy with the ability to take into account data applications/customers priorities through the concept of penalty borrowed from the Cloud. QM-ARC is generic, as it can be applied whatever the number of tiers and can accommodate different penalty functions. Using synthetic and real traces, our solution improved QoS as compared to state-of-the-art work.

  • Open Access

    Suppressing communication errors using quantum-enabled forward error correction

    by Ivan A. Burenkov, N. Fajar R. Annafianto, M. V. Jabir, Abdella Battou, Sergey V. Polyakov

    Because noise is inherent to all measurements, optical communication requires error identification and correction to protect and recover user data. Yet, error correction, routinely used in classical receivers, has not been applied to receivers that take advantage of quantum measurement. Here, we show how information uniquely available in a quantum measurement can be employed for efficient error correction. Our quantum-enabled forward error correction protocol operates on quadrature phase shift keying (QPSK) and achieves more than 80 dB error suppression compared to the raw symbol error rate and approximately 40 dB improvement of symbol error rates beyond the QPSK classical limit. With a symbol error rate below 10−9 for just 11 photons per bit, this approach enables reliable use of quantum receivers for ultra-low power optical communications. Limiting optical power improves the information capacity of optical links and enables scalable networks with coexisting quantum and classical channels in the same optical fiber.


  • Distributed Optimization With Global Constraints Using Noisy Measurements

    by Van Sy Mai, Richard J. La, Tao Zhang, Abdella Battou

    We propose a new distributed optimization algorithm for solving a class of constrained optimization problems in which (a) the objective function is separable (i.e., the sum of local objective functions of agents), (b) the optimization variables of distributed agents, which are subject to nontrivial local constraints, are coupled by global constraints, and (c) only noisy observations are available to estimate (the gradients of) local objective functions. In many practical scenarios, agents may not be willing to share their optimization variables with others. For this reason, we propose a distributed algorithm that does not require the agents to share their optimization variables with each other; instead, each agent maintains a local estimate of the global constraint functions and shares the estimate only with its neighbors. These local estimates of constraint functions are updated using a consensus-type algorithm, while the local optimization variables of each agent are updated using a first-order method based on noisy estimates of gradient. We prove that, when the agents adopt the proposed algorithm, their optimization variables converge with probability 1 to an optimal point of an approximated problem based on the penalty method.