Scalable Communication for High Performance and Inexpensive Reliable QoS using Relaxed Recovery

I. Chen, M. Ito
{"title":"Scalable Communication for High Performance and Inexpensive Reliable QoS using Relaxed Recovery","authors":"I. Chen, M. Ito","doi":"10.1109/NCA.2007.38","DOIUrl":null,"url":null,"abstract":"Providing high quality-of-service using a single reserved path easily suffers from single link failures. This paper provides a scalable solution, TPmax-R, to tolerate single link failures. TPmax-R is based on an existing method, AvoidPBO-R. TPmax-R reduces the communication cost incurred by AvoidPBO-R to a scalable level. Instead of broadcasting routing information of all the flows in the network, TPmax-R source nodes communicate only link-based information to each other. TPmax-R pairs a reserved primary path with a well chosen unreserved backup path. Conflicts that might occur in the event of failure are predicted and backup paths are chosen to avoid these conflicts. By carefully planning the backup paths, the resulting service quality provided to the flows after re-routing is expected to be very close to that before the failure. Initial simulations show that TPmax-R provides competitive service quality after the failure while using less overhead.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2007.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Providing high quality-of-service using a single reserved path easily suffers from single link failures. This paper provides a scalable solution, TPmax-R, to tolerate single link failures. TPmax-R is based on an existing method, AvoidPBO-R. TPmax-R reduces the communication cost incurred by AvoidPBO-R to a scalable level. Instead of broadcasting routing information of all the flows in the network, TPmax-R source nodes communicate only link-based information to each other. TPmax-R pairs a reserved primary path with a well chosen unreserved backup path. Conflicts that might occur in the event of failure are predicted and backup paths are chosen to avoid these conflicts. By carefully planning the backup paths, the resulting service quality provided to the flows after re-routing is expected to be very close to that before the failure. Initial simulations show that TPmax-R provides competitive service quality after the failure while using less overhead.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用放松恢复实现高性能和廉价可靠QoS的可扩展通信
使用单一保留路径提供高质量的服务容易遭受单链路故障。本文提供了一个可扩展的解决方案TPmax-R,以容忍单链路故障。TPmax-R是基于现有的一种方法——AvoidPBO-R。TPmax-R将AvoidPBO-R产生的通信成本降低到可扩展的水平。TPmax-R源节点之间只通信基于链路的信息,而不是广播网络中所有流的路由信息。TPmax-R将保留的主路径与精心选择的非保留备份路径配对。预测故障时可能发生的冲突,并选择备份路径以避免这些冲突。通过仔细规划备份路径,预计重路由后提供给流的最终服务质量将非常接近故障前的服务质量。初步仿真结果表明,TPmax-R在使用较少开销的情况下,在故障后提供具有竞争力的服务质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Constructing Overlay Networks with Low Link Costs and Short Paths Approximate Analytical Models for Networked Servers Subject to MMPP Arrival Processes A Global On-Demand Routing Protocol for Mobile Ad Hoc Networks On the Evaluation of Shortest Journeys in Dynamic Networks Multilayer In-service Reconfiguration for Network Computing Systems
×
引用
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