Honeybee Algorithm for Content Delivery Networks

被引：0

作者：

Ferguson, Rama ^{[1
]}

Voth, Brody ^{[1
]}

di Giovanni, Zachary ^{[1
]}

de Almeida, Diego Felix ^{[1
]}

Aibin, Michal ^{[1
]}

机构：

[1] British Columbia Inst Technol, Dept Comp, Vancouver, BC, Canada

来源：

2020 IEEE CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE) | 2020年

关键词：

content delivery networks; optimization; routing;

D O I：

10.1109/ccece47787.2020.9255719

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The rapid changes and increase of modern and cloud-ready services "on-demand" increase the utilization of Content Delivery Networks (CDNs) to deliver service and content to end-users efficiently. In order to minimize the communication cost and the average waiting time, it is necessary to send the end-users' requests to the best available servers. In this paper, we design and implement a Honeybee algorithm that adapts quickly to possible servers' downtime to avoid communication delays. We then compare it to other algorithms available in the literature. Finally, the evaluation is performed using various scenarios with networking issues, such as single server failures or natural disasters consisting of multiple server issues.

引用

页数：4

共 10 条

[1] Aibin M., 2017, THESIS WROCLAW U SCI
[2] Akamai, 2019, MED DEL NETW MAP
[3] [Anonymous], 2016, GLOB CLOUD IND FOR M
[4] Borylo P., 2020, GUIDE DISASTER RESIL, P1
[5] Furdek M, 2016, PROCEEDINGS OF 2016 8TH INTERNATIONAL WORKSHOP ON RESILIENT NETWORKS DESIGN AND MODELING (RNDM), P43, DOI 10.1109/RNDM.2016.7608266
[6] Ghasemi H., 2019, NOVEL COMMUNICATION, P1
[7] Ghasemi H., 2017, P IEEE S COMP COMM
[8] Hadadan S, 2019, JAVA CONTENT DELIVER
[9] Mathew V, 2012, IEEE INFOCOM SER, P954, DOI 10.1109/INFCOM.2012.6195846
[10] Pathan A. K., 2006, TAXONOMY SURVEY CONT

← 1 →