Presentation 1996/7/25
Broadcasting in Star Graphs with Byzantine Failures
Yukihiro Hamada, Aohan Mei, Feng Bao, Yoshihide Igarashi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We study broadcasting in star graphs containing faulty nodes and/or edges of the Byzantine type. We propose a single-port broadcasting scheme that tolerates up to &lfoor; (n-3d-1)/2 &rfoor; Byzantine failures in an n-star graph, where d is the smallest positive integer satisfying n≤d!. The broadcasting time of the scheme is logarithmic in the number of nodes of the n-star graph.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) broadcasting Byzantine failure / fault tolerance / single-port / star graph
Paper # COMP96-27
Date of Issue

Conference Information
Committee COMP
Conference Date 1996/7/25(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) Broadcasting in Star Graphs with Byzantine Failures
Sub Title (in English)
Keyword(1) broadcasting Byzantine failure
Keyword(2) fault tolerance
Keyword(3) single-port
Keyword(4) star graph
1st Author's Name Yukihiro Hamada
1st Author's Affiliation Department of Computer Science, Gunma University()
2nd Author's Name Aohan Mei
2nd Author's Affiliation Department of Computer Science, Gunma University
3rd Author's Name Feng Bao
3rd Author's Affiliation Department of Computer Science, Gunma University
4th Author's Name Yoshihide Igarashi
4th Author's Affiliation Department of Computer Science, Gunma University
Date 1996/7/25
Paper # COMP96-27
Volume (vol) vol.96
Number (no) 196
Page pp.pp.-
#Pages 10
Date of Issue