A Queueing System for Modeling a File Sharing Principle
| dc.creator | Simatos, Florian | |
| dc.creator | Robert, Philippe | |
| dc.creator | Guillemin, Fabrice | |
| dc.date | 2008-03-11 | |
| dc.date.accessioned | 2026-07-07T12:17:34Z | |
| dc.date.available | 2026-07-07T12:17:34Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0803.1610 | |
| dc.identifier | http://arxiv.org/abs/0803.1610 | |
| dc.identifier | Dans ACM Sigmetrics (2008) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/212117 | |
| dc.subject | Networking and Internet Architecture | |
| dc.title | A Queueing System for Modeling a File Sharing Principle | |
| dc.type | text |