A. Antunes, C. Fricker, P. Robert, and D. Tibi, Metastability of CDMA cellular systems, Proceedings of the 12th annual international conference on Mobile computing and networking , MobiCom '06, 2006.
DOI : 10.1145/1161089.1161113

N. Antunes, C. Fricker, P. Robert, D. Tibi-appenzeller, I. Keslassy et al., Sizing router buffers Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels Branching processes [bAGP + 05 Inverting sampled ADSL traffic Coupling a branching process to an infinite dimensional epidemic process How Mobility Impacts the Flow-Level Performance of Wireless Data Systems Quality of service and flow level admission control in the internet Is the " Law of the Jungle " sustainable for the Internet? Statistical Analysis fo a Telephone Call Center: A Queueing-Science Perspective, Stochastic networks with multiple stable points. The Annals of Probability Proceedings of IEEE ICC'05 Proceedings of IEEE INFOCOM 2004BFP09] Thomas Bonald, Mathieu Feuillet, and Alexandre Proutière Proceedings of IEEE INFOCOM 2009BH52] Richard Bellman and Theodore Harris. On Age-Dependent Binary Branching Processes Barbour, Lars Holst, and Svante Janson. Poisson approximationBHP06] A. R. Bharambe, C. Herley, and V. N. Padmanabhan. Analyzing and Improving a BitTorrent Networks Performance Mechanisms Proceedings of IEEE INFOCOM 2006, pp.255-278281, 1952.

T. Bonald, L. Massoulié, F. Mathieu, D. Perino, and A. Twigg, Epidemic live streaming: optimal performance trade-offs Performance of random medium access control, an asymptotic approach, Proceedings of SIGMETRICS'08 ACM. References of the Introduction 39 [BMP08] Charles Bordenave, David McDonald, and Alexandre Proutière Proceedings of SIGMETRICS'08 ACM. [BP02] Thomas Bonald and Alexandre Proutière. Insensitivity in processorsharing networks. Performance Evaluation Thomas Bonald and Alexandre Proutière. Insensitive Bandwidth Sharing in Data Networks. Queueing Systems: Theory and ApplicationsBPH06] Sem Borst, Alexandre Proutière, and Nidhi Hegde. Capacity of wireless data networks with intra-and inter-cell mobility Proceedings of IEEE INFOCOM 2006, pp.325-336, 2002.

M. Bramson, Instability of FIFO Queueing Networks. The Annals of Applied Probability, pp.414-431, 1994.

M. Bramson, Instability of FIFO Queueing Networks with Quick Service Times, The Annals of Applied Probability, vol.4, issue.3, pp.693-718, 1994.
DOI : 10.1214/aoap/1177004967

M. Bramson, Stability of queueing networks Lectures from the 36th Probability Summer School held in Saint-Flour, Lecture Notes in Mathematics, 1950.

Y. David and . Burman, Insensitivity in Queueing Systems, Advances in Applied Probability, vol.13, issue.4, pp.846-859, 1981.

K. Malrieu, ]. G. Parouxdai95, and . Dai, On the long time behavior of the TCP window size process Accepted in Stochastic Processes and their Applications On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models On the throughput scaling of wireless relay networks, Endre Csáki and Antónia Földes. On the first empty cell. Studia Scientarum Mathematicarum HungaricaDFT06] Olivier Dousse, Massimo Franceschetti, and Patrick ThiranDGR02] Vincent Dumas, Fabrice Guillemin, and Philippe Robert. A Markovian analysis of Additive-Increase Multiplicative-Decrease (AIMD) algorithms . Advances in Applied Probability, pp.373-38249, 1976.

J. Dantzer, M. Haddani, P. Doytchinov, J. Lehoczky, S. Shreve-dupuis et al., On the stability of a bandwidth packing algorithm Probability in the Engineering and Informational Sciences Real-time queues in heavy traffic with earliest-deadline-first queue discipline, Dum97] Vincent Dumas. A Multiclass Network with Non-Linear, Non-Convex, Non-Monotonic Stability Conditions. Queueing Systems: Theory and Applications Lyapounov functions for semimartingale reflecting Brownian motions. The Annals of Applied Probability, pp.57-79332, 1994.

N. Stewart, T. G. Ethier, and . Kurtz, Markov Processes, Characterization and Convergence, Wiley Series in Probability and Mathematical StatisticsErl17] A. K. Erlang. Løsning af nogle Problemer fra Sandsynlighedsregningen af Betydning for de automatiske Telefoncentraler. Elektroteknikeren, p.335, 1909.

M. Franceschetti, O. Dousse, D. N. Tse, and P. Thiran, Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory, IEEE Transactions on Information Theory, vol.53, issue.3, pp.1009-10018, 2007.
DOI : 10.1109/TIT.2006.890791

G. Fayolle, I. A. Ignatyuk, V. A. Malyshev, and M. V. , Random walks in two-dimensional complexes, Queueing Systems, vol.24, issue.3, pp.269-300, 1991.
DOI : 10.1007/BF01158467
URL : https://hal.archives-ouvertes.fr/inria-00075247

S. Floyd and V. Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Transactions on Networking, vol.1, issue.4, pp.397-413, 1993.
DOI : 10.1109/90.251892

P. Flajolet and G. Martin, Probabilistic counting algorithms for data base applications, Journal of Computer and System Sciences, vol.31, issue.2, pp.182-209, 1985.
DOI : 10.1016/0022-0000(85)90041-8
URL : https://hal.archives-ouvertes.fr/inria-00076244

A. V. Gnedin, A. Iksanov, P. Negadajlov, and U. Roesler, The Bernoulli Sieve revisited. To Appear in The Annals of Applied Probability, 2009.

A. V. Gnedin, A. Iksanov, U. Gupta, and P. R. Kumar, Small parts in the Bernoulli sieve The capacity of wireless networks Anatomy of a P2P Content Distribution system with Network Coding, Proceedings of the 5th International Workshop on Peer-to-Peer Systems, pp.235-242388, 2000.

V. G. Alexander, A. L. Gromoll, R. J. Puha, . [. Williams, D. Grossglauser et al., The Bernoulli Sieve The fluid limit of a heavily loaded processor sharing queue. The Annals of Applied Probability Mobility increases the capacity of ad-hoc wireless networks, Proceedings of IEEE INFOCOM 2001 International Conference on Peerto-Peer Computing (P2P), pp.79-96797, 1999.

[. Hwang and S. Janson, Local limit theorems for finite and infinite urn models. The Annals of Probability, pp.992-1022, 2008.
DOI : 10.1214/07-aop350
URL : http://arxiv.org/abs/math/0604397

L. Norman, S. Johnson, and . Kotz, Urn models and their application: an approach to modern discrete probability theory, 1977.

S. Karlinkel86 and ]. F. Kelly, Central limit theorems for certain infinite urn schemes Blocking probabilities in large circuit-switched networks Information capacity and power control in single-cell multiuser communications, ICC'95, IEEE International Conference on Communications Konstantopoulos, and P. Sousi. A stochastic epidemiological model and a deterministic limit for BitTorrent-like peer-to-peer file-sharing networks. Springer Lecture Notes in Computer Science, pp.373-401473, 1967.

J. Lampertiloy62, ]. R. Loynes, J. Massoulié, and . Roberts, The stability of a queue with non-independent interarrival and service times [Mal93] V. A. Malyshev. Networks and dynamical systems Bandwidth sharing: objectives and algorithms Rate-optimal schemes for Peerto-Peer live streaming Coupon replication systems, Sequence of Branching Processes. Probability Theory and Related Fields Mathematical Proceedings of the Cambridge Philosophical Society Proceedings of IEEE INFOCOM 1999 Proceedings of SIGMETRICS'05, pp.271-288497, 1962.

V. Paxson and S. Floyd, Wide area traffic: the failure of Poisson modeling, PGES05] Johan Pouwelse, Pawel Garbacki, Dick Epema, and Henk Sips Proceedings of IPTPS'05, pp.226-244, 1995.
DOI : 10.1109/90.392383

N. Parvez, C. Williamson, A. Mahanti, N. Qiu, and R. Srikant, Analysis of bittorrent-like protocols for on-demand stored media streaming Modeling and performance analysis of bittorrent-like peer-to-peer networks References of Chapter, Proceedings of SIGMETRICS'08 Proceedings of SIGCOMM'04, pp.301-312, 2004.

K. B. Athreya and H. Kang, Some limit theorems for positive recurrent branching Markov chains: II, Advances in Applied Probability, vol.30, issue.03, pp.711-722, 1998.
DOI : 10.1090/S0002-9947-1978-0511425-0

S. Borst, User-level performance of channel-aware scheduling algorithms in wireless data networks, IEEE/ACM Transactions on Networking, vol.13, issue.3, pp.636-647, 2005.
DOI : 10.1109/TNET.2005.850215

S. Borst, A. Proutière, and N. Hegde, Capacity of Wireless Data Networks with Intra- and Inter-Cell Mobility, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pp.1058-1069, 2006.
DOI : 10.1109/INFOCOM.2006.175

M. Bramson, Convergence to equilibria for fluid models of FIFO queueing networks Queueing Systems: Theory and Applications, pp.5-45, 1996.

M. Bramson, Convergence to equilibria for fluid models of head-of-theline proportional processor sharing queueing networks Queueing Systems: Theory and Applications, pp.1-41, 1996.

P. Caputo and G. Posta, Entropy dissipation estimates in a zero-range dynamics. Probability Theory and Related Fields, pp.65-87, 2007.

H. Chen and D. D. Yao, Fundamentals of queueing networks, Performance, asymptotics, and optimization , Stochastic Modelling and Applied Probability, 2001.
DOI : 10.1007/978-1-4757-5301-1

J. G. Dai, On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models, The Annals of Applied Probability, vol.5, issue.1, pp.49-77, 1995.
DOI : 10.1214/aoap/1177004828

P. Diaconis and D. Stroock, Geometric Bounds for Eigenvalues of Markov Chains, The Annals of Applied Probability, vol.1, issue.1, pp.36-61, 1991.
DOI : 10.1214/aoap/1177005980

P. Dupuis and R. J. Williams, Lyapunov Functions for Semimartingale Reflecting Brownian Motions, The Annals of Probability, vol.22, issue.2, pp.680-702, 1994.
DOI : 10.1214/aop/1176988725

C. Fricker, P. Robert, and D. Tibi, On the rates of convergence of Erlang's model, Journal of Applied Probability, vol.231, issue.04, pp.1167-1184, 1999.
DOI : 10.1214/aoap/1177005872

M. Grossglauser and D. Tse, Mobility increases the capacity of ad-hoc wireless networks, Proceedings of IEEE INFOCOM 2001, pp.1360-1369, 2001.

P. Robert, Stochastic Networks and Queues. Stochastic Modelling and Applied Probability Series, 2003.
DOI : 10.1007/978-3-662-13052-0

A. N. Rybko, A. L. Stolyar, and .. , On the ergodicity of random processes that describe the functioning of open queueing networks. Problems on Information Transmission CHAPTER II Stability Properties of Linear File-Sharing Networks Contents 1. Introduction, pp.3-26, 1992.

A. 3. Appendix and .. , Proof of Proposition 3 104 References of Chapter II

G. Alsmeyeran72, ]. K. Athreya, and P. E. Ney, On the Galton-Watson Predator-Prey Process, AP98] David Aldous and Jim Pitman. Tree-valued Markov chains derived from Galton-Watson processes. Ann. Inst. H. Poincaré Probab. Statist, pp.198-211637, 1972.
DOI : 10.1214/aoap/1177005515

T. Bonald, L. Massoulié, F. Mathieu, D. Perino, and A. Twigg, Epidemic live streaming: optimal performance trade-offs, Proceedings of SIGMETRICS'08, pp.325-336, 2008.
DOI : 10.1145/1384529.1375494
URL : https://hal.archives-ouvertes.fr/hal-00668529

M. Bramson, Stability of queueing networks Lectures from the 36th Probability Summer School held in Saint-Flour, Lecture Notes in Mathematics, 1950.

H. Chen and D. D. Yao, Fundamentals of queueing networks, Performance, asymptotics, and optimization , Stochastic Modelling and Applied Probability, 2001.
DOI : 10.1007/978-1-4757-5301-1

T. Dinh-dang, R. Pereczes, S. F. Molnarkin75-]-j, and . Kingman, Modeling the population of file-sharing peer-to-peer networks with branching processes Computers and Communications The first birth problem for an age-dependent branching process. The Annals of Probability, 12th IEEE Symposium on, pp.809-815319, 1975.

O. Nermannqp08, ]. R. Núñez-queija, and B. J. Prabhu, Erasing a branching tree Scaling laws for file dissemination in P2P networks with random contacts, Proceedings of IWQoS, pp.365-395101, 1981.

N. Parvez, C. Williamson, A. Mahanti, and N. Carlsson, Analysis of bittorrent-like protocols for on-demand stored media streaming Modeling and performance analysis of bittorrent-like peer-to-peer networks, Proceedings of SIGMETRICS'08 Proceedings of SIGCOMM'04, pp.301-312, 2004.

S. Asmussen, Applied probability and queues, 1987.

K. B. Athreya, On the Supercritical One Dimensional Age Dependent Branching Processes, The Annals of Mathematical Statistics, vol.40, issue.3, pp.743-763, 1969.
DOI : 10.1214/aoms/1177697585

A. D. Barbour, L. Holst, and S. Janson, Poisson approximation, 1992.

E. Csáki and A. Földes, On the first empty cell Clévenot and P. Nain. A simple fluid model for the analysis of the squirrel peer-to-peer caching system, Proceedings of IEEE INFOCOM, pp.373-382, 1976.

. Gfs-+-03-]-z, D. R. Ge, J. Figueiredo, J. Sharad, D. Kurose et al., Modeling peer-peer file sharing systems, Proceedings of IEEE INFO- COM 2003, pp.2188-2198, 2003.

A. V. Gnedin, B. Hansen, and J. Pitman, Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws, Probability Surveys, vol.4, issue.0, pp.146-171, 2007.
DOI : 10.1214/07-PS092

M. Härnqvist, Limit theorems for point processes generated in a general branching process Advances in Applied Probability [HJ08] Hsien-Kuei Hwang and Svante Janson. Local limit theorems for finite and infinite urn models. The Annals of Probability Random partitions in population genetics, Proceedings of the Royal Society. London. Series A. Mathematical, Physical and Engineering Sciences, vol.13, issue.363, pp.650-668992, 1704.

L. Massoulié, M. Vojnovi?, D. Qiu, and R. Srikant, Coupon replication systems Modeling and performance analysis of bittorrent-like peer-to-peer networks, Proceedings of SIGMETRICS'05 Proceedings of SIGCOMM'04, pp.2-13, 2004.

P. Robert and F. Simatos, Occupancy schemes associated to Yule processes, Advances in Applied Probability, vol.11, issue.02, pp.600-622, 2009.
DOI : 10.1214/aop/1176996179
URL : https://hal.archives-ouvertes.fr/inria-00331511

S. Sanghavi, B. Hajek, and L. Massoulié, Gossiping with Multiple Messages, Proceedings of IEEE INFOCOM 2007, pp.2135-2143, 2007.
DOI : 10.1109/tit.2007.909171
URL : http://arxiv.org/abs/cs/0612118

D. Williams, Probability with Martingales, 1991.
DOI : 10.1017/CBO9780511813658

X. Yang, G. De-veciana, and .. , Performance of peer-to-peer networks: service capacity and role of resource sharing policies. Performance Evaluations, CHAPTER IV Occupancy Schemes Associated to Yule Processes Contents 1. Introduction, pp.175-194, 2006.

A. 1. Appendix, I. B. Chapter, N. Athreya, and . Kaplan, 158 References of 161 References of Chapter Convergence of the Age Distribution in the One-Dimensional Supercritical Age-Dependent Branching Process. The Annals of Probability, pp.38-50, 1972.

A. D. Barbour, L. Holst, and S. Janson, Poisson approximation, 1992.

E. Csáki, A. Donald, and A. Dawson, On the first empty cell Measure-valued Markov processes, Studia Scientarum Mathematicarum Hungarica Lecture Notes in Mathematics, vol.11, issue.1541, pp.373-382, 1976.

A. V. Gnedin, A. Iksanov, P. Negadajlov, and U. Roesler, The Bernoulli Sieve revisited. To Appear in The Annals of Applied Probability, 2009.

A. V. Gnedin, A. Iksanov, and U. Roesler, Small parts in the Bernoulli sieve, DMTCS proceedings, pp.235-242, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01194688

A. V. Gnedin, The Bernoulli sieve, Bernoulli, vol.10, issue.1, pp.79-96, 2004.
DOI : 10.3150/bj/1077544604
URL : https://hal.archives-ouvertes.fr/hal-01185568

M. Härnqvist-hsien-kuei, S. Hwang, and . Janson, Limit theorems for point processes generated in a general branching process, Advances in Applied Probability, vol.39, issue.04, pp.650-668992, 1981.
DOI : 10.1016/0022-247X(69)90210-8

L. Norman, S. Johnson, and . Kotz, Urn models and their application: an approach to modern discrete probability theory, 1977.

S. Karlin and J. F. Kingman, Central limit theorems for certain infinite urn schemes The first birth problem for an age-dependent branching process. The Annals of Probability, Journal of Mathematics and Mechanics, vol.17, issue.35, pp.373-401790, 1967.

F. Valentin, B. A. Kolchin, . Sevastyanov, . V. Random-allocations, &. Winston et al., Asymptotic properties and absolute continuity of laws stable by a random weighted mean, Liu01] Quansheng Liu Stochastic Processes and their Applications, pp.83-107, 1978.

O. Nerman, On the convergence of supercritical general (C-M-J) branching processes, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.37, issue.3, pp.365-395, 1981.
DOI : 10.1007/BF00534830

J. Neveu, Martingales à temps discret, 1972.

J. Neveu, Processus Ponctuels, volume 598 of École d'été de probabilités de Saint-Flour, 1977.

. Chapter, Occupancy Schemes Associated to Yule Processes [Rob03] Philippe Robert Stochastic Networks and Queues. Stochastic Modelling and Applied Probability Series, 2003.

W. Rudin, Real and complex analysis, volume third edition, 1987.

W. Saddi and F. Guillemin, Measurement Based Modeling of eDonkey Peer-to-Peer File Sharing System, Proceedings of the International Teletraffic Congress, 2007.
DOI : 10.1007/978-3-540-72990-7_84

F. Simatos, P. Robert, and F. Guillemin, A queueing system for modeling a file sharing principle, Proceedings of SIGMET- RICS'08, pp.181-192, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00262405

D. Williamsafrt06-]-nelson-antunes, C. Fricker, P. Robert, and D. Tibi, Probability with Martingales Comprehensive list of references Metastability of CDMA cellular systems, 1991.

N. Antunes, C. Fricker, P. Robert, D. Tibiak76, ]. K. Athreya et al., Stochastic networks with multiple stable points. The Annals of Probability Convergence of the Age Distribution in the One- Dimensional Supercritical Age-Dependent Branching Process. The Annals of Probability Estimation theory for continuous-time branching processes, Sankhya: The Indian Journal of Statistics, vol.36, issue.41A, pp.255-27838, 1976.
URL : https://hal.archives-ouvertes.fr/hal-00204542

K. B. Athreya, H. Appenzeller, I. Keslassy, and N. Mckeown, Some limit theorems for positive recurrent branching Markov chains: I [Ald87] D. Aldous. Ultimate instability of exponential back-off protocol for acknowledgmentbased transmission control of random access communication channels, Advances in Applied Probability Sizing router buffers. SIG- COMM Computer Communication Review IEEE Transactions on Information Theory, vol.30, issue.332, pp.711-722281, 1987.
DOI : 10.1239/aap/1035228124
URL : http://projecteuclid.org/download/pdf_1/euclid.aap/1035228124

G. Alsmeyer, On the Galton-Watson Predator-Prey Process. The Annals of Applied Probability, Athreya and P. E. Ney. Branching processes, pp.198-211, 1972.

D. Aldous and J. Pitman, Tree-valued Markov chains derived from Galton-Watson processes, Annales de l'Institut Henri Poincare (B) Probability and Statistics, vol.34, issue.5, pp.637-686, 1998.
DOI : 10.1016/S0246-0203(98)80003-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9545

S. Asmussen, Applied probability and queues, 1987.

K. B. Athreya-nadia-ben-azzouna, F. Guillemin, S. Poisson, P. Robert, C. Fricker et al., On the supercritical one dimensional age dependent branching processes. The Annals of Mathematical Statistics Inverting sampled ADSL traffic Coupling a branching process to an infinite dimensional epidemic process, Proceedings of IEEE ICC'05 Borst, and A. Proutière. How Mobility Impacts the Flow-Level Performance of Wireless Data Systems Proceedings of IEEE INFOCOM, pp.743-763, 1969.

S. [. Benameur, S. Fredj, J. W. Oueslati-boulahia, and . Roberts, Quality of service and flow level admission control in the Internet, Mathieu Feuillet, and Alexandre Proutière. Is the " Law of the Jungle " sustainable for the Internet? In Proceedings of IEEE INFOCOM, pp.57-71, 2002.
DOI : 10.1016/S1389-1286(02)00266-9

N. Lawrence-brown, A. Gans, A. Mandelbaum, H. Sakov, S. Shen et al., Statistical Analysis of a Telephone Call Center, BH52] Richard Bellman and Theodore Harris. On Age-Dependent Binary Branching Processes, pp.36-50280, 1952.
DOI : 10.1198/016214504000001808

B. , A. D. Barbour, L. Holst, S. Janson, A. R. Bharambe et al., Poisson approximation Analyzing and Improving a BitTorrent Networks Performance Mechanisms, Comprehensive list of references Proceedings of IEEE INFOCOM 2006, pp.2884-2895, 1992.

T. Bonald, L. Massoulié, F. Mathieu, D. Perino, and A. Twigg, Epidemic live streaming: optimal performance trade-offs McDonald, and Alexandre Proutière. Performance of random medium access control, an asymptotic approach, Proceedings of SIGMETRICS'08 ACM. [BMP08] Charles Bordenave Proceedings of SIGMET- RICS'08, pp.325-336, 2008.

S. Borst, User-level performance of channel-aware scheduling algorithms in wireless data networks, Thomas Bonald and Alexandre Proutière. Insensitive Bandwidth Sharing in Data Networks. Queueing Systems: Theory and ApplicationsBPH06] Sem Borst, Alexandre Proutière, and Nidhi Hegde Proceedings of IEEE INFOCOM 2006, pp.636-647193, 2002.
DOI : 10.1109/TNET.2005.850215

M. Bramson, Instability of FIFO Queueing Networks. The Annals of Applied Probability, pp.414-431, 1994.

M. Bramson, Instability of FIFO Queueing Networks with Quick Service Times, The Annals of Applied Probability, vol.4, issue.3, pp.693-718, 1994.
DOI : 10.1214/aoap/1177004967

M. Bramson, Convergence to equilibria for fluid models of FIFO queueing networks Queueing Systems: Theory and Applications, pp.5-45, 1996.

M. Bramson, Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks Queueing Systems: Theory and Applications, pp.1-26, 1996.

M. Bramson, Stability of queueing networks Lectures from the 36th Probability Summer School held in Saint-Flour, Lecture Notes in Mathematics, 1950.

Y. David and . Burman, Insensitivity in Queueing Systems, Advances in Applied Probability, vol.13, issue.4, pp.846-859, 1981.

E. Csáki, A. Chafaï, F. Malrieu, and K. Paroux, On the first empty cell On the long time behavior of the TCP window size process Clévenot and P. Nain. A simple fluid model for the analysis of the squirrel peerto-peer caching system, Accepted in Stochastic Processes and their Applications Proceedings of IEEE INFOCOM, pp.373-382, 1976.

P. Caputo and G. Posta, Entropy dissipation estimates in a zero-range dynamics. Probability Theory and Related Fields, pp.65-87, 2007.

H. Chen, D. D. Yaodai95-]-j, A. Dai-donald, and . Dawson, Performance, asymptotics, and optimization, Stochastic Modelling and Applied Probability On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. The Annals of Applied Probability Measure-valued Markov processes On the throughput scaling of wireless relay networks, DFT06] Olivier Dousse, Massimo Franceschetti, and Patrick ThiranDGR02] Vincent Dumas, Fabrice Guillemin, and Philippe Robert. A Markovian analysis of Additive-Increase Multiplicative-Decrease (AIMD) algorithms. Advances in Applied Probability, pp.49-772756, 1993.

J. Dantzer, M. Haddani, P. Doytchinov, J. Lehoczky, and S. Shreve, On the stability of a bandwidth packing algorithm Real-time queues in heavy traffic with earliest-deadline-first queue discipline, Probability in the Engineering and Informational Sciences, pp.57-79332, 2000.

T. Dinh-dang, R. Pereczes, and S. Molnar, Modeling The Population of File-Sharing Peer-to-Peer Networks With Branching Processes, 2007 IEEE Symposium on Computers and Communications, pp.809-815, 2007.
DOI : 10.1109/ISCC.2007.4381479

P. Diaconis, D. Stroock, [. Dupuis, and R. J. Williams, Geometric Bounds for Eigenvalues of Markov Chains, The Annals of Applied Probability, vol.1, issue.1, pp.36-611, 1991.
DOI : 10.1214/aoap/1177005980

S. Floyd and V. Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Transactions on Networking, vol.1, issue.4, pp.397-413, 1993.
DOI : 10.1109/90.251892
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.5092

C. Fricker, P. Robert, and D. Tibi, On the rates of convergence of Erlang's model, Journal of Applied Probability, vol.231, issue.04, pp.1167-1184, 1999.
DOI : 10.1214/aoap/1177005872

. Gfs-+-03-]-z, D. R. Ge, J. Figueiredo, J. Sharad, D. Kurose et al., Modeling peerpeer file sharing systems, Proceedings of IEEE INFOCOM 2003, pp.2188-2198, 2003.

A. V. Gnedin, A. Iksanov, P. Negadajlov, and U. Roesler, The Bernoulli Sieve revisited. To Appear in The Annals of Applied Probability, 2009.

V. G. Alexander, A. L. Gromoll, R. J. Puha, . [. Williams, D. Grossglauser et al., The Bernoulli Sieve The fluid limit of a heavily loaded processor sharing queue. The Annals of Applied Probability Mobility increases the capacity of ad-hoc wireless networks Broose: A practical distributed hashtable based on the de-bruijn topology, Proceedings of IEEE INFOCOM 2001 166 Comprehensive list of references International Conference on Peer-to-Peer Computing (P2P), pp.79-96797, 1999.

L. Norman, S. Johnson, and . Kotz, Urn models and their application: an approach to modern discrete probability theory, 1977.

S. Karlinkel86 and ]. F. Kelly, Central limit theorems for certain infinite urn schemes Blocking probabilities in large circuit-switched networks, Kel91] F. P. Kelly. Loss networks, pp.373-401473, 1967.

R. Knopp, P. A. Humbletkin75-]-j, J. F. Kingman, and . Kingman, Information capacity and power control in single-cell multiuser communications The first birth problem for an age-dependent branching process. The Annals of Probability Random partitions in population genetics, ICC'95, IEEE International Conference on Communications, pp.790-801, 1704.

G. Kesidis, T. Konstantopoulos, and P. Sousi, A Stochastic Epidemiological Model and a Deterministic Limit for BitTorrent-Like Peer-to-Peer File-Sharing Networks, Lecture Notes in Computer Science, vol.47, pp.26-36, 2009.
DOI : 10.1137/1.9781611970333

F. Valentin, B. A. Kolchin, and . Sevastyanov, Random allocations, 1978.

J. Lamperti, The Limit of a Sequence of Branching Processes. Probability Theory and Related Fields, pp.271-288, 1967.

]. R. Loy62, . [. Loynes, J. Massoulié, and . Roberts, Asymptotic properties and absolute continuity of laws stable by a random weighted mean The stability of a queue with non-independent inter-arrival and service times Mathematical Proceedings of the Cambridge Philosophical Society Bandwidth sharing: objectives and algorithms Rate-optimal schemes for Peer-to-Peer live streaming Coupon replication systems, Lasse Leskelä. Stochastic Relations of Random Variables and Processes. Journal of Theoretical Probability Stochastic Processes and their Applications Malyshev. Networks and dynamical systems Proceedings of IEEE INFOCOM 1999MT08] Laurent Massoulié and Andrew Twigg Proceedings of SIGMETRICS'05, pp.83-107497, 1962.

J. Neveu, Martingales à temps discret, Masson et Cie, 1972.

J. Neveu, ]. R. Processus-ponctuelsnqp08, B. J. Núñez-queija, and . Prabhu, Scaling laws for file dissemination in P2P networks with random contacts, Proceedings of IWQoS, pp.101-108, 1977.

V. Paxson and S. Floyd, Wide area traffic: the failure of Poisson modeling, IEEE/ACM Transactions on Networking, vol.3, issue.3, pp.226-244, 1995.
DOI : 10.1109/90.392383

J. Pouwelse and P. Garbacki, Dick Epema, and Henk Sips. The Bittorrent P2P File-sharing System: Measurements and Analysis, Proceedings of IPTPS'05, 2005.

N. Parvez, C. Williamson, A. Mahanti, N. Qiu, and R. Srikant, Analysis of bittorrent-like protocols for on-demand stored media streaming Modeling and performance analysis of bittorrent-like peer-to-peer networks, Proceedings of SIGMETRICS'08 Proceedings of SIGCOMM'04, pp.301-312, 2004.

P. Robert, . Stochastic, . Networks, A. N. Queues, A. L. Rybko et al., Stochastic Modelling and Applied Probability Series On the ergodicity of random processes that describe the functioning of open queueing networks, Problems on Information Transmission, vol.28, issue.3, pp.3-26, 1992.

]. L. Walter-rudinrw87, D. Rogers, and . Williams, Itô calculus [SAV06] Riikka Susitaival, Samuli Aalto, and Jorma Virtamo. Analyzing the dynamics and resource usage of P2P file sharing by a spatio-temporal model. International Workshop on P2P for High Performance Comptutational Sciences (P2P-HPCS'06) in conjunction with ICCS, Schassberger. Insensitivity of Steady-State Distributions of Generalized Semi- Markov Processes. Part I. The Annals of Probability, pp.87-999, 1970.

W. Saddi, F. Guillemin, [. Sanghavi, B. Hajek, and L. Massoulié, Measurement based modeling of eDonkey peerto-peer file sharing system Gossiping with Multiple Messages A queueing system for modeling a file sharing principle, Proceedings of the International Teletraffic Congress Proceedings of IEEE INFOCOM 2007 Proceedings of SIGMETRICS'08, pp.2135-2143, 2007.

F. Simatos and D. Tibi, Spatial homogenization in a stochastic network with mobility. The Annals of Applied Probability, to appear [Tak69] Lajos Takács. On Erlang's formula. The Annals of, TDG08] Dominique Tschopp, Suhas Diggavi, and Matthias Grossglauser. Hierarchical routing over dynamic wireless networks, pp.71-7873, 1969.
URL : https://hal.archives-ouvertes.fr/hal-00460271

Y. Tian, D. Wu, K. W. Ng, and . Modeling, Modeling, Analysis and Improvement for BitTorrent-Like File Sharing Networks, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pp.2921-2931, 2006.
DOI : 10.1109/INFOCOM.2006.331

D. W. and G. Veciana, Probability with Martingales A Derivation of Response Time Distribution for an Service capacity of peer to peer networks Performance of peer-to-peer networks: service capacity and role of resource sharing policies, Processor- Sharing Queue. Problems of Control and Information Theory INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications SocietiesYdV06] Xiangying Yang and Gustavo de Veciana, pp.133-148, 1983.

H. Zang, J. P. Jue, and B. Mukherjee, A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks, Optical Networks Magazine, vol.1, issue.1, pp.47-60, 2000.