4 citations · 4 across the 10 of their papers we have counts for
12 papers
Hybrid Monitoring for Early Fault Detection in Cloud-Native 5G Systems
Anton Andersson, Sai Akshara Naineni, Mats Jansborg +2
This paper presents the design implementation and evaluation of NetMon a hybrid network monitoring system designed for Kubernetes-based 5G packet core deployments specifically eval…
A Feature-Rich Embedded NIDS with eBPF/XDP: Detector and Architecture Trade-offs
Shiqi Wu, Oleksii Koshovyi, Georgios Pseiridis Pseiras +2
Distributed Denial-of-Service (DDoS) attacks remain a serious threat to transport networks, with recent attack volumes exceeding 30 Tbps, and the telecommunications industry being…
Securing High-Performance Data Transfers: Implementing AES Encryption in RDMA Systems
Erik Bångsbo, Zakaria Hersi, Anna Benktson +2
Remote Direct Memory Access (RDMA) is a key enabler of high-performance systems, offering low latency, high throughput, and reduced CPU overhead by allowing direct memory-to-memory…
Not All Neighbors Matter: Understanding the Impact of Graph Sparsification on GNN Pipelines
Yuhang Song, Naima Abrar Shami, Romaric Duvignau +1
As graphs scale to billions of nodes and edges, graph Machine Learning workloads are constrained by the cost of multi-hop traversals over exponentially growing neighborhoods. While…
The TCF doesn't really A(A)ID -- Automatic Privacy Analysis and Legal Compliance of TCF-based Android Applications
Victor Morel, Cristiana Santos, Pontus Carlsson +2
The Transparency and Consent Framework (TCF), developed by the Interactive Advertising Bureau (IAB) Europe, provides a de facto standard for requesting, recording, and managing use…
How Feasible are Passive Network Attacks on 5G Networks and Beyond? A Survey
Atmane Ayoub Mansour Bahar, Andrés Alayón Glazunov, Romaric Duvignau
Privacy concerns around 5G, the latest generation of mobile networks, are growing, with fears that its deployment may increase exposure to privacy risks. This perception is largely…
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
Romaric Duvignau, Noël Gillet, Ralf Klasing
Finding a maximum-weight matching is a classical and well-studied problem in computer science, solvable in cubic time in general graphs. We consider the specialization called assig…
Self-stabilizing Byzantine Multivalued Consensus
Romaric Duvignau, Michel Raynal, Elad Michael Schiller
Consensus, abstracting a myriad of problems in which processes have to agree on a single value, is one of the most celebrated problems of fault-tolerant distributed computing. Cons…
Self-stabilizing Byzantine Fault-tolerant Repeated Reliable Broadcast
Romaric Duvignau, Michel Raynal, Elad Michael Schiller
We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distribute…
Geographical Peer Matching for P2P Energy Sharing
Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou +1
Significant cost reductions attract ever more households to invest in small-scale renewable electricity generation and storage. Such distributed resources are not used in the most…
Self-stabilizing Byzantine- and Intrusion-tolerant Consensus
Romaric Duvignau, Michel Raynal, Elad Michael Schiller
One of the most celebrated problems of fault-tolerant distributed computing is the consensus problem. It was shown to abstract a myriad of problems in which processes have to agree…
Piecewise Linear Approximation in Data Streaming: Algorithmic Implementations and Experimental Analysis
Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou +1
Piecewise Linear Approximation (PLA) is a well-established tool to reduce the size of the representation of time series by approximating the series by a sequence of line segments w…