Optimization of update intervals in Dead-Peer-Detection using adaptive Fuzzy Logic

Vesselin Tzvetkov
{"title":"Optimization of update intervals in Dead-Peer-Detection using adaptive Fuzzy Logic","authors":"Vesselin Tzvetkov","doi":"10.1109/AINA.2007.106","DOIUrl":null,"url":null,"abstract":"Internet is major communication media and staying \"online\" becomes a key requirement. Commonly, the broadband access and enterprise networks involve devices with dynamic NAPT(NAT) and statefull firewalls functionality. Keeping open connection behind such an intermediate device is not a trivial task. The intermediate device closes the connection without sending any notify to participants. Until proactively detaching the change of connection status, all send packets get lost. Most applications involve deed-peer-detection mechanisms to verify the host availability, thus if the connection is active. The fast detection of connection lost is vital for the application and therefore short constant dead-peer-detection intervals are used. The update interval is a tradeoff between the network resources and fast detection of disconnection. The interval values are currently constant and set based on the general network experience and application requirements. In this paper is suggested a new framework for dynamic optimization of the update intervals in respect of fast disconnection detection and low network resources. The key idea is to make the update interval proportional to the probability of connection drop. The main issue is that the time point of disconnection can only be narrowed down to certain update interval, the exact time point can not be determined by the hosts. The proposed solution is based on adaptive Fuzzy Logic. The simulation results are presented to verify the performance of the new method. The optimization is relevant for wide spectrum of applications, like VoIP, routing, security protocols etc.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2007.106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Internet is major communication media and staying "online" becomes a key requirement. Commonly, the broadband access and enterprise networks involve devices with dynamic NAPT(NAT) and statefull firewalls functionality. Keeping open connection behind such an intermediate device is not a trivial task. The intermediate device closes the connection without sending any notify to participants. Until proactively detaching the change of connection status, all send packets get lost. Most applications involve deed-peer-detection mechanisms to verify the host availability, thus if the connection is active. The fast detection of connection lost is vital for the application and therefore short constant dead-peer-detection intervals are used. The update interval is a tradeoff between the network resources and fast detection of disconnection. The interval values are currently constant and set based on the general network experience and application requirements. In this paper is suggested a new framework for dynamic optimization of the update intervals in respect of fast disconnection detection and low network resources. The key idea is to make the update interval proportional to the probability of connection drop. The main issue is that the time point of disconnection can only be narrowed down to certain update interval, the exact time point can not be determined by the hosts. The proposed solution is based on adaptive Fuzzy Logic. The simulation results are presented to verify the performance of the new method. The optimization is relevant for wide spectrum of applications, like VoIP, routing, security protocols etc.
基于自适应模糊逻辑的死对等检测更新间隔优化
互联网是主要的传播媒介,保持“在线”成为一个关键要求。通常,在宽带接入和企业网络中,会涉及到具有动态NAT (dynamic NAPT)和状态防火墙功能的设备。在这样一个中间设备后面保持打开的连接并不是一项简单的任务。中间设备关闭连接而不向参与者发送任何通知。在主动分离连接状态变化之前,所有发送数据包都会丢失。大多数应用程序都使用对等检测机制来验证主机的可用性,从而确定连接是否处于活动状态。快速检测连接丢失对应用程序至关重要,因此使用短的恒定死对等检测间隔。更新间隔是在网络资源和快速检测断开连接之间的权衡。间隔值目前是固定的,根据一般网络经验和应用需求设置。本文从快速断连检测和低网络资源的角度出发,提出了一种新的更新间隔动态优化框架。关键思想是使更新间隔与连接断开的概率成正比。主要问题是断网的时间点只能缩小到一定的更新间隔,主机无法确定确切的时间点。该方案基于自适应模糊逻辑。仿真结果验证了该方法的有效性。该优化适用于广泛的应用,如VoIP、路由、安全协议等。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信