Fault tolerance in bubble-sort graph networks

详细信息    查看全文

• 作者：Shiying Wang^a ; ^{shiying@sxu.edu.cn} ; Yuxing Yang^b ; ^c ; ^{yxyangcn@163.com}
• 关键词：Distributed systems ; Interconnection networks ; Node failure ; Link failure ; Bubble-sort graphs
• 刊名：Theoretical Computer Science
• 出版年：2012
• 出版时间：2 March 2012
• 年：2012
• 卷：421
• 期：Complete
• 页码：62-69
• 全文大小：281 K

文摘

The bubble-sort graph is one of the attractive underlying topologies for distributed systems. (resp. ) is the minimum number of faulty nodes (resp. links) that make every -dimensional sub-bubble-sort graph faulty in under node (resp. link) failure model. In this paper, we proved that , for , for , for , for , for , and for and .