{"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}
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1989] Proceedings. The 9th International Conference on Distributed Computing Systems](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
