Interacting branching processes and linear file-sharing networks

Interacting branching processes and linear file-sharing networks

Lasse Leskelä, Philippe Robert, and Florian Simatos

Source: Adv. in Appl. Probab. Volume 42, Number 3 (2010), 834-854.

Abstract

File-sharing networks are distributed systems used to disseminate files among nodes of a communication network. The general simple principle of these systems is that once a node has retrieved a file, it may become a server for this file. In this paper, the capacity of these networks is analyzed with a stochastic model when there is a constant flow of incoming requests for a given file. It is shown that the problem can be solved by analyzing the asymptotic behavior of a class of interacting branching processes. Several results of independent interest concerning these branching processes are derived and then used to study the file-sharing systems.

First Page: Show

Primary Subjects: 60J80, 60J85

Secondary Subjects: 90B18

Keywords: Interacting branching process; peer-to-peer algorithm

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.

If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.aap/1282924065
Digital Object Identifier: doi:10.1239/aap/1282924065
Mathematical Reviews number (MathSciNet): MR2779561
Zentralblatt MATH identifier: 1214.60044

back to Table of Contents

References

Aldous, D. and Pitman, J. (1998). Tree-valued Markov chains derived from Galton--Watson processes. Ann. Inst. H. Poincaré Prob. Statist. 34, 637--686.

Mathematical Reviews (MathSciNet): MR1641670

Zentralblatt MATH: 0917.60082

Digital Object Identifier: doi:10.1016/S0246-0203(98)80003-4

Alsmeyer, G. (1993). On the Galton--Watson predator-prey process. Ann. Appl. Prob. 3, 198--211.

Mathematical Reviews (MathSciNet): MR1202523

Zentralblatt MATH: 0776.92014

Digital Object Identifier: doi:10.1214/aoap/1177005515

Project Euclid: euclid.aoap/1177005515

Athreya, K. B. and Ney, P. E. (1972). Branching Processes. Springer, New York.

Mathematical Reviews (MathSciNet): MR373040

Bramson, M. (2008). Stability of Queueing Networks (Lecture Notes Math. 1950). Springer, Berlin.

Mathematical Reviews (MathSciNet): MR2445100

Chen, H. and Yao, D. D. (2001). Fundamentals of Queueing Networks. Springer, New York.

Mathematical Reviews (MathSciNet): MR1835969

Zentralblatt MATH: 0992.60003

Kingman, J. F. C. (1975). The first birth problem for an age-dependent branching process. Ann. Prob. 3, 790--801.

Mathematical Reviews (MathSciNet): MR400438

Digital Object Identifier: doi:10.1214/aop/1176996266

Lamperti, J. (1967). Continuous state branching processes. Bull. Amer. Math. Soc. 73, 382--386.

Mathematical Reviews (MathSciNet): MR208685

Digital Object Identifier: doi:10.1090/S0002-9904-1967-11762-2

Project Euclid: euclid.bams/1183528846

Leskelä, L. (2010). Stochastic relations of random variables and processes. J. Theoret. Prob. 23, 523--546.

Massoulié, L. and Vojnović, M. (2005). Coupon replication systems. In Proc. ACM SIGMETRICS 2005, ACM Press, New York, pp. 2--13.

Nerman, O. (1981). On the convergence of supercritical general (C-M-J) branching processes. Z. Wahrscheinlichkeitsth. 57, 365--395.

Mathematical Reviews (MathSciNet): MR629532

Neveu, J. (1986). Erasing a branching tree. In Analytic and Geometric Stochastics (Papers in honour of G. E. H. Reuter; Adv. Appl. Prob. Spec. Suppl. 19), ed. D. G. Kendall, Applied Probability Trust, Sheffield, pp. 101--108.

Mathematical Reviews (MathSciNet): MR868511

Núñez-Queija, R. and Prabhu, B. J. (2008). Scaling laws for file dissemination in P2P networks with random contacts. In Proc. 16th Internat. Workshop on Quality of Service, IEEE, pp. 75--79.

Qiu, D. and Srikant, R. (2004). Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In Proc. 2004 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications, ACM Press, New York, pp. 367--378.

Robert, P. (2003). Stochastic Networks and Queues (Appl. Math. 52). Springer, Berlin.

Mathematical Reviews (MathSciNet): MR1996883

Zentralblatt MATH: 1038.60091

Rogers, L. C. G. and Williams, D. (1987). Diffusions, Markov Processes, and Martingales, Vol. 2. John Wiley, New York.

Mathematical Reviews (MathSciNet): MR921238

Zentralblatt MATH: 0977.60005

Seneta, E. (1970). On the supercritical branching process with immigration. Math. Biosci. 7, 9--14.

Mathematical Reviews (MathSciNet): MR270460

Zentralblatt MATH: 0209.48804

Digital Object Identifier: doi:10.1016/0025-5564(70)90038-6

Simatos, F., Robert, P. and Guillemin, F. (2008). A queueing system for modeling a file sharing principle. In Proc. ACM SIGMETRICS 2008, ACM Press, New York, pp. 181--192.

Susitaival, R., Aalto, S. and Virtamo, J. (2006). Analyzing the dynamics and resource usage of P2P file sharing by a spatio-temporal model. In Comptutational Science -- ICCS 2006 (Lecture Notes Comput. Sci. 3994), Springer, Berlin, pp. 420--427.

Trang, D. D., Pereczes, R. and Molnár, S. (2007). Modeling the population of file-sharing peer-to-peer networks with branching processes. In IEEE Symp. Comput. Commun. (Aveiro, Portugal, July 2007), pp. 809--815.

Williams, D. (1991). Probability with Martingales. Cambridge University Press.

Mathematical Reviews (MathSciNet): MR1155402

Zentralblatt MATH: 0722.60001

Yang, X. and de Veciana, G. (2004). Service capacity of peer to peer networks. In Proc. IEEE INFOCOM, ACM Press, New York, pp. 2242--2252.

previous :: next