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

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, proceedings of ISoLA'10, Special Track on Worst-case Traversal Time, 2010.
DOI : 10.1109/SURV.2010.020110.00019

L. Bisti, L. Lenzini, E. Mingozzi, and G. Stea, Numerical analysis of worst-case endto-end delay bounds in FIFO tandem networks, 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, Composition of service curves in network calculus, Proceedings of the 1st International Workshop on Worst-Case Traversal Time, WCTT '11, pp.25-42, 2011.
DOI : 10.1145/2071589.2071594

A. Bouillard, B. Gaujal, S. Lagrange, and E. Thierry, Optimal routing for end-to-end guarantees using network calculus. Performance Evaluation, pp.11-12883, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00859086

A. Bouillard, L. Jouhet, and E. Thierry, Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis., Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools, 2008.
DOI : 10.4108/ICST.VALUETOOLS2008.4349

A. Bouillard, L. Jouhet, and E. Thierry, Service curves in Network Calculus: dos and don'ts, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00431674

A. Bouillard, L. Jouhet, and E. Thierry, Tight performance bounds in the worst-case analysis of feed-forward networks, proceedings 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, proceedings 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, pp.158-167, 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, proceedings of RTNS'12, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00544502

M. Boyer, J. Migge, and N. Navet, An efficient and simple class of functions to model arrival curve of packetised flows, Proceedings of the 1st International Workshop on Worst-Case Traversal Time, WCTT '11, pp.43-50, 2011.
DOI : 10.1145/2071589.2071595

P. Cappanera, L. Lenzini, A. Lori, G. Stea, and G. Vaglini, Efficient link scheduling for online admission control of real-time traffic in wireless mesh networks, Computer Communications, vol.34, issue.8, pp.922-934, 2011.
DOI : 10.1016/j.comcom.2011.02.004

P. Cappanera, L. Lenzini, A. Lori, G. Stea, and G. Vaglini, Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks, Computer Networks, vol.57, issue.11, pp.2301-2312, 2013.
DOI : 10.1016/j.comnet.2012.11.021

S. Chakraborty, S. Künzli, L. Thiele, A. Herkersdorf, and P. Sagmeister, Performance evaluation of network processor architectures: combining simulation with analytical estimation, Computer Networks, vol.41, issue.5, pp.641-665, 2003.
DOI : 10.1016/S1389-1286(02)00454-1

C. S. Chang, Performance Guarantees in Communication Networks, TNCS, 2000.

A. Charny and J. L. Boudec, Delay Bounds in a Network with Aggregate Scheduling, proceedings of QoFIS, 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. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

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 clustertree wireless sensor networks, proceedings of IEEE RTSSS'06, pp.412-421, 2006.

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-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks, Performance Evaluation, vol.63, issue.9-10, pp.9-10956, 2006.
DOI : 10.1016/j.peva.2005.10.003

L. Lenzini, E. Mingozzi, and G. Stea, Tradeoffs Between Low Complexity, Low Latency, and Fairness With Deficit Round-Robin Schedulers, IEEE/ACM Transactions on Networking, vol.12, issue.4, pp.681-693, 2004.
DOI : 10.1109/TNET.2004.833131

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.

A. K. Parekh and R. G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: the single-node case, IEEE/ACM Transactions on Networking (TON), vol.1, 1993.

J. B. Schmitt and U. Roedig, Sensor Network Calculus ??? A Framework for Worst Case Analysis, proceedings of 1st International Conference on Distributed Computing in Sensor Systems, pp.141-154, 2005.
DOI : 10.1007/11502593_13

J. B. Schmitt, F. A. Zdarsky, and M. Fidler, Delay bounds under arbitrary multiplexing, 2007.

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

J. B. Schmitt, F. A. Zdarsky, and I. Martinovic, Improving performance bounds in feedforward networks by paying multiplexing only once, proceedings of MMB'08, 2008.

M. Shreedhar and G. Varghese, Efficient fair queuing using deficit round-robin, IEEE/ACM Transactions on Networking, vol.4, issue.3, pp.375-385, 1996.
DOI : 10.1109/90.502236

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.1040

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. Stiliadis and A. Varma, Latency-rate servers: a general model for analysis of traffic scheduling algorithms, IEEE/ACM Transactions on Networking, vol.6, issue.5, pp.611-624, 1998.
DOI : 10.1109/90.731196

Y. Xu, F. Ren, T. He, C. Lin, C. Chen et al., Real-time routing in wireless sensor networks, ACM Transactions on Sensor Networks, vol.9, issue.3, p.2013
DOI : 10.1145/2480730.2480738