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