Login (DCU Staff Only)
Login (DCU Staff Only)

DORAS | DCU Research Repository

Explore open access research and scholarly works from DCU

Advanced Search

Towards simulation and optimization of cache placement on large virtual Content Distribution Networks

Filelis-Papadopoulos, Christos, Takako Endo, Patricia orcid logoORCID: 0000-0002-9163-5583, Bendechache, Malika orcid logoORCID: 0000-0003-0069-1860, Svorobej, Sergej orcid logoORCID: 0000-0001-8900-8700, Giannoutakis, Konstantinos orcid logoORCID: 0000-0001-8939-4912, Gravvanis, George A. orcid logoORCID: 0000-0003-1562-3633, Tzovaras, Dimitrios, Byrne, James orcid logoORCID: 0000-0002-9260-6020 and Lynn, Theo orcid logoORCID: 0000-0001-9284-7580 (2019) Towards simulation and optimization of cache placement on large virtual Content Distribution Networks. Journal of computational science, 39 . ISSN 1877-7503

Abstract
IP video traffic is forecast to be 82% of all IP traffic by 2022. Traditionally, Content Distribution Networks (CDN) were used extensively to meet the quality of service levels for IP video services. To handle the dramatic growth in video traffic, CDN operators are migrating their infrastructure to the cloud and fog in order to leverage its greater availability and flexibility. For hyper-scale deployments, energy consumption, cache placement, and resource availability can be analyzed using simulation in order to improve resource utilization and performance. Recently, a discrete-time simulator for modelling hierarchical virtual CDNs (vCDNs) was proposed with reduced memory requirements and increased performance using multi-core systems to cater to the scale and complexity of these networks. The first iteration of this discrete-time simulator featured a number of limitations impacting accuracy and applicability: it supports only tree-based topology structures, the results are computed per level, and requests of the same content differ only in time duration. In this paper, we present an improved simulation framework that (a) supports graph-based network topologies, (b) requests have been reconstituted for differentiation of requirements, and (c) statistics are now computed per site and network metrics per link, improving the granularity and parallel performance. Moreover, we also propose a two-phase optimization scheme that makes use of simulation outputs to guide the search for optimal cache placements. In order to evaluate our proposal, we simulate a vCDN network based on real traces obtained from the BT vCDN infrastructure and analyze performance and scalability aspects.
Metadata
Item Type:Article (Published)
Refereed:Yes
Additional Information:Article number 101052
Uncontrolled Keywords:vCDN; Parallel simulation; Cache placement; Simulation-based optimization
Subjects:Computer Science > Computer simulation
DCU Faculties and Centres:DCU Faculties and Schools > Faculty of Engineering and Computing > School of Computing
Research Institutes and Centres > ADAPT
Publisher:Elsevier
Official URL:http://dx.doi.org/10.1016/j.jocs.2019.101052
Copyright Information:© 2019 Elsevier
Use License:This item is licensed under a Creative Commons Attribution-NonCommercial-Share Alike 3.0 License. View License
ID Code:24470
Deposited On:22 May 2020 16:40 by Malika Bendechache . Last Modified 15 Nov 2021 04:30
Documents

Full text available as:

[thumbnail of Towards_simulation_and_optimization_of_large_virtual_Content_Distribution_Networks__Revised_.pdf]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
1MB
Downloads

Downloads

Downloads per month over past year

Archive Staff Only: edit this record