H. Bauer, J. Scharbarg, and C. Fraboul, Improving the Worst-Case Delay Analysis of an AFDX Network Using an Optimized Trajectory Approach, IEEE Transactions on Industrial Informatics, vol.6, issue.4, pp.521-523, 2010.
DOI : 10.1109/TII.2010.2055877

H. Bauer, J. Scharbarg, and C. Fraboul, Applying trajectory approach with static priority queuing for improving the use of available AFDX resources. Real-Time Systems, pp.101-133, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00544508

L. Bisti, L. Lenzini, E. Mingozzi, and G. Stea, Estimating the Worst-case Delay in FIFO Tandems Using Network Calculus, Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools, 2008.
DOI : 10.4108/ICST.VALUETOOLS2008.4388

L. Bisti, L. Lenzini, E. Mingozzi, and G. Stea, DEBORAH: A Tool for Worst-Case Analysis of FIFO Tandems, proc. of ISoLA'10, Special Track on Worst-case Traversal Time, pp.152-168, 2010.
DOI : 10.1109/SURV.2010.020110.00019

L. Bisti, L. Lenzini, E. Mingozzi, and G. Stea, Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks. Real- Time Systems, pp.527-569, 2012.

S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang et al., An Architecture for Differentiated Services, 1998.
DOI : 10.17487/rfc2475

A. Bouillard, L. Jouhet, and E. Thierry, Tight performance bounds in the worst-case analysis of feed-forward networks, proc. of INFOCOM'10, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00408717

A. Bouillard and A. Junier, Worst-case delay bounds with fixed priorities using network calculus, proc. of Valuetools'11, 2011.

A. Bouillard and G. Stea, Exact Worst-case Delay for FIFO-multiplexing Tandems, Proceedings of the 6th International Conference on Performance Evaluation Methodologies and Tools, 2012.
DOI : 10.4108/valuetools.2012.250090
URL : https://hal.archives-ouvertes.fr/hal-00778113

M. Boyer, Half-modeling of shaping in FIFO net with network calculus, proc. of RTNS'12, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00544502

A. Charny and J. L. Boudec, Delay Bounds in a Network with Aggregate Scheduling, proc. of QoFIS'00, pp.1-13, 2000.
DOI : 10.1007/3-540-39939-9_1

R. L. Cruz, A calculus for network delay. I. Network elements in isolation, IEEE Transactions on Information Theory, vol.37, issue.1, pp.114-131, 1991.
DOI : 10.1109/18.61109

R. L. Cruz, A calculus for network delay. II. Network analysis, IEEE Transactions on Information Theory, vol.37, issue.1, pp.132-141, 1991.
DOI : 10.1109/18.61110

M. Fidler, Survey of deterministic and stochastic service curve models in the network calculus, IEEE Communications Surveys & Tutorials, vol.12, issue.1, pp.59-86, 2010.
DOI : 10.1109/SURV.2010.020110.00019

F. Jafari, A. Jantsch, and Z. Lu, Worst-case delay analysis of Variable Bit-Rate flows in network-on-chip with aggregate scheduling, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp.538-541, 2012.
DOI : 10.1109/DATE.2012.6176457

A. Koubaa, M. Alves, and E. Tovar, Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06), pp.412-421, 2006.
DOI : 10.1109/RTSS.2006.29

J. Boudec and P. Thiran, Network Calculus: A Theory of Deterministic Queuing Systems for the Internet, volume LNCS 2050, 2001.

L. Lenzini, L. Martorini, E. Mingozzi, and G. Stea, Tight end-toend per-flow delay bounds in FIFO multiplexing sink-tree networks, Performance Evaluation, vol.63, pp.9-10956, 2006.

L. Lenzini, E. Mingozzi, and G. Stea, Delay bounds for FIFO aggregates: a case study, Computer Communications, vol.28, issue.3, pp.287-299, 2005.
DOI : 10.1016/j.comcom.2004.10.003

L. Lenzini, E. Mingozzi, and G. Stea, A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems. Performance Evaluation, pp.11-12922, 2008.

S. Martin and P. Minet, Schedulability analysis of flows scheduled with FIFO: application to the expedited forwarding class, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006.
DOI : 10.1109/IPDPS.2006.1639424

S. Martin, P. Minet, and L. George, Deterministic End-to-End Guarantees for Real-Time Applications in a DiffServ-MPLS Domain, proc. of SERA, pp.51-73, 2003.
DOI : 10.1007/978-3-540-24675-6_8

J. B. Schmitt and U. Roedig, Sensor Network Calculus ??? A Framework for Worst Case Analysis, proc. of DCOSS'05, pp.141-154, 2005.
DOI : 10.1007/11502593_13

J. B. Schmitt, F. A. Zdarsky, and M. Fidler, Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch..., IEEE INFOCOM 2008, The 27th Conference on Computer Communications, 2008.
DOI : 10.1109/INFOCOM.2008.228

M. Schroeder, A. Birrell, M. Burrows, H. Murray, R. Needham et al., Autonet: a high-speed, self-configuring local area network using point-to-point links, IEEE Journal on Selected Areas in Communications, vol.9, issue.8, pp.91318-1335, 1991.
DOI : 10.1109/49.105178

T. Skeie, S. Johannessen, and O. Holmeide, Timeliness of Real-Time IP Communication in Switched Industrial Ethernet Networks, IEEE Transactions on Industrial Informatics, vol.2, issue.1, pp.25-39, 2006.
DOI : 10.1109/TII.2006.869934

D. Starobinski, M. Karpovsky, and L. Zakrevski, Application of network calculus to general topologies using turn-prohibition, IEEE/ACM Transactions on Networking, vol.11, issue.3, pp.411-421, 2003.
DOI : 10.1109/TNET.2003.813040