Program at a glance

Week Mon. 11 Tue. 12 Wed. 13 List

	Mon. 11	Tue. 12	Wed. 13
08:00 09:00 10:00 11:00 12:00 13:00 14:00 15:00 16:00 17:00 18:00 19:00 20:00 21:00 22:00	Registration 8:30 - 9:00 (30min) Registration Registration Opening session 9:00 - 9:15 (15min) Opening session Room N-132 Keynote 1: Queues on Interacting Networks 9:15 - 10:15 (1h) Keynote 1: Queues on Interacting Networks Room N-132 Maria Vlasiou Coffee break 10:15 - 10:45 (30min) Coffee break Session 1.A: Fluid models and limits Session 1.B: Energy-aware systems and game theory 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) Lunch 12:30 - 14:00 (1h30) Lunch University Centre (Háskólatorg) Session 2.A: Reinforcement learning for stochastic networks Session 2.B: Scheduling for queues 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) Coffee break 15:15 - 15:45 (30min) Coffee break Gather in front of conference building 15:45 - 16:00 (15min) Gather in front of conference building (bus departing at 4pm) Social event 16:00 - 22:00 (6h) Social event Social event	Session 3.A: Mean-field and scaling limits Session 3.B: Scheduling for queues II 8:30 - 10:15 (1h45) Session 3.A: Mean-field and scaling limits Room N-132 Bernardo D'Auria › A Mean-Field Model of Societal Trust Dynamics - Sindhu Chaudhary, Department of TELIN (Ghent University) 08:30-08:55 (25min) › Queueing models for load balancing with phase-type distributions of decision-to-action delays - Kazuma Abe, University of Tsukuba 08:55-09:20 (25min) › Scaling limits for workload processes in networks with dependent rates and durations - Ekaterina Kosarevskaia, Universiteit Leiden = Leiden University 09:20-09:45 (25min) › Stochastic analysis of a system of particles moving among heterogeneous nodes with fixed capacity - Alessia Rigonat, INRIA 09:45-10:10 (25min) 8:30 - 10:15 (1h45) Session 3.B: Scheduling for queues II Room N-131 Ata Baris › The BAR-SOT: Scheduling in Stochastic Networks as Optimal Transport - Harsha Honnappa, Purdue University [West Lafayette] 08:30-08:55 (25min) › Control vacations and average cost reductions - Camiel Koopmans, Mathematical Institute, Leiden University 08:55-09:20 (25min) › Preemption pays: optimal preemptive priority pricing in M/G/1 queues - Binyamin Oz, University of Auckland [Auckland] 09:20-09:45 (25min) › Dynamic Scheduling of a Multiclass Parallel-Server Queueing System: A Computational Method for High-Dimensional Problems - Ata Baris, University of Chicago Booth School of Business 09:45-10:10 (25min) Coffee break 10:15 - 10:45 (30min) Coffee break Keynote 2: Scheduling in Stochastic Networks with Constraints 10:45 - 11:45 (1h) Keynote 2: Scheduling in Stochastic Networks with Constraints Room N-132 Mark Squillante Takács award ceremony 11:45 - 12:50 (1h05) Takács award ceremony Room N-132 Lunch 12:50 - 14:00 (1h10) Lunch University Centre (Háskólatorg) Session 4.A: Estimation and information Session 4.B: Multi-skilled queueing systems 14:00 - 15:15 (1h15) Session 4.A: Estimation and information Room N-132 Erol Gelenbe › Uncovering the topology of a queueing network from population data - Michel Mandjes, University of Amsterdam 14:00-14:25 (25min) › Quick PH Fitting - Miklos Telek, Budapest University of Technology and Economics, MTA-BME Information Systems Research Group 14:25-14:50 (25min) › Age of Information in Multi-Server Status Update Systems - Nail Akar, Bilkent University 14:50-15:15 (25min) 14:00 - 15:15 (1h15) Session 4.B: Multi-skilled queueing systems Room N-131 Josu Doncel and Elene Anton › On the Performance of Dynamic Matching Models with Threshold-based Policies - Gontzal Sagastabeitia, Zientzia eta Teknologia Fakultatea [Euskal Herriko Unibertsitatea], Laboratoire Informatique de l'Université de Pau et des Pays de l'Adour 14:00-14:25 (25min) › Learning the SED policy in heterogeneous load-balancing queues - Sanne Van Kempen, Eindhoven University of Technology 14:25-14:50 (25min) › Matching Systems Associated with Level-Dependent Quasi-Birth-and-Death Process - Moyi Yang, Université de Versailles Saint-Quentin-en-Yvelines, DAVID 14:50-15:15 (25min) Coffee break 15:15 - 15:45 (30min) Coffee break Session 5.A: Product-form queueing systems 15:45 - 17:00 (1h15) Session 5.A: Product-form queueing systems Room N-132 Jacques Resing › A family of multiclass LCFS networks with a novel product-form solution - Giuliano Casale, Imperial College London 15:45-16:10 (25min) › Pass-and-swap queues, applications and extensions - Jan-Pieter Dorsman, University of Amsterdam 16:10-16:35 (25min) › Blocking policies for networks of finite capacity quasi-reversible nodes - Richard Boucherie, Mathematics of Operations Research [University of Twente] 16:35-17:00 (25min) Conference dinner 19:00 - 22:00 (3h) Conference dinner Conference dinner	Session 6.A: Laplace-Stieltjes transforms Session 6.B: Queueing systems for healthcare 8:30 - 9:45 (1h15) Session 6.A: Laplace-Stieltjes transforms Room N-132 Michel Mandjes › Exact analysis of transient behavior of finite-capacity MAP-driven queues - Rutgers Daniël, Leiden University 08:30-08:55 (25min) › Polling on a circle with batch arrivals - Jacques Resing, Eindhoven University of Technology 08:55-09:20 (25min) › Exit Problems for Additive-Increase Multiplicative-Decrease Markov-Modulated Processes - Bernardo D'Auria, Dipartimento di Matematica [Padova] 09:20-09:45 (25min) 8:30 - 9:45 (1h15) Session 6.B: Queueing systems for healthcare Room N-131 Guillaume Ballif › A two-class queueing model for transplant waiting lists with reneging patients - Thomas Debevere, Ghent University 08:30-08:55 (25min) › Allocation of clients to mental health homes - Rene Bekker, Vrije Universiteit Amsterdam [Amsterdam] 08:55-09:20 (25min) › Stochastic analysis of an emergency service with two levels sharing the servers. - Guillaume Ballif, Centre Inria de Paris 09:20-09:45 (25min) Keynote 3: Novel Multiclass Queueing Models for Road Traffic 9:45 - 10:45 (1h) Keynote 3: Novel Multiclass Queueing Models for Road Traffic Room N-132 Joris Walraevens Coffee break 10:45 - 11:15 (30min) Coffee break Session 7.A: Generating functions Session 7.B: Approximation methods 11:15 - 12:30 (1h15) Session 7.A: Generating functions Room N-132 Tuan Phung-Duc › Exit Times for a Discrete Markov Additive Process - Zbigniew Palmowski, Wrocław University of Science and Technology = Politechnika Wroclawska [Wrocław] 11:15-11:40 (25min) › A Single-Server Queueing Model with Bernoulli Catastrophes and Repair Times - Rein Nobel, Vrije Universiteit Amsterdam [Amsterdam] 11:40-12:05 (25min) › System contents and delays in two tandem queues with randomly alternating service - Bruneel Herwig, SMACS Research Group 12:05-12:30 (25min) 11:15 - 12:30 (1h15) Session 7.B: Approximation methods Room N-131 Marko Boon › Waiting time approximations for multi-server queues with Poisson arrivals and heterogeneous servers - Marko Boon, Eindhoven University of Technology 11:15-11:40 (25min) › Total Variance based Discrete Time Queueing Models - Dave Worthington, Lancaster University Management School, Lancaster University Management School 11:40-12:05 (25min) › Performance approximation of stationary and time-dependent retrial queues - Raik Stolletz, University of Mannheim 12:05-12:30 (25min) Lunch 12:30 - 14:00 (1h30) Lunch University Centre (Háskólatorg)

RSS Feed | Privacy | Accessibility