A queueing system for modeling a file sharing principle

Authors:
Florian Simatos;Philippe Robert;Fabrice Guillemin
Affiliations:
INRIA Paris-Rocquencourt, Le Chesnay, France;INRIA Paris-Rocquencourt, Le Chesnay, France;Orange Labs, Lannion, France
Venue:
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
2008

Citing 3
Cited 5

Modeling and performance analysis of BitTorrent-like peer-to-peer networks

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Coupon replication systems

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance of peer-to-peer networks: service capacity and role of resource sharing policies

Performance Evaluation - P2P computing systems

Stability properties of linear file-sharing networks: invited presentation, extended abstract

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Estimating self-sustainability in peer-to-peer swarming systems

Performance Evaluation
Optimal server scheduling in hybrid P2P networks

Performance Evaluation
Content dynamics in P2P networks from queueing and fluid perspectives

Proceedings of the 24th International Teletraffic Congress
Predicting the impact of measures against P2P networks: transient behavior and phase transition

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

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.