E. Altman, T. Basar, and R. Srikant, Nash equilibria for combined flow control and routing in networks: Asymptotic behavior for a large number of users, IEEE Transctions on Automatic Control, issue.6, pp.47917-930, 2002.

M. Andrews, Instability of FIFO in the permanent sessions model at arbitrarily small network loads, Proceedings of SODA'07, 2007.
DOI : 10.1145/1541885.1541894

B. Awerbuch and T. Leighton, A simple local-control approximation algorithm for multicommodity flow, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp.459-468, 1993.
DOI : 10.1109/SFCS.1993.366841

D. Bertsimas and D. Gamarnik, Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing, Journal of Algorithms, vol.33, issue.2, pp.296-318, 1999.
DOI : 10.1006/jagm.1999.1047

A. Bouillard and E. Thierry, An Algorithmic Toolbox for Network Calculus, Discrete Event Dynamic Systems, vol.8, issue.1, 2007.
DOI : 10.1007/s10626-007-0028-x

URL : https://hal.archives-ouvertes.fr/inria-00123643

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

J. Cohen, E. Jeannot, N. Padoy, and F. Wagner, Messages Scheduling for Parallel Data Redistribution between Clusters, IEEE Transactions on Parallel and Distributed Systems, vol.17, issue.10, pp.1163-1175, 2006.
DOI : 10.1109/TPDS.2006.141

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

M. Fidler, Extending the Network Calculus Pay Bursts Only Once Principle to Aggregate Scheduling, pp.19-34, 2003.
DOI : 10.1007/3-540-36480-3_2

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

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

J. B. Schmitt, F. A. Zdarsky, and I. Martinovic, Performance Bounds in Feed-Forward Networks under Blind Multiplexing, 2006.