DRS:用于关键任务分布式应用程序的容错网络路由系统

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI:10.1109/ICCCN.1997.623298

Abdur Chowdhury, O. Frieder, D. Grossman, Eric W. Burger

{"title":"DRS:用于关键任务分布式应用程序的容错网络路由系统","authors":"Abdur Chowdhury, O. Frieder, D. Grossman, Eric W. Burger","doi":"10.1109/ICCCN.1997.623298","DOIUrl":null,"url":null,"abstract":"We present a novel proactive routing algorithm (dynamic routing system, DRS) that consistently searches for failures via frequent ICMP (Internet control message protocol) echo requests. Our algorithm differs from its predecessors in that it is proactive instead of reactive by looking for failures before they affect message transmissions. When a failure is detected, an alternative route is identified and used. Based on our actual implementation, we developed an analytical model of the DRS to evaluate its potential use for large networks. Using this model, we computed for various network sizes the fault identification times given a percentage of network usage. Calculations are carried out for a typical 10 Mbs Ethernet.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"DRS: a fault tolerant network routing system for mission critical distributed applications\",\"authors\":\"Abdur Chowdhury, O. Frieder, D. Grossman, Eric W. Burger\",\"doi\":\"10.1109/ICCCN.1997.623298\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a novel proactive routing algorithm (dynamic routing system, DRS) that consistently searches for failures via frequent ICMP (Internet control message protocol) echo requests. Our algorithm differs from its predecessors in that it is proactive instead of reactive by looking for failures before they affect message transmissions. When a failure is detected, an alternative route is identified and used. Based on our actual implementation, we developed an analytical model of the DRS to evaluate its potential use for large networks. Using this model, we computed for various network sizes the fault identification times given a percentage of network usage. Calculations are carried out for a typical 10 Mbs Ethernet.\",\"PeriodicalId\":305733,\"journal\":{\"name\":\"Proceedings of Sixth International Conference on Computer Communications and Networks\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Sixth International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.1997.623298\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Sixth International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.1997.623298","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

我们提出了一种新的主动路由算法(动态路由系统，DRS)，它通过频繁的ICMP (Internet控制消息协议)回声请求持续搜索故障。我们的算法与之前的算法不同之处在于，它是主动的，而不是被动的，在故障影响消息传输之前寻找故障。当检测到故障时，将识别并使用替代路由。根据我们的实际实现，我们开发了DRS的分析模型，以评估其在大型网络中的潜在用途。使用该模型，我们计算了给定网络使用率百分比的各种网络规模的故障识别时间。对典型的10mb以太网进行了计算。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

DRS: a fault tolerant network routing system for mission critical distributed applications

We present a novel proactive routing algorithm (dynamic routing system, DRS) that consistently searches for failures via frequent ICMP (Internet control message protocol) echo requests. Our algorithm differs from its predecessors in that it is proactive instead of reactive by looking for failures before they affect message transmissions. When a failure is detected, an alternative route is identified and used. Based on our actual implementation, we developed an analytical model of the DRS to evaluate its potential use for large networks. Using this model, we computed for various network sizes the fault identification times given a percentage of network usage. Calculations are carried out for a typical 10 Mbs Ethernet.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of Sixth International Conference on Computer Communications and Networks

自引率

0.00%

发文量