A Queueing System for Modeling a File Sharing Principle

Details A Queueing System for Modeling a File Sharing Principle A Queueing System for Modeling a File Sharing Principle

2008-03-11

arxiv.org/abs/0803.1610v1

Dans ACM Sigmetrics (2008)

Computer Science

Networking and Internet Architecture

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Queueing System for Modeling a File Sharing Principle does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Queueing System for Modeling a File Sharing Principle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Queueing System for Modeling a File Sharing Principle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286191