Publication

Prévention de la congestion dans le service “best-effort” des réseaux locaux ATM

Publications associées (119)

A Network Calculus Analysis of Asynchronous Mechanisms in Time-Sensitive Networks

Time-sensitive networks provide worst-case guarantees for applications in domains such as the automobile, automation, avionics, and the space industries. A violation of these guarantees can cause considerable financial loss and serious damage to human live ...

EPFL2023

Localizing Traffic Differentiation

Pavlos Nikolopoulos, Muhammad Abdullah, Zeinab Shmeis

Network neutrality is important for users, content providers, policymakers, and regulators interested in understanding how network providers differentiate performance. When determining whether a network differentiates against certain traffic, it is importa ...

2023

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

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

A multi-hop control scheme for traffic management

Kenan Zhang

We propose a multi-hop control scheme (MHCS) that aims to route traffic through a set of designated intermediate checkpoints (ICs). Because travelers are allowed to freely choose routes for each “hop” that connects real (origin and destination) and ICs, MH ...

2021

Data driven model free adaptive iterative learning perimeter control for large-scale urban road networks

Nikolaos Geroliminis, Isik Ilber Sirmatel, Ye Ren

Most perimeter control methods in literature are the model-based schemes designing the controller based on the available accurate macroscopic fundamental diagram (MFD) function with well known techniques of modern control methods. However, accurate modelin ...

PERGAMON-ELSEVIER SCIENCE LTD2020

Multi-Region Network Perimeter Control via Model Free Adaptive Iterative Learning Control

Nikolaos Geroliminis, Isik Ilber Sirmatel, Ye Ren

Most perimeter control methods in literature are the model-based schemes. However, accurate modeling of the traffic flow system is hard and time-consuming. On the other hand, macroscopic traffic flow patterns show heavily similarity between days, and data ...

2020

Dynamic Quantification of the Effect of Traffic Congestion on a Multilayer Network

The paper “Dynamic efficiency in multilayer transportation networks” (Bellocchi, Geroliminis, 2018) [1] introduced new performance measures to quantify dynamically the effect of traffic congestion in a multilayer network. Based on these measures, we explor ...

2020

Dynamic Transit Priority Lanes in Urban Networks

Together with signal priority, dedication of space to public transport has been the most widely used policy to improve bus operations. Permanent dedicated bus lanes however can lead to an under-utilization of the available space. Dierent strategies such as ...

2020

Area-based equitable pricing strategies for multimodal urban networks with heterogeneous users

Nikolaos Geroliminis, Nan Zheng

Equity issues among travellers are critical in congestion pricing. Failure to treat equity can lead to low acceptability towards pricing. In this paper, we develop congestion pricing schemes to improve both equity and traffic performance, for multimodal ne ...

PERGAMON-ELSEVIER SCIENCE LTD2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search