网络中树和环的容错重构

Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI:10.1109/ICNP.1994.344357

A. Arora, Ashish Singhai

{"title":"网络中树和环的容错重构","authors":"A. Arora, Ashish Singhai","doi":"10.1109/ICNP.1994.344357","DOIUrl":null,"url":null,"abstract":"We design two protocols that maintain the nodes of any computer network in a rooted spanning tree and in a unidirectional ring, respectively, in the presence of any finite number of fail-stop failures and repairs of network nodes and communication channels. Our protocols are fully distributed, have optimal time and space complexity, and illustrate two different methods for the design of nonmasking fault-tolerant protocols.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"203 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Fault-tolerant reconfiguration of trees and rings in networks\",\"authors\":\"A. Arora, Ashish Singhai\",\"doi\":\"10.1109/ICNP.1994.344357\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We design two protocols that maintain the nodes of any computer network in a rooted spanning tree and in a unidirectional ring, respectively, in the presence of any finite number of fail-stop failures and repairs of network nodes and communication channels. Our protocols are fully distributed, have optimal time and space complexity, and illustrate two different methods for the design of nonmasking fault-tolerant protocols.<<ETX>>\",\"PeriodicalId\":275870,\"journal\":{\"name\":\"Proceedings of ICNP - 1994 International Conference on Network Protocols\",\"volume\":\"203 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ICNP - 1994 International Conference on Network Protocols\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNP.1994.344357\",\"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 ICNP - 1994 International Conference on Network Protocols","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP.1994.344357","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

我们设计了两个协议，分别在任何有限数量的故障停止故障和网络节点和通信通道的修复存在的情况下，将任何计算机网络的节点维持在根生成树和单向环中。我们的协议是完全分布式的，具有最佳的时间和空间复杂度，并说明了两种不同的非屏蔽容错协议的设计方法。

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

查看原文本刊更多论文

Fault-tolerant reconfiguration of trees and rings in networks

We design two protocols that maintain the nodes of any computer network in a rooted spanning tree and in a unidirectional ring, respectively, in the presence of any finite number of fail-stop failures and repairs of network nodes and communication channels. Our protocols are fully distributed, have optimal time and space complexity, and illustrate two different methods for the design of nonmasking fault-tolerant protocols.<>

求助全文

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

来源期刊

Proceedings of ICNP - 1994 International Conference on Network Protocols

自引率

0.00%

发文量