D. P. Anderson, BOINC: A System for Public-Resource Computing and Storage, Fifth IEEE/ACM International Workshop on Grid Computing, pp.365-372, 2004.
DOI : 10.1109/GRID.2004.14

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-459, 1993.
DOI : 10.1109/SFCS.1993.366841

B. Awerbuch and T. Leighton, Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , STOC '94, p.496, 1994.
DOI : 10.1145/195058.195238

C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand et al., Scheduling strategies for master-slave tasking on heterogeneous processor platforms, IEEE Transactions on Parallel and Distributed Systems, vol.15, issue.4, 2004.
DOI : 10.1109/TPDS.2004.1271181

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

C. Banino-rokkones, O. Beaumont, and H. Rejeb, Scheduling Techniques for Effective System Reconfiguration in Distributed Storage Systems, 2008 14th IEEE International Conference on Parallel and Distributed Systems, pp.80-87, 2008.
DOI : 10.1109/ICPADS.2008.109

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

H. Casanova, NETWORK MODELING ISSUES FOR GRID APPLICATION SCHEDULING, International Journal of Foundations of Computer Science, vol.16, issue.02, pp.145-162, 2005.
DOI : 10.1142/S0129054105002929

H. Casanova and L. Marchal, A network model for simulation of grid application. RR-40, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00071989

M. Castro, P. Druschel, A. M. Kermarrec, A. Nandi, A. Rowstron et al., SplitStream, ACM SIGOPS Operating Systems Review, vol.37, issue.5, pp.298-313, 2003.
DOI : 10.1145/1165389.945474

J. Edmonds, Edge disjoint branchings, Combinatorial Algorithms, p.91, 1972.

L. Eyraud-dubois, A. Legrand, M. Quinson, and F. Vivien, A First Step Towards Automatically Building Network Representations, Lecture Notes in Computer Science, vol.4641, p.160, 2007.
DOI : 10.1007/978-3-540-74466-5_18

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

H. N. Gabow and K. Manu, Packing algorithms for arborescences (and spanning trees) in capacitated graphs, Mathematical Programming, vol.82, issue.1, pp.83-109, 1998.

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Mathematics, vol.5, issue.2, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

B. Hong and V. K. Prasanna, Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 2004.
DOI : 10.1109/IPDPS.2004.1302974

B. Hubert, Linux Advanced Routing & Traffic Control. Chapter 9 Queueing Disciplines for Bandwidth Management, 2002.

S. L. Johnsson and C. T. Ho, Optimum broadcasting and personalized communication in hypercubes, IEEE Transactions on Computers, vol.38, issue.9, pp.1249-1268, 1989.
DOI : 10.1109/12.29465

S. M. Larson, C. D. Snow, M. Shirts, and V. S. Pande, Folding@ Home and Genome@ Home: Using distributed computing to tackle previously intractable problems in computational biology, Computational Genomics, 2002.

Z. Li, B. Li, D. Jiang, and L. C. Lau, On achieving optimal throughput with network coding, Proceedings IEEE INFOCOM, 2005.

L. Massoulie and J. Roberts, Bandwidth sharing: objectives and algorithms, IEEE INFOCOM, 1999.

L. Massoulie, A. Twigg, C. Gkantsidis, and P. Rodriguez, Randomized Decentralized Broadcasting Algorithms, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.1073-1081, 2007.
DOI : 10.1109/INFCOM.2007.129

M. Mathis, J. Semke, J. Mahdavi, and T. Ott, The macroscopic behavior of the TCP congestion avoidance algorithm, ACM SIGCOMM Computer Communication Review, vol.27, issue.3, pp.67-82, 1997.
DOI : 10.1145/263932.264023

J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, Modeling TCP throughput, ACM SIGCOMM Computer Communication Review, vol.28, issue.4, pp.303-314, 1998.
DOI : 10.1145/285243.285291

G. Shao, F. Berman, and R. Wolski, Using effective network views to promote distributed application performance, International Conference on Parallel and Distributed Processing Techniques and Applications, 1999.

Y. C. Tseng, S. Y. Wang, and C. W. Ho, Efficient broadcasting in wormhole-routed multicomputers: anetworkpartitioning approach, IEEE TPDS, vol.10, issue.1, pp.44-61, 1999.

J. Watts and R. A. Geijn, A PIPELINED BROADCAST FOR MULTIDIMENSIONAL MESHES, Parallel Processing Letters, vol.05, issue.02, pp.281-292, 1995.
DOI : 10.1142/S0129626495000266

S. A. Weil, S. A. Brandt, E. L. Miller, and C. Maltzahn, CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data, ACM/IEEE SC 2006 Conference (SC'06), 2006.
DOI : 10.1109/SC.2006.19

X. Zhang, J. Liu, B. Li, and Y. S. Yum, CoolStreaming/DONet: A data-driven overlay network for peerto-peer live media streaming, Proceedings IEEE INFOCOM, 2005.