具有随机路径探索的生物启发自适应路由协议

Tomohiro Nakao, J. Teramae, N. Wakamiya
{"title":"具有随机路径探索的生物启发自适应路由协议","authors":"Tomohiro Nakao, J. Teramae, N. Wakamiya","doi":"10.4108/eai.3-12-2015.2262489","DOIUrl":null,"url":null,"abstract":"Rapid increase in amount of traffic and the number of users of information communication networks requires adaptive routing protocols that can properly respond to unexpected change of communication environment such as rapid and large fluctuation of traffic. While distributed routing protocols that use only local state of the network have been expected to suitable for adaptive routing on large scale net- work, the lack of global information of the network often makes it difficult to promptly respond to traffic changes of the network when it occurs at out of the local scope. In this paper, based on the biologically-inspired attractor selection model, we propose a distributed routing protocol with active and stochastic route exploration. Acquiring current state of the network beyond its local scope by utilizing stochastic nature of the protocol, the routing protocol can efficiently respond to rapid change of traffic demand on the network. In order to avoid destabilization of routings due to the exploration, we introduce a short-term memory term to the governing equation of the protocol. We also confirm that the protocol successfully balances rapid exploration with stable routing owing to the memory term by numerical simulations.","PeriodicalId":299985,"journal":{"name":"EAI Endorsed Trans. Mob. Commun. Appl.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Biologically-inspired adaptive routing protocol with stochastic route exploration\",\"authors\":\"Tomohiro Nakao, J. Teramae, N. Wakamiya\",\"doi\":\"10.4108/eai.3-12-2015.2262489\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Rapid increase in amount of traffic and the number of users of information communication networks requires adaptive routing protocols that can properly respond to unexpected change of communication environment such as rapid and large fluctuation of traffic. While distributed routing protocols that use only local state of the network have been expected to suitable for adaptive routing on large scale net- work, the lack of global information of the network often makes it difficult to promptly respond to traffic changes of the network when it occurs at out of the local scope. In this paper, based on the biologically-inspired attractor selection model, we propose a distributed routing protocol with active and stochastic route exploration. Acquiring current state of the network beyond its local scope by utilizing stochastic nature of the protocol, the routing protocol can efficiently respond to rapid change of traffic demand on the network. In order to avoid destabilization of routings due to the exploration, we introduce a short-term memory term to the governing equation of the protocol. We also confirm that the protocol successfully balances rapid exploration with stable routing owing to the memory term by numerical simulations.\",\"PeriodicalId\":299985,\"journal\":{\"name\":\"EAI Endorsed Trans. Mob. Commun. Appl.\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EAI Endorsed Trans. Mob. Commun. Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4108/eai.3-12-2015.2262489\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EAI Endorsed Trans. Mob. Commun. Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/eai.3-12-2015.2262489","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随着信息通信网络通信量和用户数量的快速增长,需要自适应路由协议能够对通信量的快速、大波动等通信环境的意外变化做出适当的响应。仅使用网络局部状态的分布式路由协议被认为适用于大规模网络的自适应路由,但由于缺乏网络的全局信息,往往难以及时响应网络在局部范围外的流量变化。本文在生物吸引子选择模型的基础上,提出了一种主动和随机路径探索的分布式路由协议。路由协议利用协议的随机特性获取网络局部范围之外的当前状态,能够有效地响应网络上流量需求的快速变化。为了避免由于探索导致的路由不稳定,我们在协议的控制方程中引入了短期记忆项。通过数值模拟,我们还证实了该协议成功地平衡了快速探索和稳定路由。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Biologically-inspired adaptive routing protocol with stochastic route exploration
Rapid increase in amount of traffic and the number of users of information communication networks requires adaptive routing protocols that can properly respond to unexpected change of communication environment such as rapid and large fluctuation of traffic. While distributed routing protocols that use only local state of the network have been expected to suitable for adaptive routing on large scale net- work, the lack of global information of the network often makes it difficult to promptly respond to traffic changes of the network when it occurs at out of the local scope. In this paper, based on the biologically-inspired attractor selection model, we propose a distributed routing protocol with active and stochastic route exploration. Acquiring current state of the network beyond its local scope by utilizing stochastic nature of the protocol, the routing protocol can efficiently respond to rapid change of traffic demand on the network. In order to avoid destabilization of routings due to the exploration, we introduce a short-term memory term to the governing equation of the protocol. We also confirm that the protocol successfully balances rapid exploration with stable routing owing to the memory term by numerical simulations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信