A queueing system for modeling a file sharing principle

SIGMETRICS'08: Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

Volumn 36, Issue 1 SPECIAL ISSUE, 2008, Pages 181-192

  Simatos, Florian ^a   Robert, Philippe ^a   Guillemin, Fabrice ^b  

^a INRIA   (France)

^b ORANGE LABS   (France)

Author keywords

Algorithms; Performance

Indexed keywords

FILE SHARING; PERFORMANCE; QUEUEING MODELS; QUEUEING SYSTEMS; RANDOM NUMBERS; SCALING RESULTS; TRANSIENT BEHAVIORS;

COMPUTER SYSTEMS; QUEUEING NETWORKS; QUEUEING THEORY;

SERVERS;

EID: 57349092405     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375457.1375478     Document Type: Conference Paper

References (17)

1. Søren Asmussen, Applied probability and queues, John Wiley & Sons Ltd., Chichester, 1987.
2. K. B. Athreya and Niels Keiding, Estimation theory for continuous-time branching processes, Sankhya: The Indian Journal of Statistics 89 (1977), no. A, 101-123.
3. Krishna B. Athreya, On the supercritical one dimensional age dependent branching processes, The Annals of Mathematical Statistics 40 (1969), no. 3, 743-763.
4. A. D. Barbour, Lars Hoist, and Svante Janson, Poisson approximation, The Clarendon Press Oxford University Press, New York, 1992, Oxford Science Publications.
5. F. Clévenot and P. Nain, A simple fluid model for the analsysis of the Squirrel peer-to-peer caching system, Proc. Infocom, 2004.
6. E. Csáki and A. Földes, On the first empty cell, Studia Scientiarum Mathematicarum Hungarica 11 (1976), no. 3-4, 373-382 (1978).
7. Z. Ge, D.R. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley, Modeling peer-to-peer file sharing systems, Proc. Infocom, 2003.
8. Alexander Gnedin, Ben Hansen, and Jim Pitman, Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws. Probability Surveys 4 (2007), 146-171 (electronic). MR MR2318403
9. Bronius Grigelionis, On the convergence of sums of random, step processes to a poisson process, Theory of Probability and its Applications 8 (1961), no, 2, 177-182.
10. Hsien-Kuei Hwang and Svante Janson, Local limit theorems for finite and infinite urn models, Annals of Probability (To appear).
11. J. F. C. Kingman, Random partitions in population genetics, Proceedings of the Royal Society. London. Series A. Mathematical, Physical and Engineering Sciences 361 (1978), no. 1704, 1-20.
12. Unpublished manuscript available at, http://chambcrtin.inria.fr/robert/ Sigmctrics- Theorem2.pdf.
13. L. Massoulié and M, Vojnović, Coupon replication systems, Proc, Sigmetrics 2005 (Banff, Alberta, Canada), June 2005.
14. D. Qiu and R. Srikant, Modeling and performance analysis of BitTorrent-like peer-to-peer networks, Proc. Sigcomm, 2004.
15. Sujay Sanghavi, Bruce Hajek, and Laurent Massoulié, Gossiping with Multiple Messages, INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE, May 2007, pp. 2135-2143.
16. David Williams, Probability with martingales, Cambridge University Press, 1991.
17. Xiangying Yang and Gustavo de Veciana, Performance of peer-to-peer networks: service capacity and role of resource sharing policies, Performance Evaluation 63 (2006), no. 3, 175-194.