Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
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.