Fuzzy based dynamic load balancing scheme for efficient edge server selection in Cloud-oriented content delivery network using Voronoi diagram

Sandip Roy, R. Bose, D. Sarddar
{"title":"Fuzzy based dynamic load balancing scheme for efficient edge server selection in Cloud-oriented content delivery network using Voronoi diagram","authors":"Sandip Roy, R. Bose, D. Sarddar","doi":"10.1109/IADCC.2015.7154822","DOIUrl":null,"url":null,"abstract":"Any given Euclidean space can be partitioned into non-overlapping regions using Voronoi diagram and the Delaunay triangulation connects sites using nearest-neighbor fashion. Realistically in this context, all the edge servers are scattered over the Earth surface and can be clustered using Voronoi diagram. Now nearest edge server selection by Delaunay triangulation over the Voronoi diagram is our prime target. Due to the large demand of Internet content coming from burst crowd, performance of the Cloud-oriented content delivery networks is drastically reduced. To improve the said performance degradation, nearest edge server selection is a primary goal of cloud service provider (like Akamai Technologies, Amazon CloudFront, Mirror Image Internet etc.). Empirically all the time load of the nearest edge server is not eligible for responding the user request. Therefore load balancing is also important criteria for selecting suitable edge server. In this paper, we have presented Fuzzy Based Least Response Time (FLRT) dynamic load balancing algorithm and which is effective for crisps input from different heterogeneous system. Thus, FLRT is a novel paradigm which can select nearest neighbor edge server from user's current location where response time and load of the edge server is lowest.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IADCC.2015.7154822","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Any given Euclidean space can be partitioned into non-overlapping regions using Voronoi diagram and the Delaunay triangulation connects sites using nearest-neighbor fashion. Realistically in this context, all the edge servers are scattered over the Earth surface and can be clustered using Voronoi diagram. Now nearest edge server selection by Delaunay triangulation over the Voronoi diagram is our prime target. Due to the large demand of Internet content coming from burst crowd, performance of the Cloud-oriented content delivery networks is drastically reduced. To improve the said performance degradation, nearest edge server selection is a primary goal of cloud service provider (like Akamai Technologies, Amazon CloudFront, Mirror Image Internet etc.). Empirically all the time load of the nearest edge server is not eligible for responding the user request. Therefore load balancing is also important criteria for selecting suitable edge server. In this paper, we have presented Fuzzy Based Least Response Time (FLRT) dynamic load balancing algorithm and which is effective for crisps input from different heterogeneous system. Thus, FLRT is a novel paradigm which can select nearest neighbor edge server from user's current location where response time and load of the edge server is lowest.
基于Voronoi图的云内容分发网络边缘服务器选择模糊动态负载均衡方案
任何给定的欧几里得空间都可以使用Voronoi图划分为不重叠的区域,Delaunay三角剖分使用最近邻的方式连接站点。实际上,在这种情况下,所有边缘服务器都分散在地球表面,可以使用Voronoi图进行集群。现在,通过Delaunay三角法在Voronoi图上选择最近的边缘服务器是我们的主要目标。由于突发人群对互联网内容的大量需求,使得面向云的内容分发网络的性能大大降低。为了改善上述性能下降,选择最接近边缘的服务器是云服务提供商(如Akamai Technologies、Amazon CloudFront、Mirror Image Internet等)的主要目标。根据经验,最近的边缘服务器的所有时间负载都不符合响应用户请求的条件。因此,负载均衡也是选择合适的边缘服务器的重要标准。本文提出了一种基于模糊最小响应时间(FLRT)的动态负载均衡算法,该算法对不同异构系统的薯片输入是有效的。因此,FLRT是一种新的范例,它可以从用户当前位置选择最近邻的边缘服务器,在用户当前位置边缘服务器的响应时间和负载最低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信