Le Boudec, Jean-YvesThiran, Patrick2004-08-312004-08-312004-08-31199810.1109/IZSBC.1998.67027https://infoscience.epfl.ch/handle/20.500.14299/194616WOS:000073940500039We model some lossless queuing systems arising in guaranteed service networks as non-linear min-plus systems that can be bounded by linear systems. We introduce the distinction between space and time methods for such systems. Space methods are related to min-plus system theory, while time methods borrow from dynamic programming and exploit the causality of the operators. We apply this to the window flow control problem previously studied by Cruz and OkinoGuaranteed Quality of ServiceATMDijkstra`s AlgorithmDynamic ProgrammingNetwork CalculusMin-Plus Algebratext::conference output::conference proceedings::conference paper