Presentation | 1998/12/4 A broadcasting algorithm in permutational graphs Shinya Tanaka, Yasuaki Nishitani, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | We propose a fault tolerant broadcast scheme in the permutational graphs. Communicational model is synchronous and the single-port model, and we assume that its fault type is crash type. The proposed scheme can broadcast in the (n, k)-permutational graph with n-2 node and/or edge faults, thus it is optimal for fault tolerance. Our scheme takes at most 4n-3 more time units than an optimal broadcast scheme that can tolerate n-2 faults in the (n, k)-permutational graph. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | network / broadcasting / fault tolerance / permutational graph / (n, k)-star graph |
Paper # | COMP98-65 |
Date of Issue |
Conference Information | |
Committee | COMP |
---|---|
Conference Date | 1998/12/4(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 | Theoretical Foundations of Computing (COMP) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | A broadcasting algorithm in permutational graphs |
Sub Title (in English) | |
Keyword(1) | network |
Keyword(2) | broadcasting |
Keyword(3) | fault tolerance |
Keyword(4) | permutational graph |
Keyword(5) | (n, k)-star graph |
1st Author's Name | Shinya Tanaka |
1st Author's Affiliation | Department of Computer Science Faculty of Engineering, Gunma University() |
2nd Author's Name | Yasuaki Nishitani |
2nd Author's Affiliation | Department of Computer Science Faculty of Engineering, Gunma University |
Date | 1998/12/4 |
Paper # | COMP98-65 |
Volume (vol) | vol.98 |
Number (no) | 442 |
Page | pp.pp.- |
#Pages | 8 |
Date of Issue |