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

In this paper, we compute the actual worst-case end-to-end delay for a flow in a feed-forward network of first-in-first-out (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 that are generally more accurate than those found in the previous work, which are computed under more restrictive assumptions.

[1]  Jean-Yves Le Boudec,et al.  Delay Bounds in a Network with Aggregate Scheduling , 2000, QofIS.

[2]  Luciano Lenzini,et al.  Delay bounds for FIFO aggregates: a case study , 2005, Comput. Commun..

[3]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[4]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[5]  Luciano Lenzini,et al.  Estimating the worst-case delay in FIFO tandems using network calculus , 2008, VALUETOOLS.

[6]  Axel Jantsch,et al.  Worst-case delay analysis of Variable Bit-Rate flows in network-on-chip with aggregate scheduling , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[7]  Eric Thierry,et al.  Tight performance bounds in the worst-case analysis of feed-forward networks , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[9]  Steven Martin,et al.  Schedulability analysis of flows scheduled with FIFO: application to the expedited forwarding class , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[10]  Christian Fraboul,et al.  Improving the Worst-Case Delay Analysis of an AFDX Network Using an Optimized Trajectory Approach , 2010, IEEE Transactions on Industrial Informatics.

[11]  Eduardo Tovar,et al.  Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[12]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[13]  Mark G. Karpovsky,et al.  Application of network calculus to general topologies using turn-prohibition , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Luciano Lenzini,et al.  A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems , 2008, Perform. Evaluation.

[15]  Utz Roedig,et al.  Sensor Network Calculus - A Framework for Worst Case Analysis , 2005, DCOSS.

[16]  Giovanni Stea,et al.  Exact worst-case delay for FIFO-multiplexing tandems , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[17]  Luciano Lenzini,et al.  Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks , 2012, Real-Time Systems.

[18]  Luciano Lenzini,et al.  DEBORAH: A Tool for Worst-Case Analysis of FIFO Tandems , 2010, ISoLA.

[19]  Luciano Lenzini,et al.  Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks , 2006, Perform. Evaluation.

[20]  Eric Thierry,et al.  Tight performance bounds in the worst-case analysis of feed-forward networks , 2016, Discret. Event Dyn. Syst..

[21]  Anne Bouillard,et al.  Worst-case delay bounds with fixed priorities using network calculus , 2011, VALUETOOLS.

[22]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[23]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[24]  Christian Fraboul,et al.  Applying Trajectory approach with static priority queuing for improving the use of available AFDX resources , 2011, Real-Time Systems.

[25]  Jens B. Schmitt,et al.  Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch... , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[26]  Markus Fidler,et al.  Survey of deterministic and stochastic service curve models in the network calculus , 2009, IEEE Communications Surveys & Tutorials.

[27]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[28]  Tor Skeie,et al.  Timeliness of real-time IP communication in switched industrial Ethernet networks , 2006, IEEE Transactions on Industrial Informatics.

[29]  Marc Boyer.  Half-modeling of shaping in FIFO net with network calculus , 2010 .

[30]  Laurent George,et al.  Deterministic End-to-End Guarantees for Real-Time Applications in a DiffServ-MPLS Domain , 2003, SERA.