| Fault—Tolerant Tree—Based Multicasting in Mesh Multicomputers |
| |
| 引用本文： | 吴杰 陈Xiao. Fault—Tolerant Tree—Based Multicasting in Mesh Multicomputers[J]. 计算机科学技术学报, 2001, 16(5): 393-409. DOI: 10.1007/BF02948957 |
| |
| 作者姓名： | 吴杰 陈Xiao |
| |
| 作者单位： | [1]DepartmentofComputerScienceandEngineering,FloridaAtlanticUniversityBocaRaton,FL33431USA [2]ComputerScienceDepartment,SouthwestTexasStateUniversity,SanMarcos,TX78666,USA |
| |
| 基金项目： | NSF of USA under grant CCR 99O0646 and grant ANI 0073736. |
| |
| 摘 要： | We propose a fault-tolerant tree-based multicast algorithm for 2-dimensional (2-D) meshes based on the concept of the extended safety level which is a vector associated with each node to capture fault information in the neighborhood.In this approach each destination is reached through a minimum number of hops,In order to minimize the total number of traffic steps,three heuristic strategies are proposed.This approach can be easily implemented by pipelined circuit switching(PCS).A simulation study is conducted to measure the total number of traffic steps under different strategies.Our approach is the first attempt to address the faulttolerant tree-based multicast strategies.Our approach is the first attempt to address the faulttolerant tree-based multicast problem in 2-D meshes based on limited global information with a simple model and succinct information.
|
| 关 键 词： | 计算机网络 容错 网络安全等级 |
Fault-tolerant tree-based multicasting in mesh multicomputers |
| |
| Jie Wu,Xiao Chen. Fault-tolerant tree-based multicasting in mesh multicomputers[J]. Journal of Computer Science and Technology, 2001, 16(5): 393-409. DOI: 10.1007/BF02948957 |
| |
| Authors: | Jie Wu Xiao Chen |
| |
| Affiliation: | (1) Department of Computer Science and Engineering, Florida Atlantic University, 33431 Boca Raton, FL, USA;(2) Computer Science Department, Southwest Texas State University, 78666 San Marcos, TX, USA |
| |
| Abstract: | We propose a fault-tolerant tree-based multicast algorithm for 2-dimensional (2-D) meshes based on the concept of the extended safety level which is a vector associated with each node to capture fault information in the neighborhood. In this approach each destination is reached through a minimum number of hops. In order to minimize the total number of traffic steps, three heuristic strategies are proposed. This approach can be easily implemented by pipelined circuit switching (PCS). A simulation study is conducted to measure the total number of traffic steps under different strategies. Our approach is the first attempt to address the fault- tolerant tree-based multicast problem in 2-D meshes based on limited global information with a simple model and succinct information. |
| |
| Keywords: | fault tolerance faulty block mesh minimal routing multicast pipelined circuit switching (PCS) safety level |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
