Admission Shaping With Network Calculus

Several techniques can be used for computing deterministic performance bounds in FIFO networks. The most popular one, as far as Network Calculus is concerned, is Total Flow Analysis (TFA). Its advantages are its algorithmic efficiency, acceptable accuracy and adapted to general topologies. However, handling cyclic dependencies is mostly solved for token-bucket arrival curves. Moreover, in many situations, flows are shaped at their admission in a network, and the network analysis does not fully take advantage of it. In this letter, we generalize the approach to piece-wise linear concave arrival curves and to shaping several flows together at their admission into the network. We show through numerical evaluation that the performance bounds are drastically improved.