{"title":"错误IEH图中的路由问题","authors":"S. Sur, P. Srimani","doi":"10.1109/PCCC.1994.504098","DOIUrl":null,"url":null,"abstract":"The IEH graphs, a generalization of the hypercube, was introduced by Sur and Srimani [SI. It was shown that IEH graphs are incrementally extensible in steps of 1, optimally fault tolerant and its diameter is logarithmic in the number of nodes. Moreover, for any given number of nodes, the difference of the maximum and the minimum degree of a node in the graph is 5 1, i.e., the graph is almost regular. This paper analyzes IEH graphs in presence of failures. We develop a routing algorithm in IEH graphs in presence of faults and compute the fault diameter. The routing algorithm incorporates an interesting algorithm to route to n destination nodes from a given source node in a complete hypercube H,.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"192 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On the routing problem in faulty IEH graphs\",\"authors\":\"S. Sur, P. Srimani\",\"doi\":\"10.1109/PCCC.1994.504098\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The IEH graphs, a generalization of the hypercube, was introduced by Sur and Srimani [SI. It was shown that IEH graphs are incrementally extensible in steps of 1, optimally fault tolerant and its diameter is logarithmic in the number of nodes. Moreover, for any given number of nodes, the difference of the maximum and the minimum degree of a node in the graph is 5 1, i.e., the graph is almost regular. This paper analyzes IEH graphs in presence of failures. We develop a routing algorithm in IEH graphs in presence of faults and compute the fault diameter. The routing algorithm incorporates an interesting algorithm to route to n destination nodes from a given source node in a complete hypercube H,.\",\"PeriodicalId\":203232,\"journal\":{\"name\":\"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications\",\"volume\":\"192 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1994.504098\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1994.504098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The IEH graphs, a generalization of the hypercube, was introduced by Sur and Srimani [SI. It was shown that IEH graphs are incrementally extensible in steps of 1, optimally fault tolerant and its diameter is logarithmic in the number of nodes. Moreover, for any given number of nodes, the difference of the maximum and the minimum degree of a node in the graph is 5 1, i.e., the graph is almost regular. This paper analyzes IEH graphs in presence of failures. We develop a routing algorithm in IEH graphs in presence of faults and compute the fault diameter. The routing algorithm incorporates an interesting algorithm to route to n destination nodes from a given source node in a complete hypercube H,.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
