| Presentation | 2002/10/11 Fault-Tolerant Multicast Routig Problem in Rotator Graphs Keiichi KANEKO, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A rotator graph is one of promising topologies for interconnection networks in that it has a low degree and a small diameter. In general, we can obtain paths in multicast routing problem by overlapping shotest paths obtained in unicast routing problems. In this study, we focus on a property of a rotator graph to give a multicast routing algorithm which generates paths which contain fewer edges. In addition, we extend the algorithm to tolerate edge faults. Also, we report the results of computer simulation which is conducted to verify the availability of the algorithms. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Rotator Graphs / Multicast Paths / Fault Tolerance |
| Paper # | DE2002-96 |
| Date of Issue |
| Conference Information | |
| Committee | DE |
|---|---|
| Conference Date | 2002/10/11(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Data Engineering (DE) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Fault-Tolerant Multicast Routig Problem in Rotator Graphs |
| Sub Title (in English) | |
| Keyword(1) | Rotator Graphs |
| Keyword(2) | Multicast Paths |
| Keyword(3) | Fault Tolerance |
| 1st Author's Name | Keiichi KANEKO |
| 1st Author's Affiliation | Faculty of Technology, Tokyo University of Agriculture and Technology() |
| Date | 2002/10/11 |
| Paper # | DE2002-96 |
| Volume (vol) | vol.102 |
| Number (no) | 376 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |