000114766 001__ 114766
000114766 005__ 20190717172515.0
000114766 0247_ $$2doi$$a10.5075/epfl-thesis-3998
000114766 02470 $$2urn$$aurn:nbn:ch:bel-epfl-thesis3998-2
000114766 02471 $$2nebis$$a5472013
000114766 037__ $$aTHESIS
000114766 041__ $$aeng
000114766 088__ $$a3998
000114766 245__ $$aStability and bounds in aggregate scheduling networks
000114766 269__ $$a2008
000114766 260__ $$bEPFL$$c2008$$aLausanne
000114766 300__ $$a107
000114766 336__ $$aTheses
000114766 502__ $$aRene Cruz, David Starobinski, Patrick Thiran
000114766 520__ $$aWe study networks of FIFO nodes, where flows are constrained by arrival curves. A crucial question with these networks is: Can we derive a bound to the maximum delay that a packet can experience when traversing the network, and to the maximum queue size at each node? For a generic FIFO network these are still open issues: Some examples show that, contrary to common sense, no matter how low the maximum node utilization is in the network, it is possible to build an example of an unstable FIFO network. The importance of this issue lies in the necessity of hard bounds on packet delay and queue size, in order to enable QoS guarantees in these networks. For this reason we choose to tackle this problem through a deterministic approach, based on worst-case behavior. Our first result is the determination of a general method to derive sufficient conditions for the stability of a network: We show how, with a proper choice of the observed variables in the network and with the use of network calculus results, it is possible to derive the expression of an operator whose properties are associated to the stability of the network. Exploiting this method on a simple example, we first derive a generalization of the RIN result to heterogeneous settings and to leaky bucket constrained flows. Through some realistic examples, we show how this method allows networks to achieve a level of utilization which is more than three times larger than the best existing result. By applying the general method to three different variable classes, we derive some new sufficient conditions for stability, that perform largely better than all the main existing results, and we show how they can all be derived from the new sufficient conditions. Finally, we present a new formula for the computation of end-to-end delay bounds in a network of GR nodes.
000114766 6531_ $$aStability
000114766 6531_ $$aNetwork Calculus
000114766 6531_ $$aQuality of Service
000114766 6531_ $$aDifferentiated Services
000114766 6531_ $$aAggregate Scheduling
000114766 6531_ $$aStabilité
000114766 6531_ $$aNetwork Calculus
000114766 6531_ $$aQualité du Service
000114766 6531_ $$aServices Différenciés
000114766 6531_ $$aOrdonnancement Global
000114766 700__ $$0(EPFLAUTH)163922$$g163922$$aRizzo, Gianluca
000114766 720_2 $$aLe Boudec, Jean Yves$$edir.$$g105633$$0241098
000114766 8564_ $$zTexte intégral / Full text$$yTexte intégral / Full text$$uhttps://infoscience.epfl.ch/record/114766/files/EPFL_TH3998.pdf$$s896359
000114766 909C0 $$xU10427$$pLCA2$$0252453
000114766 909CO $$pthesis-bn2018$$pDOI$$pIC$$ooai:infoscience.tind.io:114766$$qDOI2$$qGLOBAL_SET$$pthesis
000114766 918__ $$dEDIC2005-2015$$bIC-SSC$$cISC$$aIC
000114766 919__ $$aLCA2
000114766 920__ $$b2008$$a2008-2-29
000114766 970__ $$a3998/THESES
000114766 973__ $$sPUBLISHED$$aEPFL
000114766 980__ $$aTHESIS