Interacting branching processes and linear file-sharing networks

From MaRDI portal
Publication:3059698

DOI10.1239/AAP/1282924065zbMATH Open1214.60044arXiv0907.0375OpenAlexW2114985115WikidataQ110086147 ScholiaQ110086147MaRDI QIDQ3059698FDOQ3059698


Authors: Lasse Leskelä, Florian Simatos, Philippe Robert Edit this on Wikidata


Publication date: 26 November 2010

Published in: Advances in Applied Probability (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0907.0375




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Interacting branching processes and linear file-sharing networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059698)