Using Zipf Distribution to Predict Popularity Data for Storage Systems

Yin Yang; Wen Yi Li; Man Ning Zhang; Xiao Mei Ding; Jing Dai

doi:10.4028/www.scientific.net/AMR.989-994.2152

Paper Titles

Locating Method for Character 2D Barcode
p.2135

Research on Motion Model of “Wind-Blowing & Trees-Swinging” and “Leaves-Falling & Branches-Broken” Based on Fractal Theory
p.2139

Algorithm of Representing and Preparing for Resources in EEM
p.2144

Research of Computer Forensics Based on Benford’s Law
p.2148

Using Zipf Distribution to Predict Popularity Data for Storage Systems
p.2152

A Method for Transforming the Online Handwritten Mathematical Formula into MathML
p.2156

Adaptive Bit Allocation Algorithm for OFDM System
p.2161

Stepped Cooling Control Model Based on Optimal Algorithm
p.2165

Cluster Center Initialization Parallel Algorithm for K-Means Algorithm
p.2169

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 989-994Using Zipf Distribution to Predict Popularity Data...

Using Zipf Distribution to Predict Popularity Data for Storage Systems

Abstract:

In this paper we propose to use Zipf-like distribution to predict popularity data in storage systems. It can estimate prediction parameters according to the present statistics of I/O access. We classify the popularity data from every trace, and analyze the prediction rate through the classified popularity data’s characteristic. We synthesize the analysis results in different prediction time granularity and prediction popularity data queue. Finally, we use block I/O traces to discuss the effectiveness of prediction method. The discussion and analysis results indicate that this prediction method can predict the popularity data efficiently.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

2152-2155

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.989-994.2152

Citation:

Cite this paper

Online since:

July 2014

Authors:

Yin Yang*, Wen Yi Li, Man Ning Zhang, Xiao Mei Ding, Jing Dai

Keywords:

Popularity Data, Prediction, Zipf Distribution

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] L. Cherkasova and M. Gupta, Analysis of enterprise media server workloads: access patterns, locality, content evolution, and rates of change, IEEE/ACM Transactions on Networking, vol. 12, pp.781-794 (2004).

DOI: 10.1109/tnet.2004.836125

Google Scholar

[2] L. Breslau, P. Cao, L. Fan, G. Phillips and S. Shenker, Web caching and Zipf-like distributions: evidence and implications, Proc. IEEE Conf. Computer and Communications Societies (INFOCOM 99), IEEE Press, pp.126-134 (1999).

DOI: 10.1109/infcom.1999.749260

Google Scholar

[3] Y. S. Chen and P. Chong, Mathematical modeling of empirical laws in computer application: A case study, Computers & Mathematics with Applications, vol. 24, pp.77-87 (1992).

DOI: 10.1016/0898-1221(92)90156-c

Google Scholar

[4] H. Yu, D. Zheng, B. Zhao and W. Zheng, Understanding user behavior in large scale video-on-demand systems, Proc. ACM Conf. Computer Systems (EuroSys 06), ACM Press, pp.333-344 (2006).

DOI: 10.1145/1217935.1217968

Google Scholar

[5] Z. H. Tang. Hotspot Detection by Improved Adaptive Finite Element Method and its Application in High-Speed PCB and IC Package Design, IEEE Transactions on Components, Packaging and Manufacturing Technology, vol. 2, pp.1659-1665 (2012).

DOI: 10.1109/tcpmt.2012.2193146

Google Scholar

[6] M. Joos, Review of G.K. Zipf – the psychobiology of language, Language, Vol. 12, pp.196-210 (1936).

Google Scholar