Le Boudec, Jean-YvesThiran, Patrick2004-08-312004-08-312004-08-31199810.1007/978-1-4615-5541-4_9https://infoscience.epfl.ch/handle/20.500.14299/58339We 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.Guaranteed Quality of ServiceATM%Queueing SystemsNetwork CalculusMin-Plus AlgebraNetwork Calculus using Min/Plus System Theorytext::book/monograph::book part or chapter