Dynamic models for file sizes and double pareto distributions

Internet Mathematics

Volumn 1, Issue 3, 2004, Pages 305-333

  Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906229673     PISSN: 15427951     EISSN: 19449488     Source Type: Journal    
DOI: 10.1080/15427951.2004.10129092     Document Type: Article

References (35)

1. [Aitchison and Brown 57] J. Aitchison and J. A. C. Brown. The Lognormal Distribution. Cambridge, UK: Cambridge University Press, 1957.
2. [Arlitt and Williamson 96] M. F. Arlitt and C. L. Williamson. "Web Server Workload Characterization: The Search for Invariants". Performance Evaluation Review 24:1 (1996), 125-137.
3. [Balinska et al. 94] K. T. Balinska, L. V. Quintasem, and J. Szymański. "Random Recursive Forests". Random Structures and Algorithms 5 (1994), 3-12.
4. [Barabási et al. 99] A.-L. Barabási, R. Albert, and H. Jeong. "Mean-Field Theory for Scale-Free Random Networks". Physica A 272 (1999), 173-189.
5. [Barford and Crovella 98] P. Barford and M. Crovella. "Generating Representative Web Workloads for Network and Server Performance Evaluation". Performance Evaluation Review 26:1 (1998), 151-160.
6. [Barford et al. 99] P. Barford, A. Bestavros, A. Bradley, and M. Crovella. "Changes in Web Client Access Patterns: Characteristics and Caching Implications". World Wide Web 2 (1999), 15-28.
7. [Broder et al. 00] A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. "Graph Structure in the Web: Experiments and Models". In Proceedings of the 9th World Wide Web Conference. Available in Computer Networks 33:1-6 (2000), 309-320.
8. [Carlson and Doyle 99] J. M. Carlson and J. Doyle. "Highly Optimized Tolerance: A Mechanism for Power Laws in Designed Systems". Physics Review E 60:2 (1999), 1412-1427.
9. [Crovella and Bestavros 97] M. Crovella and A. Bestavros. "Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes". IEEE/ACM Transactions on Networking 5:6 (1997), 835-846.
10. [Crovella et al. 98] M. Crovella, M. S. Taqqu, and A. Bestavros. "Heavy-Tailed Probability Distributions in the World Wide Web". In A Practical Guide to Heavy Tails, edited by R. J. Adler, R. E. Feldman, and M. S. Taqqu, pp. 3-26. London: Chapman and Hall, 1998.
11. [Crow and Shimura 88] E. L. Crow and K. Shimizu, editors. Lognormal Distributions: Theory and Applications. New York: Marcel Dekker, Inc., New York, 1988.
12. [Devroye 98] L. Devroye. "Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms". In Probabilistic Methods for Algorithmic Discrete Mathematics, edited by M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, pp. 249-314. Berlin: Springer-Verlag, 1998.
13. [Downey 01] A. B. Downey. "The Structural Causes of File Size Distributions". In Proceedings of the Ninth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pp. 361-370. Los Alamitos, CA: IEEE Computer Society, 2001.
14. [Drinea et al. 01] E. Drinea, M. Enachescu, and M. Mitzenmacher. "Variations on Random Graph Models of the Web". Harvard Computer Science Technical Report TR-06-01, 2001.
15. [Fabrikant et al. 02] A. Fabrikant, E. Koutsoupias, and C. Papadimitriou. "Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws on the Internet". In Proceedings of the Twenty-Ninth International Colloquium on Automata, Languages, and Programming, pp. 110-122, Lecture Notes in Computer Science 2380. Berlin: Springer-Verlag, 2002.
16. [Gabaiz 99] X. Gabaix. "Zipf's Law for Cities: An Explanation". Quarterly Journal of Economics 114 (1999), 739-767.
17. [Huberman and Adamic 99] B. A. Huberman and L. A. Adamic. "Evolutionary Dynamics of the World Wide Web". Technical Report, Xerox Palo Alto Research Center, 1999. Appears as a brief communication in Nature 399 (1999), 130.
18. [Huberman and Adamic 00] B. A. Huberman and L. A. Adamic. "The Nature of Markets in theWorldWideWeb". Quarterly Journal of Economic Commerce 1 (2000), 5-12.
19. [Kleinberg et al. 99] J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. "The Web as a Graph: Measurements, Models, and Methods". In Proceedings of the 5th International Conference on Combinatorics and Computing, pp. 1-17, Lecture Notes in Computer Science 1627. Berlin: Springer-Verlag, 1999.
20. [Krapivsky and Redner 01] P. L. Krapivsky and S. Redner. "Organization of Growing Random Networks". Physical Review E 63 (2001), 066123-1-066123-14.
21. [Kumar et al. 00] R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic Models for the Web Graph. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 57-65. Los Alamitos, CA: IEEE Computer Society, 2000.
22. [Kurtz 81] T. G. Kurtz. Approximation of Population Processes. CBMS-NSF Regional Conference Series in Applied Mathematics, 36. Philadelphia: SIAM, 1981.
23. [Leland et al. 94] W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson. "On the Self-Similar Nature of Ethernet Traffic". IEEE/ACM Transactions on Networking (1994), 1-15.
24. [Li 99] W. Li. "References on Zipf 's Law". Availablke from World Wide Web (http://linkage.rockerfeller.edu/wli/zipf/), 1999.
25. [Mitzenmacher 04] M. Mitzenmacher. "A Brief History of Generative Models for Power Law and Lognormal Distributions". Internet Mathematics 1:2 (2004), 226-251.
26. [Mitzenmacher and Tworetzky 03] M. Mitzenmacher and B. Tworetzky. "New Models and Methods for File Size Distributions". In Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing, pp. 603-612. Urbana, IL: University of Illinois at Urbana-Champaign, 2003.
27. [Montroll and Shlesinger 83] E.W. Montroll andM. F. Shlesinger. "Maximum Entropy Formalism, Fractals, Scaling Phenomena, and 1/f Noise: A Tale of Tails". Journal of Statistical Physics 32 (1983), 209-230.
28. [Motwani and Raghavan 95] R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge, UK: Cambridge University Press, 1995.
29. [Reed 01] W. J. Reed. Personal communication, 2001.
30. [Reed 03] W. J. Reed. "The Pareto Law of Incomes-An Explanation and an Extension". Physica A 319 (2003), 469-485.
31. [Reed and Jorgensen 01] W. J. Reed and M. Jorgensen. "The Double Pareto-Lognormal Distribution-A New Parametric Model for Size Distributions". To appear in Communications in Statistics: Theory and Methods 33:8 (2004).
32. [Reed and Hughes 02] W. J. Reed and B. D. Hughes. "From Gene Families and Genera to Incomes and Internet File Sizes: Why Power-Laws Are So Common in Nature". Physical Review E 66 (2002), 067103.
33. [Smythe and Mahmoud 95] R. Smythe and H. Mahmoud. "A Survey of Recursive Trees". Theoretical Probability and Mathematical Statistics 51 (1995), 1-27.
34. [Wormald 95] N. C. Wormald. "Differential Equations for Random Processes and Random Graphs". Annals of Applied Probability 5:4 (1995), 1217-1235.
35. [Zhu et al. 01] X. Zhu, J. Yu, and J. Doyle. "Heavy Tails, Generalized Coding, and Optimal Web Layout". In Proceedings of IEEE INFOCOM, pp. 1617-1626. New York: IEEE Computer and Communications Society, 2001.