A Queueing System for Modeling a File Sharing Principle - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

A Queueing System for Modeling a File Sharing Principle


We investigate in this paper the performance of a simple file sharing principle. For this purpose, we consider a system composed of N peers becoming active at exponential random times; the system is initiated with only one server offering the desired file and the other peers after becoming active try to download it. Once the file has been downloaded by a peer, this one immediately becomes a server. To investigate the transient behavior of this file sharing system, we study the instant when the system shifts from a congested state where all servers available are saturated by incoming demands to a state where a growing number of servers are idle. In spite of its apparent simplicity, this queueing model (with a random number of servers) turns out to be quite difficult to analyze. A formulation in terms of an urn and ball model is proposed and corresponding scaling results are derived. These asymptotic results are then compared against simulations.
Fichier principal
Vignette du fichier
full.pdf (251.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00262405 , version 1 (11-03-2008)
inria-00262405 , version 2 (11-03-2008)


  • HAL Id : inria-00262405 , version 2
  • ARXIV : 0803.1610


Florian Simatos, Philippe Robert, Fabrice Guillemin. A Queueing System for Modeling a File Sharing Principle. ACM Sigmetrics : International Conference on Measurement and Modeling of Computer Systems, Jun 2008, Annapolis, United States. ⟨inria-00262405v2⟩


78 View
303 Download



Gmail Facebook X LinkedIn More