Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
We model some lossless queuing systems arising in guaranteed service networks as non-linear min-plus systems that can be bounded by linear systems. We propose a methodology and apply it to the window flow control problem previously studied by Cruz and Okino, Chang, Agrawal and Rajan. We explain the existing bounds and derive a refined, tighter bound. We also show how the same method can be used to model also systems with losses.
Andrea Zanoni, Grigorios A. Pavliotis
François Gallaire, Edouard Boujo, Yves-Marie François Ducimetière