Towards optimal content replication and request routing in content delivery networks
(2015) IEEE International Conference on Communications, ICC 2015 p.5733-5739- Abstract
- Cooperative content replication and request routing (C2R3) has emerged as a promising technique to enhance the efficiency of content delivery networks (CDN). Most existing approaches to C2R3 focus on efficient bandwidth usage and assume a hierarchical CDN architecture targeted towards the delivery of specific content types (e.g., video). Therefore, C2R3 problem of covering the broad range of content types with minimum content access delay in a general CDN architecture has attracted little attention. As a potential solution to C2R3, cooperative web caching techniques have become mature. However, these techniques were designed to improve performance indicators tailored to web contents only (i.e., hit rate and byte hit rate). Arguably,... (More)
- Cooperative content replication and request routing (C2R3) has emerged as a promising technique to enhance the efficiency of content delivery networks (CDN). Most existing approaches to C2R3 focus on efficient bandwidth usage and assume a hierarchical CDN architecture targeted towards the delivery of specific content types (e.g., video). Therefore, C2R3 problem of covering the broad range of content types with minimum content access delay in a general CDN architecture has attracted little attention. As a potential solution to C2R3, cooperative web caching techniques have become mature. However, these techniques were designed to improve performance indicators tailored to web contents only (i.e., hit rate and byte hit rate). Arguably, improving such indicators does not necessarily lead to optimal access delay especially when the current trend of user-generated contents with diverse popularities and sizes are taken into account. In this paper, we formulate C2R3 as an optimization problem with the objective of minimizing content access delay in a general CDN architecture. A new performance indicator is introduced, and two popularity-based cooperative algorithms are proposed to approach the NP-hard C2R3 problem. Under broad ranges of cache size and popularity distribution parameters, we compare the proposed methods with a cooperative recency-based web caching method. Our simulation results show that the popularity-based methods outperform the recency-based method, and demonstrate close to optimal performance in representative scenarios of real-world situations. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/8056758
- author
- Amani, Payam LU ; Bastani, Saeed LU and Landfeldt, Björn LU
- organization
- publishing date
- 2015
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- 2015 IEEE International Conference on Communications (ICC)
- pages
- 7 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE International Conference on Communications, ICC 2015
- conference location
- London, United Kingdom
- conference dates
- 2015-06-08 - 2015-06-12
- external identifiers
-
- scopus:84953741148
- ISBN
- 978-1-4673-6432-4
- DOI
- 10.1109/ICC.2015.7249236
- project
- ELLIIT LU P01: WP2 Networking solutions
- language
- English
- LU publication?
- yes
- id
- 4f882b61-6d9e-4945-9922-7203c6143adc (old id 8056758)
- date added to LUP
- 2016-04-04 10:39:37
- date last changed
- 2022-05-17 03:12:13
@inproceedings{4f882b61-6d9e-4945-9922-7203c6143adc,
abstract = {{Cooperative content replication and request routing (C2R3) has emerged as a promising technique to enhance the efficiency of content delivery networks (CDN). Most existing approaches to C2R3 focus on efficient bandwidth usage and assume a hierarchical CDN architecture targeted towards the delivery of specific content types (e.g., video). Therefore, C2R3 problem of covering the broad range of content types with minimum content access delay in a general CDN architecture has attracted little attention. As a potential solution to C2R3, cooperative web caching techniques have become mature. However, these techniques were designed to improve performance indicators tailored to web contents only (i.e., hit rate and byte hit rate). Arguably, improving such indicators does not necessarily lead to optimal access delay especially when the current trend of user-generated contents with diverse popularities and sizes are taken into account. In this paper, we formulate C2R3 as an optimization problem with the objective of minimizing content access delay in a general CDN architecture. A new performance indicator is introduced, and two popularity-based cooperative algorithms are proposed to approach the NP-hard C2R3 problem. Under broad ranges of cache size and popularity distribution parameters, we compare the proposed methods with a cooperative recency-based web caching method. Our simulation results show that the popularity-based methods outperform the recency-based method, and demonstrate close to optimal performance in representative scenarios of real-world situations.}},
author = {{Amani, Payam and Bastani, Saeed and Landfeldt, Björn}},
booktitle = {{2015 IEEE International Conference on Communications (ICC)}},
isbn = {{978-1-4673-6432-4}},
language = {{eng}},
pages = {{5733--5739}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{Towards optimal content replication and request routing in content delivery networks}},
url = {{http://dx.doi.org/10.1109/ICC.2015.7249236}},
doi = {{10.1109/ICC.2015.7249236}},
year = {{2015}},
}