000000351 001__ 351
000000351 005__ 20190316233051.0
000000351 037__ $$aCONF
000000351 245__ $$aBounds for Independent Regulated Inputs Multiplexed in a Service Curve Network Element
000000351 269__ $$a2001
000000351 260__ $$c2001
000000351 336__ $$aConference Papers
000000351 520__ $$aWe consider the problem of bounding the probability of buffer overflow in a network node receiving independent inputs that are each constrained by arrival curves, but that are served as an aggregate. Existing results (for example \cite{kesidis-00-b} and \cite{chang-01-a}) assume that the node is a constant rate server. However, in practice, one finds various types of schedulers that do not provide a constant service rate, and thus to which the existing bounds do not apply. Now many schedulers can be adequately abstracted by a service curve property. We extend the results in \cite{kesidis-00-b} and \cite{chang-01-a} to such cases. As a by-product, we also provide a slight improvement to the bound in \cite{chang-01-a}. Our bounds are valid for both discrete and continuous time models
000000351 6531_ $$aDifferentiated Services Network Calculus
000000351 700__ $$0244027$$aVojnovic, Milan$$g122205
000000351 700__ $$0241098$$aLe Boudec, Jean-Yves$$g105633
000000351 7112_ $$aInternet Performance Symposium (Globecom 01)$$cSan Antonio, Texas
000000351 773__ $$q1857-1861$$tInternet Performance Symposium (Globecom 01)
000000351 8564_ $$s146742$$uhttps://infoscience.epfl.ch/record/351/files/VojnovicL01b.ps$$zn/a
000000351 909C0 $$0252614$$pLCA$$xUS00024
000000351 909C0 $$0252453$$pLCA2$$xU10427
000000351 909CO $$ooai:infoscience.tind.io:351$$pconf$$pIC$$qGLOBAL_SET
000000351 937__ $$aLCA-CONF-2001-014
000000351 970__ $$a514/LCA
000000351 973__ $$aEPFL$$sPUBLISHED
000000351 980__ $$aCONF