Worst-case delay bounds with fixed priorities using network calculus

VALUETOOLS 2011 - 5th International ICST Conference on Performance Evaluation Methodologies and Tools

Volumn , Issue , 2011, Pages 381-390

  Bouillard, Anne ^a   Junier, Aurore ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TOOLS;

DELAY BOUND; FIXED PRIORITIES; IN NETWORKS; LOWER BOUNDS; NETWORK CALCULUS; NUMERICAL EXPERIMENTS; WORST-CASE PERFORMANCE;

CALCULATIONS;

EID: 84897408306     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4108/Icst.valuetools.2011.245603     Document Type: Conference Paper

References (13)

1. A. Bouillard, L. Jouhet, and É. Thierry. Service curves in Network Calculus: dos and don'ts. Research Report RR-7094, INRIA, 2009.
2. A. Bouillard, L. Jouhet, and É. Thierry. Tight Performance Bounds in the Worst Case Analysis of Feed Forward Networks. In Proc. of INFOCOM'IO. IEEE, 2010.
3. M. Boyer and C. Fraboul. Tightening end to end delay upper bound for AFDX network calculus with rate latency FCFS servers using network calculus. In Proc. of WFGS'2008, 2008.
4. C. S. Chang. Performance Guarantees m Communication Networks. TNCS, Springer-Verlag, 2000.
5. J.-P. Georges, E. Rondeau, and T. Divoux. Evaluation of switched Ethernet in an industrial context by using the Network Calculus. In Proc. of fth IEEE Workshop on Factory Communication Systems, pages 19-26, 2002.
6. J.-Y. Le Boudée and P. Thiran. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet, volume LNCS 2050. Springer-Verlag, 2001. revised version 4, May 10, 2004.
7. L. Lenzini, L. Martorini, E. Mingozzi, and G. Stea. Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks. Performance Evaluation, 63(9-10):956-987, 2006. (Pubitemid 44037830)
8. M. Mavronicolas. Stability in Routing: Networks and Protocols. Bulletin of the EATCS, 74:119-134, 2001.
9. L. Saïdane, S. Azzaz, S. Martin, and P. Minet. FP/FIFO Scheduling: Deterministic Versus Probabilistic QoS Guarantees and P-Schedulability. In ICC, pages 518-523, 2007. (Pubitemid 351145588)
10. J. B. Schmitt, F. A. Zdarsky, and M. Fidler. Delay Bounds under Arbitrary Multiplexing. Technical report, University of Kaiserslautern, 2007.
11. J. B. Schmitt, F. A. Zdarsky, and M. Fidler. Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch ... In Proc. of INFO COM '2008, 2008.
12. L. Thiele, S. Chakraborty, M. Gries, A. Maxiaguine, and J. Greutert. Embedded Software in Network Processors Models and Algorithms. In Proc. of EMSOFT'2001, 2001.
13. H. Thomas, H. Kai-Stefïen, K. Ulrich, and G. Reinhard. Stochastic and deterministic performance evaluation of automotive CAN communication. Comput. Netw., 53:1171-1185, June 2009.