内容交付网络的蜜蜂算法

Rama Ferguson, Brody Voth, Zachary di Giovanni, Diego Felix de Almeida, Michal Aibin
{"title":"内容交付网络的蜜蜂算法","authors":"Rama Ferguson, Brody Voth, Zachary di Giovanni, Diego Felix de Almeida, Michal Aibin","doi":"10.1109/CCECE47787.2020.9255719","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":296506,"journal":{"name":"2020 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Honeybee Algorithm for Content Delivery Networks\",\"authors\":\"Rama Ferguson, Brody Voth, Zachary di Giovanni, Diego Felix de Almeida, Michal Aibin\",\"doi\":\"10.1109/CCECE47787.2020.9255719\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":296506,\"journal\":{\"name\":\"2020 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCECE47787.2020.9255719\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE47787.2020.9255719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

现代和云就绪服务的快速变化和增加“按需”增加了内容交付网络(cdn)的利用率,以有效地向最终用户提供服务和内容。为了最小化通信成本和平均等待时间,有必要将最终用户的请求发送到最佳可用服务器。在本文中,我们设计并实现了一种蜜蜂算法,该算法可以快速适应可能的服务器停机时间,以避免通信延迟。然后,我们将其与文献中可用的其他算法进行比较。最后,使用具有网络问题的各种场景执行评估,例如单个服务器故障或由多个服务器问题组成的自然灾害。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Honeybee Algorithm for Content Delivery Networks
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信