European Conference on Queueing Theory 2026

8:30 - 9:00 (30min)

Registration

9:00 - 9:15 (15min)

Opening session

Room N-132

9:15 - 10:15 (1h)

Keynote 1: Queues on Interacting Networks

Room N-132

Maria Vlasiou

10:15 - 10:45 (30min)

Coffee break

10:45 - 12:30 (1h45)

Session 1.A: Fluid models and limits

Room N-132

Miklos Telek

› How Small Changes Affect Fluid Queues: A Regular Perturbation Framework - Sarah Dendievel, ICHEC Brussels Management School, Department of Telin - SMACS Research Group - Ghent University 10:45-11:10 (25min)

› Multimodal Shared Queues with Threshold Switching: Performance Analysis and Optimization - Natarajan Gautam, Syracuse University 11:10-11:35 (25min)

› A Holistic Approach for Bitcoin Confirmation Times & Optimal Fee Selection - Stella Kapodistria, Eindhoven University of Technology 11:35-12:00 (25min)

› Fluid Limits for Highest Response Ratio Next Queues - Łukasz Kruk, Maria Curie-Sklodowska University 12:00-12:25 (25min)

10:45 - 12:30 (1h45)

Session 1.B: Energy-aware systems and game theory

Room N-131

René Bekker

› A non-cooperative game between sensor nodes in an Energy Packet Networks model - Josu Doncel, University of the Basque Country 10:45-11:10 (25min)

› Queueing Analysis Minimizes Energy Consumption in a Distributed System - Erol Gelenbe, Institute of Theoretical and Applied Informatics (Polish Academy of Sciences) 11:10-11:35 (25min)

› Multiserver Queues with Batch Arrivals and Setup Times - Tuan Phung-Duc, University of Tsukuba 11:35-12:00 (25min)

› A Queueing Game with Priority Pricing and Shared Capacity - Caitlin Vanden Bussche, Ghent University 12:00-12:25 (25min)

12:30 - 14:00 (1h30)

Lunch

University Centre (Háskólatorg)

14:00 - 15:15 (1h15)

Session 2.A: Reinforcement learning for stochastic networks

Room N-132

Matthieu Jonckheere

› Mean-Field Multi-Agent Reinforcement Learning For Buffered Cellular Network Optimization - Taisiia Morozova, Uppsala Universitet [Uppsala] 14:00-14:25 (25min)

› Particle systems for policy evaluation in Reinforcement Learning with sparse rewards - Ernesto GARCIA CIGANDA, Équipe Services et Architectures pour Réseaux Avancés 14:25-14:50 (25min)

› Instability of Local Algorithms in Infinite State Spaces - Matthieu Jonckheere, Équipe Services et Architectures pour Réseaux Avancés 14:50-15:15 (25min)

14:00 - 15:15 (1h15)

Session 2.B: Scheduling for queues

Room N-131

Douglas D. Down

› Mixed Stable Nash Equilibria in the M/M/1 Priority Queue with Deadline-Aware Customers - Rob Van der Mei, Centrum Wiskunde & Informatica (CWI), Vrĳe Universiteit Amsterdam (VU) 14:00-14:25 (25min)

› Scheduling and dispatching LLM inference tasks to minimize latency - Esa Hyytia, University of Iceland 14:25-14:50 (25min)

› Maximizing Throughput for Queues with Abandonments - Douglas D. Down, McMaster University 14:50-15:15 (25min)

15:15 - 15:45 (30min)

Coffee break

15:45 - 16:00 (15min)

Gather in front of conference building

(bus departing at 4pm)

16:00 - 22:00 (6h)

Social event

Program at a glance