Exact Worst-Case Delay in FIFO-Multiplexing Feed-Forward Networks

Anne Bouillard 1, 2, 3 Giovanni Stea 4
2 DYOGENE - Dynamics of Geometric Networks
CNRS - Centre National de la Recherche Scientifique : UMR8548, Inria Paris-Rocquencourt, DI-ENS - Département d'informatique de l'École normale supérieure
Abstract : In this paper we compute the actual worst-case end-to-end delay for a flow in a feed-forward network of FIFO-multiplexing service curve nodes, where flows are shaped by piecewise-affine concave arrival curves, and service curves are piecewise affine and convex. We show that the worst-case delay problem can be formulated as a mixed integer-linear programming problem, whose size grows exponentially with the number of nodes involved. Furthermore, we present approximate solution schemes to find upper and lower delay bounds on the worst-case delay. Both only require to solve just one linear programming problem, and yield bounds which are generally more accurate than those found in the previous work, which are computed under more restrictive assumptions.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-01255070
Contributor : Anne Bouillard <>
Submitted on : Wednesday, January 13, 2016 - 10:41:38 AM
Last modification on : Thursday, October 17, 2019 - 12:36:05 PM
Long-term archiving on: Saturday, April 16, 2016 - 6:30:11 AM

File

TNET_2014_Camera_Ready.pdf
Files produced by the author(s)

Identifiers

Citation

Anne Bouillard, Giovanni Stea. Exact Worst-Case Delay in FIFO-Multiplexing Feed-Forward Networks. IEEE/ACM Transactions on Networking, IEEE/ACM, 2015, IEEE/ACM Transactions on Networking, 23 (5), pp.1387 - 1400 ⟨10.1109/TNET.2014.2332071⟩. ⟨hal-01255070⟩

Share

Metrics

Record views

581

Files downloads

321