Publications associées à Nœud (réseau)

Estimating the Topology of Preferential Attachment Graphs Under Partial Observability

This work addresses the problem of learning the topology of a network from the signals emitted by the network nodes. These signals are generated over time through a linear diffusion process, where neighboring nodes exchange messages according to the underl ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Seyed Mohammadhossein Tabatabaee

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

EPFL2023

Two-layer adaptive signal control framework for large-scale networks combining efficient Max-Pressure and Perimeter Control

Nikolaos Geroliminis, Dimitrios Tsitsokas, Anastasios Kouvelas

This work investigates the benefits of a two-layer adaptive signal control framework combining multi-region perimeter control (PC) with distributed Max Pressure (MP) control in selected network intersections. Motivated by MP’s questionable performance in o ...

2022

Critical node selection method for efficient Max-Pressure traffic signal control in large-scale congested networks

Nikolaos Geroliminis, Dimitrios Tsitsokas, Anastasios Kouvelas

Decentralized signal control of congested traffic networks based on the Max-Pressure (MP) controller is theoretically proven to maximize throughput, stabilize the system and balance queues for single intersections under specific conditions. However, its pe ...

2022

Large-scale traffic signal control and multimodal network design

Dimitrios Tsitsokas

Traffic congestion constitutes one of the most frequent, yet challenging, problems to address in the urban space. Caused by the concentration of population, whose mobility needs surpass the serving capacity of urban networks, congestion cannot be resolved ...

EPFL2022

Learning Bollobas-Riordan Graphs Under Partial Observability

Ali H. Sayed, Michele Cirillo

This work examines the problem of learning the topology of a network (graph learning) from the signals produced at a subset of the network nodes (partial observability). This challenging problem was recently tackled assuming that the topology is drawn acco ...

IEEE2021

Deposition of Thin Alumina Films Containing 3D Ordered Network of Nanopores on Porous Substrates

Martina Lihter

Self-supporting thin films containing nanopores are very promising materials for use for multiple applications, especially in nanofiltration. Here, we present a method for the production of nanomembranes containing a 3D ordered network of nanopores in an a ...

2020

The Cost of Scaling a Reliable Interconnection Topology

Rachid Guerraoui, Alexandre David Olivier Maurer

In distributed computing, many papers try to evaluate the message complexity of a distributed system as a function of the number of nodes n. But what about the cost of building the distributed system itself? Assuming that we want to reliably connect n node ...

2020

On Time Synchronization Issues in Time-Sensitive Networks with Regulators and Nonideal Clocks

Jean-Yves Le Boudec, Ludovic Bernard Gérard Thomas

Flow reshaping is used in time-sensitive networks (as in the context of IEEE TSN and IETF Detnet) in order to reduce burstiness inside the network and to support the computation of guaranteed latency bounds. This is performed using per-flow regulators (suc ...

Association for Computing Machinery2020

Optimized Quantization in Distributed Graph Signal Filtering

Pascal Frossard, Isabela Cunha Maia Nobre

Distributed graph signal processing algorithms require the network nodes to communicate by exchanging messages in order to achieve a common objective. These messages have a finite precision in realistic networks, which may necessitate to implement message ...

2019

Percolation and Internet Science

Emanuele Massaro

Percolation, in its most general interpretation, refers to the “flow” of something (a physical agent, data or information) in a network, possibly accompanied by some nonlinear dynamical processes on the network nodes (sometimes denoted reaction–diffusion s ...

2019

Retroactive Packet Sampling for Traffic Receipts

Pavlos Nikolopoulos, Adrian Perrig, Christos Pappas

Is it possible to design a packet-sampling algorithm that prevents the network node that performs the sampling from treating the sampled packets preferentially? We study this problem in the context of designing a "network transparency" system. In this syst ...

ACM2019

Detection Under One-Bit Messaging Over Adaptive Networks

Ali H. Sayed

This paper studies the operation of multi-agent networks engaged in binary decision tasks, and derives performance expressions and performance operating curves under challenging conditions with some revealing insights. One of the main challenges in the ana ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Systems and methods for rate-compatible polar codes for general channels

Seyed Hamed Hassani, Marco Mondelli

According to certain embodiments, a transmit node in a wireless communications system includes a first universal rate-compatible polar encoder and a transmitter. The first universal rate-compatible polar encoder is configured for a family of two or more ty ...

2019

Experimental Validation of the Suitability of Virtualization-Based Replication for Fault Tolerance in Real-Time Control of Electric Grids

Jean-Yves Le Boudec, Wajeb Saab, Maaz Mashood Mohiuddin, Jalal Mostafa, Seyed Alireza Sanaee Kohroudi

Real-time control systems (RTCSs) perform complex control and require low response times. They typically use third-party software libraries and are deployed on generic hardware, which suffer from delay faults that can cause serious damage. To improve avail ...

2018

Atomic object reads for in-memory rack-scale computing

Babak Falsafi, Boris Robert Grot, Alexandros Daglis

A distributed memory system including a plurality of chips, a plurality of nodes that are distributed across the plurality of chips such that each node is comprised within a chip, each node includes a dedicated local memory and a processor core, and each l ...

2018

Improved Utility-based Congestion Control for Low-Delay Communication

Pascal Frossard, Laura Toni, Sergio Mena, Stefano D'Aronco

Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to prope ...

Ieee-Inst Electrical Electronics Engineers Inc2017

iPRP - the Parallel Redundancy Protocol for IP Networks: Protocol Design and Operation

Jean-Yves Le Boudec, Dan-Cristian Tomozei, Miroslav Popovic, Maaz Mashood Mohiuddin

Reliable packet delivery within stringent delay-constraints is of paramount importance to mission-critical computer applications with hard real-time constraints. Because retransmission and coding techniques counteract the delay requirements, reliability ma ...

Institute of Electrical and Electronics Engineers2016

iPRP: Parallel Redundancy Protocol for IP Networks

Jean-Yves Le Boudec, Dan-Cristian Tomozei, Miroslav Popovic, Maaz Mashood Mohiuddin

Reliable packet delivery within stringent delay constraints is of primal importance to industrial processes with hard real-time constraints, such as electrical grid monitoring. Because retransmission and coding techniques counteract the delay requirements, ...

2015

Flexible Spectrum Assignment for Local Wireless Networks

Julien Pierre Sacha Herzen

In this dissertation, we consider the problem of assigning spectrum to wireless local-area networks (WLANs). In line with recent IEEE 802.11 amendments and newer hardware capabilities, we consider situations where wireless nodes have the ability to adapt n ...

EPFL2015