生成树问题的弹性协议设计

[1989] Proceedings. The 9th International Conference on Distributed Computing Systems Pub Date : 1989-06-05 DOI:10.1109/ICDCS.1989.37984

I. A. Cimet, C. Cheng, Srikanta P. R. Kumar

{"title":"生成树问题的弹性协议设计","authors":"I. A. Cimet, C. Cheng, Srikanta P. R. Kumar","doi":"10.1109/ICDCS.1989.37984","DOIUrl":null,"url":null,"abstract":"A method to design resilient protocols for spanning tree problems is proposed. The method consists of a generic resilient protocol that can be used for any spanning tree problem. A resilient protocol for a particular spanning tree problem can be obtained by adjusting various run-time parameters of the generic protocol. The generic protocol is designed by using the concepts of replacement sets that contain the links that can be used to replace a link that fails and replacement values that measure the change in the spanning tree when a link in a replacement set is used to recreate a spanning tree. The approach is as general as the common approach (for the case of spanning trees) because the generic protocol can solve a new spanning tree problem without an individual design. The protocols obtained with this method are efficient and easy to implement and verify because they are all derived from the generic protocol.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On the design of resilient protocols for spanning tree problems\",\"authors\":\"I. A. Cimet, C. Cheng, Srikanta P. R. Kumar\",\"doi\":\"10.1109/ICDCS.1989.37984\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method to design resilient protocols for spanning tree problems is proposed. The method consists of a generic resilient protocol that can be used for any spanning tree problem. A resilient protocol for a particular spanning tree problem can be obtained by adjusting various run-time parameters of the generic protocol. The generic protocol is designed by using the concepts of replacement sets that contain the links that can be used to replace a link that fails and replacement values that measure the change in the spanning tree when a link in a replacement set is used to recreate a spanning tree. The approach is as general as the common approach (for the case of spanning trees) because the generic protocol can solve a new spanning tree problem without an individual design. The protocols obtained with this method are efficient and easy to implement and verify because they are all derived from the generic protocol.<<ETX>>\",\"PeriodicalId\":266544,\"journal\":{\"name\":\"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.1989.37984\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.1989.37984","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

提出了一种针对生成树问题设计弹性协议的方法。该方法由一个通用的弹性协议组成，可用于任何生成树问题。通过调整通用协议的各种运行时参数，可以获得针对特定生成树问题的弹性协议。通用协议是通过使用替换集的概念来设计的，替换集包含可用于替换故障链路的链路，以及替换值，当替换集中的链路用于重建生成树时，替换值度量生成树中的变化。该方法与通用方法(对于生成树的情况)一样通用，因为通用协议可以解决新的生成树问题，而无需单独设计。由于该方法得到的协议都是由通用协议派生而来的，因此效率高，易于实现和验证。

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

查看原文本刊更多论文

On the design of resilient protocols for spanning tree problems

A method to design resilient protocols for spanning tree problems is proposed. The method consists of a generic resilient protocol that can be used for any spanning tree problem. A resilient protocol for a particular spanning tree problem can be obtained by adjusting various run-time parameters of the generic protocol. The generic protocol is designed by using the concepts of replacement sets that contain the links that can be used to replace a link that fails and replacement values that measure the change in the spanning tree when a link in a replacement set is used to recreate a spanning tree. The approach is as general as the common approach (for the case of spanning trees) because the generic protocol can solve a new spanning tree problem without an individual design. The protocols obtained with this method are efficient and easy to implement and verify because they are all derived from the generic protocol.<>

求助全文

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

来源期刊

[1989] Proceedings. The 9th International Conference on Distributed Computing Systems

自引率

0.00%

发文量