A Novel NAT-based Approach for Resource Load Balancing in Fog Computing Architecture

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of Internet Technology Pub Date : 2021-05-01 DOI:10.3966/160792642021052203002
Chin-Feng Lai, Hung-Yen Weng, Hao Yu Chou, Yueh-Min Huang
{"title":"A Novel NAT-based Approach for Resource Load Balancing in Fog Computing Architecture","authors":"Chin-Feng Lai, Hung-Yen Weng, Hao Yu Chou, Yueh-Min Huang","doi":"10.3966/160792642021052203002","DOIUrl":null,"url":null,"abstract":"In recent years, with the rise of the internet of things technology, most devices can be connected to the internet, resulting in fewer and fewer IP addresses. Therefore, the number of applications using NAT has also increased. Coupled with the rise of fog computing architecture, NAT traversal has become increasingly difficult to be implemented. Although many methods of traversing firewalls have been proposed and widely used in various communication archiectures, Users cannot rely solely on the central server to establish connections in the peer-to-peer network, which increases the loading on the NAT architecture and transport server. In the past, there have been related papers to solve this problem, and the goal is to increase the success rate of establishing a connection through a NAT server. Therefore, a novel load balancing solution is proposed in this study, and the loading value obtained from the SVM model is adopted as the basis for selecting the network address conversion server. At the end of the study, we not only discuss the maximum server loading, different analysis models, and the delay time added by the new processes in the architecture, but also find the proposed approach is able to achieve the loading balance with only a small increase in delay time.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"22 1","pages":"513-520"},"PeriodicalIF":0.9000,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Internet Technology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3966/160792642021052203002","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 3

Abstract

In recent years, with the rise of the internet of things technology, most devices can be connected to the internet, resulting in fewer and fewer IP addresses. Therefore, the number of applications using NAT has also increased. Coupled with the rise of fog computing architecture, NAT traversal has become increasingly difficult to be implemented. Although many methods of traversing firewalls have been proposed and widely used in various communication archiectures, Users cannot rely solely on the central server to establish connections in the peer-to-peer network, which increases the loading on the NAT architecture and transport server. In the past, there have been related papers to solve this problem, and the goal is to increase the success rate of establishing a connection through a NAT server. Therefore, a novel load balancing solution is proposed in this study, and the loading value obtained from the SVM model is adopted as the basis for selecting the network address conversion server. At the end of the study, we not only discuss the maximum server loading, different analysis models, and the delay time added by the new processes in the architecture, but also find the proposed approach is able to achieve the loading balance with only a small increase in delay time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于nat的雾计算架构资源负载均衡方法
近年来,随着物联网技术的兴起,大多数设备都可以连接到互联网,导致IP地址越来越少。因此,使用NAT的应用也越来越多。再加上雾计算架构的兴起,NAT穿越的实现难度越来越大。虽然已经提出了许多穿越防火墙的方法,并广泛应用于各种通信体系结构中,但在点对点网络中,用户不能完全依赖中心服务器来建立连接,这增加了NAT体系结构和传输服务器的负载。在过去,已经有相关的论文来解决这个问题,其目标是提高通过NAT服务器建立连接的成功率。因此,本文提出了一种新的负载均衡方案,并将SVM模型得到的负载值作为选择网络地址转换服务器的依据。在研究的最后,我们不仅讨论了最大服务器负载,不同的分析模型,以及架构中新进程增加的延迟时间,而且发现所提出的方法能够在延迟时间增加很小的情况下实现负载平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Internet Technology
Journal of Internet Technology COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
3.20
自引率
18.80%
发文量
112
审稿时长
13.8 months
期刊介绍: The Journal of Internet Technology accepts original technical articles in all disciplines of Internet Technology & Applications. Manuscripts are submitted for review with the understanding that they have not been published elsewhere. Topics of interest to JIT include but not limited to: Broadband Networks Electronic service systems (Internet, Intranet, Extranet, E-Commerce, E-Business) Network Management Network Operating System (NOS) Intelligent systems engineering Government or Staff Jobs Computerization National Information Policy Multimedia systems Network Behavior Modeling Wireless/Satellite Communication Digital Library Distance Learning Internet/WWW Applications Telecommunication Networks Security in Networks and Systems Cloud Computing Internet of Things (IoT) IPv6 related topics are especially welcome.
期刊最新文献
Abnormal Detection Method of Transship Based on Marine Target Spatio-Temporal Data Multidimensional Concept Map Representation of the Learning Objects Ontology Model for Personalized Learning Multiscale Convolutional Attention-based Residual Network Expression Recognition A Dynamic Access Control Scheme with Conditional Anonymity in Socio-Meteorological Observation A Behaviorally Evidence-based Method for Computing Spatial Comparisons of Image Scenarios
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1