星型网络中节点故障对子星可靠性的影响——一种组合方法

S. Latifi, Venka Palaniappan
{"title":"星型网络中节点故障对子星可靠性的影响——一种组合方法","authors":"S. Latifi, Venka Palaniappan","doi":"10.1109/AINA.2007.135","DOIUrl":null,"url":null,"abstract":"The star graph is a hierarchical graph, and rich in containing substars (or graphs with smaller size but with the same topological properties as the original). Given a set of faulty nodes, we determine the ability to recover substars of a given dimension from the original network. A study of the number of faulty nodes that are required to damage every subnetwork of a given size is also presented.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Effect of Node Failures in Substar Reliability of a Star Network- a Combinatorial Approach\",\"authors\":\"S. Latifi, Venka Palaniappan\",\"doi\":\"10.1109/AINA.2007.135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The star graph is a hierarchical graph, and rich in containing substars (or graphs with smaller size but with the same topological properties as the original). Given a set of faulty nodes, we determine the ability to recover substars of a given dimension from the original network. A study of the number of faulty nodes that are required to damage every subnetwork of a given size is also presented.\",\"PeriodicalId\":361109,\"journal\":{\"name\":\"21st International Conference on Advanced Information Networking and Applications (AINA '07)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"21st International Conference on Advanced Information Networking and Applications (AINA '07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2007.135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2007.135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

星图是一个层次图,并且包含丰富的子星图(或尺寸较小但具有与原始图相同拓扑属性的图)。给定一组故障节点,我们确定从原始网络中恢复给定维度的子节点的能力。对损坏给定大小的每个子网所需的故障节点数量进行了研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Effect of Node Failures in Substar Reliability of a Star Network- a Combinatorial Approach
The star graph is a hierarchical graph, and rich in containing substars (or graphs with smaller size but with the same topological properties as the original). Given a set of faulty nodes, we determine the ability to recover substars of a given dimension from the original network. A study of the number of faulty nodes that are required to damage every subnetwork of a given size is also presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信