Exact worst-case delay for FIFO-multiplexing tandems

Proceedings of the 2012 6th International ICST Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2012

Volumn , Issue , 2012, Pages 158-167

  Bouillard, Anne ^a   Stea, Giovanni ^b  

^a INRIA   (France)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; DELAY BOUND; END TO END DELAY; LINEAR PROGRAMMING PROBLEM; LP PROBLEM; NUMBER AND SIZE; OPTIMAL SOLUTIONS; PIECEWISE LINEAR; WORST CASE SCENARIO;

PIECEWISE LINEAR TECHNIQUES; TELECOMMUNICATION SERVICES;

MULTIPLEXING;

EID: 84871890694     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4108/icst.valuetools.2012.250090     Document Type: Conference Paper

References (17)

1. L. Bisti, L. Lenzini, E. Mingozzi, and G. Stea. Estimating the worstcase delay in FIFO tandems using network calculus. In Proceedings of Valuetools '2008, 2008.
2. L. Bisti, L. Lenzini, E. Mingozzi, and G. Stea. Deborah: A tool for worst-case analysis of FIFO tandems. In Proceedings of ISoLA 2010, Special Track on Worst-case Traversal Time, 2010.
3. L. Bisti, L. Lenzini, E. Mingozzi, and G. Stea. Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks. Springer Real-Time Systems Journal, 2012.
4. S. Blake, D. B lack, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An Architecture for Differentiated Services. IETF, 1998.
5. A. Bouillard, L. Jouhet, and E. Thierry. Tight performance bounds in the worst-case analysis of feed-forward networks. In Proceedings of Infocom '2010, 2010.
6. A. Bouillard and A. Junier. Worst-case delay bounds with fixed priorities using network calculus,. In Proceedings of Valuetools '11, 2011.
7. S. Chakraborty, S. Kuenzli, L. Thiele, A. Herkersdorf, and P. Sagmeister. Performance evaluation of network processor architectures: Combining simulation with analytical estimation. Computer Networks, 42(5):641-665, 2003.
8. R. L. Cruz. A calculus for network delay, part I: Network elements in isolation. IEEE Transactions on Information Theory, 37(1): 114-131, 1991.
9. R. L. Cruz. A calculus for network delay, part II: Network analysis. IEEE Transactions on Iriformation Theory, 37(1): 132-141, 1991.
10. A. Koubaa, M. Alves, and E. Tovar. Modeling and worst-case dimensioning of cluster-tree wireless sensor networks. In Proceedings of IEEE RTSSS '06, pages 412-421, 2006.
11. J.-Y. Le Boudec and P. Thiran. Network Calculus: A Theory of Deterministic Queuing Systems for the internet, volume LNCS 2050. Springer-Verlag, revised version 4, may 10, 2004 edition, 2001.
12. L. Lenzini, L. Martorini, E. Mingozzi, and G. Stea. Tight end-toend per-flow delay bounds in FIFO multiplexing sink-tree networks. Performance Evaluation, 63(9-10):956-987, 2006.
13. L. Lenzini, E. Mingozzi, and G. Stea. A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems. Performance Evaluation, 65(11-12): 922-943, 2008.167
14. E. Rosen, A. Viswanathan, and R. Calion. Multiprotocol Label Switching Architecture. IETF, 2001.
15. J. B. Schmitt and U. Roedig. Sensor network calculus: A framework for worst case analysis. In Proceedings of1st International Coriference on Distributed Computing in Sensor Systems, pages 141-154, 2005.
16. J. B. Schmitt, F. A. Zdarsky, and M. Fidler. Delay bounds under arbitrary multiplexing: When network calculus leaves you in the lurch⋯ In Proceedings of INFO COM'2008, 2008.
17. T. Skeie, S. Johannessen, and O. Holmeide. Timeliness of real-time IP communication in switched industrial ethernet networks. IEEE Transactions on Industrial Informatics, 2:25-39, 2006.