W. J. Dally and B. Towles, Route packets, net wires, Proceedings of the 38th conference on Design automation , DAC '01, 2001.
DOI : 10.1145/378239.379048

Z. Lu, M. Millberg, A. Jantsch, A. C. Bruce, P. Van-der-wolf et al., Flow regulation for on-chip communication, Design, Automation and Test in Europe, pp.578-581, 2009.

S. Saidi, R. Ernst, S. Uhrig, H. Theiling, and B. D. De-dinechin, The shift to multicores in real-time and safety-critical systems, 2015 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS), pp.220-229, 2015.
DOI : 10.1109/CODESISSS.2015.7331385

J. Boudec and P. Thiran, Network Calculus: A Theory of Deterministic Queuing Systems for the Internet, 2012.

A. E. Kiasari, A. Jantsch, and Z. Lu, Mathematical formalisms for performance evaluation of networks-on-chip, ACM Computing Surveys, vol.45, issue.3, p.38, 2013.
DOI : 10.1145/2480741.2480755

T. Ferrandiz, F. Frances, and C. Fraboul, Worst-case end-to-end delays evaluation for SpaceWire networks, Discrete Event Dynamic Systems, vol.36, issue.5, pp.339-357, 2011.
DOI : 10.1109/TC.1987.1676939

H. Ayed, J. Ermont, J. Scharbarg, and C. Fraboul, Towards a unified approach for worst-case analysis of tilera-like and kalraylike noc architectures, Proc. of the 12th IEEE World Conf. on Factory Communication Systems WiP Session, 2016.

Y. Qian, Z. Lu, and W. Dou, Analysis of worst-case delay bounds for best-effort communication in wormhole networks on chip, 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip, pp.44-53, 2009.
DOI : 10.1109/NOCS.2009.5071444

J. Georges, T. Divoux, and E. Rondeau, Network Calculus: Application to switched real-time networking, Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, pp.399-407, 2011.
DOI : 10.4108/icst.valuetools.2011.245944

URL : https://hal.archives-ouvertes.fr/hal-00595156

A. Bouillard and G. Stea, Worst-Case Analysis of Tandem Queueing Systems Using Network Calculus, Quantitative Assessments of Distributed Systems, Bruneo and Distefano, 2015.
DOI : 10.1145/2480730.2480738

URL : https://hal.archives-ouvertes.fr/hal-01272090

Y. Long, Z. Lu, and X. Yan, Analysis and evaluation of perflow delay bound for multiplexing models, Proc. of the Design, Automation and Test in Europe Conference and Exhibition (DATE), pp.1-4, 2014.

B. Dupont-de-dinechin, D. Van-amstel, M. Poulhì, and G. Lager, Time-critical computing on a single-chip massively parallel processor, Design, Automation and Test in Europe Conference and Exhibition (DATE), pp.1-6, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01090449

B. Dupont-de-dinechin and A. Graillat, Network-on-chip service guarantees on the kalray mppa-256 bostan processor Workshop on Advanced Interconnect Solutions and Technologies for Emerging Computing Systems ? AISTECS '17, 2017. [15] ?? Feed-forward routing for the wormhole switching networkon-chip of the kalray mppa2 processor, Proc. of the 2nd Inter Proceedings of the 10th International Workshop on Network on Chip Architectures, ser. No- CArc'17, pp.1-10, 2017.

A. Frangioni, L. Galli, and G. Stea, Optimal Joint Path Computation and Rate Allocation for Real-time Traffic, The Computer Journal, vol.58, issue.6, pp.1416-1430, 2014.
DOI : 10.1093/comjnl/bxu053

W. J. Dally and C. L. Seitz, Deadlock-Free Message Routing in Multiprocessor Interconnection Networks, IEEE Transactions on Computers, vol.36, issue.5, pp.547-553, 1987.
DOI : 10.1109/TC.1987.1676939

URL : https://authors.library.caltech.edu/26907/1/5206-TR-86.pdf

W. Dally and B. Towles, Principles and Practices of Interconnection Networks, 2004.

J. B. Schmitt and F. A. Zdarsky, The DISCO network calculator, Proceedings of the 1st international conference on Performance evaluation methodolgies and tools , valuetools '06, 2006.
DOI : 10.1145/1190095.1190105

URL : http://disco.informatik.uni-kl.de/publications/GZMS08-1.pdf

C. J. Glass and L. M. Ni, The turn model for adaptive routing, Proceedings of the 19th Annual International Symposium on Computer Architecture, ser. ISCA '92, pp.278-287, 1992.

G. Chiu, The odd-even turn model for adaptive routing, IEEE Transactions on Parallel and Distributed Systems, vol.11, issue.7, pp.729-738, 2000.
DOI : 10.1109/71.877831

P. Bahrebar and D. Stroobandt, The Hamiltonian-based odd???even turn model for maximally adaptive routing in 2D mesh networks-on-chip, Computers & Electrical Engineering, vol.45, pp.386-401, 2015.
DOI : 10.1016/j.compeleceng.2014.12.009

D. Starobinski, M. G. Karpovsky, and L. Zakrevski, Application of network calculus to general topologies using turn-prohibition, Proc. IEEE INFOCOM 2002, pp.1151-1159, 2002.

L. B. Levitin, M. G. Karpovsky, and M. Mustafa, Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks, IEEE Transactions on Parallel and Distributed Systems, vol.21, issue.9, pp.1342-1353, 2010.
DOI : 10.1109/TPDS.2009.174

M. Fidler and G. Einhoff, Routing in turn-prohibition based feedforward networks Networking Technologies , Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third Int. IFIP-TC6 Networking Conference, 2004.

S. Chen and K. Nahrstedt, Maxmin Fair Routing in Connection- Oriented Networks, Proc. of Euro-Parallel and Distributed Systems Conference (Euro-PDS '98), pp.163-168, 1998.

E. Amaldi, S. Coniglio, L. G. Gianoli, and C. U. Ileri, On single-path network routing subject to max-min fair flow allocation, Electronic Notes in Discrete Mathematics, vol.41, pp.543-550, 2013.
DOI : 10.1016/j.endm.2013.05.136

D. Nace, A linear programming based approach for computing optimal fair splittable routing, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications, 2002.
DOI : 10.1109/ISCC.2002.1021717

V. Firoiu, J. Y. Boudec, D. Towsley, and Z. Zhang, Theories and models for Internet quality of service, Proc.of the IEEE, pp.1565-1591, 2002.
DOI : 10.1109/JPROC.2002.802002

F. Frances, C. Fraboul, and J. Grieu, Using network calculus to optimize AFDX network, Proceeding of the 3thd European congress on Embedded Real Time Software (ERTS06), 2006.

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, 2011.
DOI : 10.1145/2071589.2071595