A multiple segmented backups scheme for dependable real-time communication in multihop networks

G. Ranjith, C. Murthy
{"title":"A multiple segmented backups scheme for dependable real-time communication in multihop networks","authors":"G. Ranjith, C. Murthy","doi":"10.1109/IPDPS.2003.1213240","DOIUrl":null,"url":null,"abstract":"Several distributed real-time applications require fault-tolerance apart from guaranteed timeliness at acceptable levels of overhead. It is essential to provide them with hard guarantees on recovery delays due to component-failures, which cannot be ensured in traditional datagram services. The application of computer networks have expanded to areas in which communication services are considered critical and the failure of which may lead to mission threatening scenarios. These critical communication services need to survive multiple, simultaneous component faults that can occur in the network, due to various reasons. Several schemes exist which attempt to guarantee recovery in a timely and resource efficient manner from such multiple faults. These methods center around apriori reservation of network resources called spare resources along backup channels, in addition to each primary channel. These backup channels (end-to-end backup) are usually routed from the source to the destination along a path disjoint with the primary. If a primary channel fails, one of the backups can be activated, and this makes the realtime connection dependable. In this paper, we propose a new method of multiple segmented backups for dependable communication in multihop networks, which improves upon existing methods. Various scenarios in multihop networks (including the current Internet) where our scheme can be implemented are also discussed. Finally, we demonstrate the superiority of our method by presentation of the results of our simulation studies.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"154 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Parallel and Distributed Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPS.2003.1213240","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Several distributed real-time applications require fault-tolerance apart from guaranteed timeliness at acceptable levels of overhead. It is essential to provide them with hard guarantees on recovery delays due to component-failures, which cannot be ensured in traditional datagram services. The application of computer networks have expanded to areas in which communication services are considered critical and the failure of which may lead to mission threatening scenarios. These critical communication services need to survive multiple, simultaneous component faults that can occur in the network, due to various reasons. Several schemes exist which attempt to guarantee recovery in a timely and resource efficient manner from such multiple faults. These methods center around apriori reservation of network resources called spare resources along backup channels, in addition to each primary channel. These backup channels (end-to-end backup) are usually routed from the source to the destination along a path disjoint with the primary. If a primary channel fails, one of the backups can be activated, and this makes the realtime connection dependable. In this paper, we propose a new method of multiple segmented backups for dependable communication in multihop networks, which improves upon existing methods. Various scenarios in multihop networks (including the current Internet) where our scheme can be implemented are also discussed. Finally, we demonstrate the superiority of our method by presentation of the results of our simulation studies.
多跳网络中可靠实时通信的多分段备份方案
几个分布式实时应用程序除了在可接受的开销水平上保证时效性外,还需要容错性。对于由于组件故障导致的恢复延迟,必须为它们提供硬保证,这在传统的数据报服务中是无法保证的。计算机网络的应用已扩大到通信服务被认为至关重要的领域,通信服务的失败可能导致威胁任务的情况。由于各种原因,这些关键的通信服务需要承受网络中可能同时发生的多个组件故障。有几种方案试图保证从这种多重故障中及时和资源有效地恢复。除了每个主通道之外,这些方法围绕着先验地保留网络资源(称为备用资源)。这些备份通道(端到端备份)通常沿着与主通道不相交的路径从源路由到目标。如果主通道发生故障,则可以激活其中一个备份,这使得实时连接可靠。本文在现有方法的基础上,提出了一种多跳网络中可靠通信的分段备份方法。本文还讨论了多跳网络(包括当前的Internet)中可以实现我们的方案的各种场景。最后,我们通过仿真研究的结果来证明我们方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信