Name
Abstract | ||
|---|---|---|
Mesh networks are a kind of very important network topologies in massively multicomputer parallel systems. One-to-all or broadcast communication is one of the most important routing patterns and can be applied in many important applications. With the continuous increment in network size, routing in large size mesh networks with faults is unavoidable. In this paper, we propose a new fault-tolerant, local-information-based, and distributed broadcast routing algorithm based on the concept of k-submesh in all-port mesh networks. We suppose that each node has independent failure probability, under the assumption, we analyze the fault tolerance of our algorithm. We show that our routing algorithm is highly fault tolerant and has a high success probability to broadcast messages. For example, we formally prove that if the node failure probability is bounded by 0.12%, our broadcast routing algorithm works successfully with probability at least 99%. Simulation results show that our algorithm is efficient and effective in practice and theory, and the time steps of our algorithm is very close to the optimum. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1142/S0219265910002799 | JOURNAL OF INTERCONNECTION NETWORKS |
Keywords | DocType | Volume |
mesh network, broadcast routing, fault tolerance, k-submesh | Journal | 11 |
Issue | ISSN | Citations |
3-4 | 0219-2659 | 2 |
PageRank | References | Authors |
0.39 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| GaoCai Wang | 1 | 19 | 7.92 |
| Jianer Chen | 2 | 2564 | 184.38 |
| Chuang Lin | 3 | 3040 | 390.74 |