A Queueing System for Modeling a File Sharing Principle

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/inria-00262405
Contributor : Philippe Robert <>
Submitted on : Tuesday, March 11, 2008 - 4:20:01 PM
Last modification on : Tuesday, May 14, 2019 - 1:16:37 AM
Long-term archiving on : Friday, November 25, 2016 - 10:49:22 PM

Files

full.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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⟩

Share

Metrics

Record views

195

Files downloads

215