{"title":"用Tie-Sets恢复网络故障","authors":"K. Kadena, K. Nakayama, N. Shinomiya","doi":"10.1109/WAINA.2011.125","DOIUrl":null,"url":null,"abstract":"The present research aims to recover network failure in networks with a complicated topology by focusing on tie-sets. A tie-set implies a set of links constituting a loop. The entire network is divided into smaller local units of tie-sets which encompass all network vertices and links. These units realize network management for quick and flexible failure recovery. This paper first introduces the concept of tie-sets, and then proposes a recovery method for single link failures. The latter half of the paper deals with the efficiency of failure recovery in different spanning trees. Since a hypothesis is formed by a numerical evaluation the paper proposes a method of determining a spanning tree for quick link failure recovery.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Network Failure Recovery with Tie-Sets\",\"authors\":\"K. Kadena, K. Nakayama, N. Shinomiya\",\"doi\":\"10.1109/WAINA.2011.125\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The present research aims to recover network failure in networks with a complicated topology by focusing on tie-sets. A tie-set implies a set of links constituting a loop. The entire network is divided into smaller local units of tie-sets which encompass all network vertices and links. These units realize network management for quick and flexible failure recovery. This paper first introduces the concept of tie-sets, and then proposes a recovery method for single link failures. The latter half of the paper deals with the efficiency of failure recovery in different spanning trees. Since a hypothesis is formed by a numerical evaluation the paper proposes a method of determining a spanning tree for quick link failure recovery.\",\"PeriodicalId\":355789,\"journal\":{\"name\":\"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WAINA.2011.125\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2011.125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The present research aims to recover network failure in networks with a complicated topology by focusing on tie-sets. A tie-set implies a set of links constituting a loop. The entire network is divided into smaller local units of tie-sets which encompass all network vertices and links. These units realize network management for quick and flexible failure recovery. This paper first introduces the concept of tie-sets, and then proposes a recovery method for single link failures. The latter half of the paper deals with the efficiency of failure recovery in different spanning trees. Since a hypothesis is formed by a numerical evaluation the paper proposes a method of determining a spanning tree for quick link failure recovery.