000000260 001__ 260
000000260 005__ 20190812204617.0
000000260 037__ $$aCONF
000000260 245__ $$aDelay Bounds in a Network with Aggregate Scheduling
000000260 269__ $$a2000
000000260 260__ $$c2000
000000260 336__ $$aConference Papers
000000260 520__ $$aA large number of products implementing aggregate buffering and scheduling mechanisms have been developed and deployed, and still more are under development. With the rapid increase in the demand for reliable end-to-end QoS solutions, it becomes increasingly important to understand the implications of aggregate scheduling on the resulting QoS capabilities. This document studies the bounds on the worst case delay in a network implementing aggregate scheduling. A lower bound on the worst case delay is derived. It is shown that in a general network configuration the delays achieved with aggregate scheduling are very sensitive to utilization and can in general be quite high. It is also shown that for a class of network configurations described in the paper it is possible to give an upper bound that provides reasonable worst case delay guarantees for reasonable utilization numbers. These bounds are a function of network utilization, maximum hop count of any flow, and the shaping parameters at the network ingress. It is also argued that for a general network configuration and utilization numbers which are independent on the maximum hop count, an upper bound on delay, if it exists, must be a function of the number of nodes and/or the number of flows in the network.
000000260 6531_ $$aExpedited Forwarding
000000260 6531_ $$aDifferentiated Services
000000260 6531_ $$aNetwork Calculus
000000260 700__ $$aCharny, Anna
000000260 700__ $$g105633$$aLe Boudec, Jean-Yves$$0241098
000000260 7112_ $$cBerlin$$aQOFIS
000000260 773__ $$tQOFIS
000000260 8564_ $$zn/a$$uhttps://infoscience.epfl.ch/record/260/files/CharnyL00.ps$$s896967
000000260 909C0 $$xUS00024$$pLCA$$0252614
000000260 909C0 $$0252453$$xU10427$$pLCA2
000000260 909CO $$qGLOBAL_SET$$pconf$$pIC$$ooai:infoscience.tind.io:260
000000260 937__ $$aLCA-CONF-2000-009
000000260 970__ $$a410/LCA
000000260 973__ $$sPUBLISHED$$aEPFL
000000260 980__ $$aCONF