Presentation 1996/1/26
Efficient Broadcasting on Faulty Star Networks
Aohan Mei, Yoshihide Igarashi, Naoki Shimizu,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper we study broadcasting on faulty star networks. We give a simple broadcasting procedure and show that broadcasting by the procedure on the n-star network completes in O(n log n) time if the number of faults is O(√).
Keyword(in Japanese) (See Japanese page)
Keyword(in English) broadcasts / fault tolerance / interconnection networks / star graphs
Paper # COMP95-79
Date of Issue

Conference Information
Committee COMP
Conference Date 1996/1/26(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 ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Efficient Broadcasting on Faulty Star Networks
Sub Title (in English)
Keyword(1) broadcasts
Keyword(2) fault tolerance
Keyword(3) interconnection networks
Keyword(4) star graphs
1st Author's Name Aohan Mei
1st Author's Affiliation Department of Computer Science Gunma University()
2nd Author's Name Yoshihide Igarashi
2nd Author's Affiliation Department of Computer Science Gunma University
3rd Author's Name Naoki Shimizu
3rd Author's Affiliation Department of Computer Science Gunma University
Date 1996/1/26
Paper # COMP95-79
Volume (vol) vol.95
Number (no) 498
Page pp.pp.-
#Pages 8
Date of Issue