Optimal cache-based route repair for real-time traffic

Chuan Han, Yaling Yang, Y. Peng
{"title":"Optimal cache-based route repair for real-time traffic","authors":"Chuan Han, Yaling Yang, Y. Peng","doi":"10.1109/ICNP.2010.5762770","DOIUrl":null,"url":null,"abstract":"Real-time applications in ad hoc networks require fast route repair mechanisms to minimize the interruptions to their communications. Cache-based route repair schemes are popular choices since they can quickly resume communications using cached backup paths after a route break. In this paper, through thorough theoretical modeling of the cache-based route repair process, we derive the optimal cache-based route repair policy. This optimal policy considers both the overhead of the route repair schemes and the promptness of the repair action. The correctness and advantages of our optimal policy are validated by extensive simulations.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 18th IEEE International Conference on Network Protocols","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP.2010.5762770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Real-time applications in ad hoc networks require fast route repair mechanisms to minimize the interruptions to their communications. Cache-based route repair schemes are popular choices since they can quickly resume communications using cached backup paths after a route break. In this paper, through thorough theoretical modeling of the cache-based route repair process, we derive the optimal cache-based route repair policy. This optimal policy considers both the overhead of the route repair schemes and the promptness of the repair action. The correctness and advantages of our optimal policy are validated by extensive simulations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于缓存的实时流量最优路由修复
自组织网络中的实时应用需要快速路由修复机制,以尽量减少对其通信的中断。基于缓存的路由修复方案是受欢迎的选择,因为它们可以在路由中断后使用缓存的备份路径快速恢复通信。本文通过对基于缓存的路由修复过程进行深入的理论建模,推导出基于缓存的最优路由修复策略。该最优策略既考虑了线路修复方案的开销,又考虑了修复动作的及时性。通过大量的仿真验证了该优化策略的正确性和优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An opportunistic relay protocol for vehicular road-side access with fading channels Passive interference measurement in Wireless Sensor Networks Routing in max-min fair networks: A game theoretic approach Authentication and authorization protocol security property analysis with trace inclusion transformation and online minimization TowerDefense: Deployment strategies for battling against IP prefix hijacking
×
引用
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