[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.7236/IJIBC.2022.14.3.1

On the comparison of mean object size in M/G/1/PS model and M/BP/1 model for web service

Lee, Yongjin (Dept. of Technology Education, Korea National University of Education)

Publication Information

International Journal of Internet, Broadcasting and Communication / v.14, no.3, 2022 , pp. 1-7 More about this Journal

Abstract

This paper aims to compare the mean object size of M/G/1/PS model with that of M/BP/1 model used in the web service. The mean object size is one of important measure to control and manage web service economically. M/G/1/PS model utilizes the processor sharing in which CPU rotates in round-robin order giving time quantum to multiple tasks. M/BP/1 model uses the Bounded Pareto distribution to describe the web service according to file size. We may infer that the mean waiting latencies of M/G/1/PS and M/BP/1 model are equal to the mean waiting latency of the deterministic model using the round robin scheduling with the time quantum. Based on the inference, we can find the mean object size of M/G/1/PS model and M/BP/1 model, respectively. Numerical experiments show that when the system load is smaller than the medium, the mean object sizes of the M/G/1/PS model and the M/BP/1 model become the same. In particular, when the shaping parameter is 1.5 and the lower and upper bound of the file size is small in the M/BP/1 model, the mean object sizes of M/G/1/PS model and M/BP/1 model are the same. These results confirm that it is beneficial to use a small file size in a web service.

Keywords

mean object size; M/G/1/PS; M/BP/1; deterministic model; web service; multiple access users;

Citations & Related Records

Times Cited By KSCI : 1 (Citation Analysis)

Reference
Cited By KSCI

1	M. Harchol-Balter, Performance Modeling and Design of Computer Systems, Cambridge University Press, USA, 2013. pp. 353-358
2	Y. -J. Lee, "Mean object size considering average waiting latency in M/BP/1 system," International Journal of Computer Networks and Communications, vol. 12, no. 5, 2020. DOI: https://dx.doi.org/10.2139/ssrn.3724774 DOI
3	S. Ross, Introduction to Probability Model, 12th Ed., Academic press, New York, 2019, USA.
4	W. Shi, E. Collins, and V. Karamcheti, "Modeling object characteristics of dynamic web content," Journal of Parallel and Distributed Computing," vol. 63, no. 10, 2003. DOI: https://doi.org/10.1016/j.jpdc.2003.05.001 DOI
5	Y. Lee, "Mean object comparison of M/G/1/PS and TDM system," ICIC Express Letters, vol. 12, no. 5, pp. 417-423, 2018. DOI: https://doi.org/10.24507/icicel.12.05.417 DOI
6	Riska, V. Diev and E. Smirni, "Efficient fitting of long-tailed data sets into hyper-exponential distributions," Proc. of IEEE Global Telecommunications Conference (GLOBECOM 2002), vol. 3, pp. 2513-2517, 2002. DOI: https://doi.org/10.1109/GLOCOM.2002.1189083 DOI
7	Y. -J. Lee, "Web object size satisfying mean waiting time in multiple access environment," International Journal of Computer Networks and Communications, vol. 6, no. 4, pp.1-9, 2014. DOI: https://doi.org/10.5121/ijcnc.2014.6401 DOI
8	R. Khayari, R. Sadre and B. R. Haverkort, "Fitting world-wide web request traces with the EM-algorithm," Performance Evaluation, vol. 52, no. 2, 2003. DOI: https://doi.org/10.1016/S0166-5316(02)00179-7 DOI
9	S. Aalto, U. Ayesta, E. Nyberg-Oksanen, "M/G/1/MLPS compared to M/G/1/PS", Operations Research Letters, vol. 33, no. 5, pp. 519-524, 2005. DOI: https://doi.org/10.1016/j.orl.2004.09.009 DOI
10	F. Grassi and A. Coluccia, "On the sum of random samples with bounded Pareto distribution", Signal Processing, vol. 192, 2022. DOI: https://doi.org/10.1016/j.sigpro.2021.108389 DOI