{"title":"N2R拓扑路由算法的保护机制","authors":"J. Lopez, J. Pedersen, R. C. Rumín, O. Madsen","doi":"10.1109/HSPR.2008.4734439","DOIUrl":null,"url":null,"abstract":"The topological routing over N2R structures has previously been studied and implemented using different techniques. A first approach was achieved obtaining the best trade off between path length vs. path completion time for the shortest path between any pair of nodes. This paper introduces protection against failures by modifying the previous algorithm implementing the option of routing a packet using a second independent path. The goal is to prove that there is an easy and efficient method to route topologically a packet (in case of a failure) using an alternative path with no record at all of the original.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"262 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Protection mechanism for the N2R topological routing algorithm\",\"authors\":\"J. Lopez, J. Pedersen, R. C. Rumín, O. Madsen\",\"doi\":\"10.1109/HSPR.2008.4734439\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The topological routing over N2R structures has previously been studied and implemented using different techniques. A first approach was achieved obtaining the best trade off between path length vs. path completion time for the shortest path between any pair of nodes. This paper introduces protection against failures by modifying the previous algorithm implementing the option of routing a packet using a second independent path. The goal is to prove that there is an easy and efficient method to route topologically a packet (in case of a failure) using an alternative path with no record at all of the original.\",\"PeriodicalId\":130484,\"journal\":{\"name\":\"2008 International Conference on High Performance Switching and Routing\",\"volume\":\"262 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on High Performance Switching and Routing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HSPR.2008.4734439\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HSPR.2008.4734439","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Protection mechanism for the N2R topological routing algorithm
The topological routing over N2R structures has previously been studied and implemented using different techniques. A first approach was achieved obtaining the best trade off between path length vs. path completion time for the shortest path between any pair of nodes. This paper introduces protection against failures by modifying the previous algorithm implementing the option of routing a packet using a second independent path. The goal is to prove that there is an easy and efficient method to route topologically a packet (in case of a failure) using an alternative path with no record at all of the original.