Analysis of the method of optimized data caching in the Content Delivery Network
DOI:
https://doi.org/10.30837/pt.2018.1.03Abstract
Concept of Content Delivery Network (CDN) system and methods of caching data on edge servers were considered in this paper. The main task of the CDN network is providing the qualitative information delivery to the end user. Content Delivery Network is a geographically distributed network, that contain a number of content servers and routers. As a rule, it consists of a main node (Origin), and caching nodes (Edges) – points of presence, which can be located in various parts of the world. All content is stored and updated on the Origin server. The structural scheme of organizing the work of the CDN network, consisting of three complementary planes, was presented. Each plane performs special functions and has its own implementation features. Access Plane provides end-user access to content and the interaction of caching servers among themselves and on other planes. The load balancing plane is organized according to the principle of the DNS service and allows to redirect the user's requests to the nearest caching servers. This plane also inter-acts with the metric plane, which contains up-to-date information of the status of all servers involved in delivery and caching of data. As part of this paper, we proposed a method for optimized caching of data in the CDN network. The algorithm of this method is presented. Dependencies that make it possible to evaluate the work of this method in comparison with existing methods are given. The proposed method allows to significantly improve the Hit Ratio, and thus ensure efficient use of cached data and reduce the load on servers of origin.References
“The Zettabyte Era: Trends and Analysis. Cisco, 7 June 2017“. https://files.ifi.uzh.ch/hilty/t/Literature_by_RQs/RQ%20102/2015_Cisco_Zettabyte_ Era.pdf.
CHAKRABORTY, S.; SARDDAR, D. “An Efficient Edge Server Selection in Content Delivery Network using Dijkstra’s Shortest Path Routing Algorithm with Euclidean Distance,“ International Journal of Computer Applications, v.117, n.4., p. 24-26, 2015.
PARFENOV, V.I.; ZOLOTAREV, S.V. “Ob odnom algoritme reshenija zadachi optimal'noj marshrutizacii po kriteriju sred-nej zaderzhki“ [On one algorithm for solving the optimal routing problem by the average delay criterion], Bulletin of VGU. Series: Physics. Maths., n. 2, р. 28–33, 2007. (In Russian).
SHVARC, M. Seti svjazi: protokoly, modelirovanie i analiz: Per. s anlg. [Telecommunication Networks: Protocols, Modeling, and Analysis] [In Russian], v.1, М.: Nauka, 1992.
YAW-CHUNG, C.; LIAO, C.-Y. "Improving quality of experience in P2P IPTV." Proc of the 2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS), 5-7 October 2016, Kanazawa, Japan, IEEE, 2016, p. 1-4. DOI: https://doi.org/10.1109/APNOMS.2016.7737249.
KLYMASH, M.; KYRYK, M.; PLESKANKA, N.; YANYSHYN, V. “Data Buffering Multilevel Model at a Multiservice Traffic Service Node,“ Smart Computing Review, v.4., n.4., р. 294-306, 2014.
BAI, Y.; JIA, B.; ZHANG, J.; PU, Q. “An Efficient Load Balancing Technology in CDN,“ Proc. of the Sixth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD'09, 14-16 August 2009, Tianjin, China. IEEE, 2009, v.7, p. 510-514. DOI: https://doi.org/10.1109/FSKD.2009.130.
DMITRIEV, G.A.; MARGOLIS, B.I.; MUZANNA, M.M. “Reshenie zadachi optimal'noj marshru-tizacii po kriteriju zagruzhennosti seti“ [Solution of the optimal routing problem by network load criterion], Programmnye produkty i sistemy, n.4, р. 17–19, 2013. (In Russian).
PALLIS, G.; KONSTANTINOS, S.; ATHENA, V. “Replication based on Objects Load under a Content Distribution Network,“ Proc. of the 22nd International Conference on Data Engineering Workshops, ICDE-2006, 3-7 April 2006, Atlanta, GA, USA. IEEE, 2006, p. 1-9. DOI: https://doi.org/ 10.1109/ICDEW.2006.127.
WAUTERS, T.; COPPENS, J.; DHOEDT, B.; DEMEESTER, P. “Load balancing through efficient distributed content placement,“ Proc. of conference on Next Generation Internet Networks, 18-20 April 2005, Rome, Italy, IEEE, 2005, p. 99–105. DOI: https://doi.org/10.1109/NGI.2005.1431653.
HAGHIGHI, A.; MISHEV, D. Queueing models in industry and business. Nova Science Publishers, Inc., New York, 2008.
DATTATREYA, G. Performance analysis of queuing and computer networks. CRC Press, Boca Raton, 2008.
KLEINROCK, L. Teorija massovogo obsluzhivanija. Per. s anlg. [Queueing systems] [In Russian]. M.: Mashinostroenie, 1979.
Пристатейна бібліографія
The Zettabyte Era: Trends and Analysis. Cisco, 7 June 2017. [Електронний ресурс]. – Режим доступу: https://files.ifi.uzh.ch/hilty/t/Literature_by_RQs/RQ%20102/2015_Cisco_Zettabyte_ Era.pdf.
Chakraborty S., Sarddar D. An Efficient Edge Server Selection in Content Delivery Network using Dijkstra’s Shortest Path Routing Algorithm with Euclidean Distance // International Journal of Computer Applications. – 2015. – Vol. 117, No. 4. – Р. 24-26.
Парфенов В.И., Золотарев С.В. Об одном алгоритме решения задачи оптимальной маршрутизации по критерию средней задержки // Вестник ВГУ: сер. Физика. Математика. – 2007. – № 2. – С. 28–32.
Шварц М. Сети связи: протоколы, моделирование и анализ: пер. с англ.: Ч. 1. – М.: Наука, 1992. – 336 с.
Yaw-chung Chen. Improving Quality of Experience in P2P IPTV // Network Operations and Management Symposium (APNOMS) 18th. – Asia-Pacific, 2016. – P. 6-9.
Klymash M., Kyryk M., Pleskanka N., Yanyshyn V. Data Buffering Multilevel Model at a Multiservice Traffic Service Node // Smart Computing Review. – 2014. – Vol. 4. No. 4. – P. 294-306.
Bai Y., Jia B., Zhang J., Pu Q. An Efficient Load Balancing Technology in CDN // Fuzzy Systems and Knowledge Discovery, 2009. FSKD'09. Sixth International Conference on. – IEEE, 2009. – Т. 7. – Р. 510-514.
Дмитриев Г.А., Марголис Б.И., Музанна М.М. Решение задачи оптимальной маршрутизации по критерию загруженности сети // Программные продукты и системы. – 2013. – № 4. – С. 17–19.
Pallis George, Konstantinos Stamos, Athena Vakali «and other». Replication based on Objects Load under a Content Distribution Network // Proceedings of the 22nd International Conference on Data Engineering Workshops, ICDE 2006, 3-7 April 2006, Atlanta, GA, USA. – Р. 1-9.
Wauters T., Coppens J., Dhoedt B., Demeester P. Load balancing through efficient distributed content placement // In proceeding of: Next Generation Internet Networks. – NY, 2005. – P. 99–105.
Дмитриев Г.А., Марголис Б.И., Музанна М.М. Решение задачи оптимальной маршрутизации по критерию загруженности сети // Программные продукты и системы. – 2013. – № 4. – С. 17–19.
Парфенов В.И., Золотарев С.В. Об одном алгоритме решения задачи оптимальной маршрутизации по критерию средней задержки // Вестник ВГУ. Серия: Физика. Математика. – 2007. – № 2. – С. 28–33.
Клейнрок Л. Теория массового обслуживания. Пер. с англ. / Пер. И. И. Грушко; ред. В. И. Нейман. – М.: Машиностроение, 1979. – 512 с.
Downloads
Published
Issue
Section
License
Copyright (c) 2019 Problemi telekomunìkacìj
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
