Presentation	2004/4/15 Neighborhood Broadcasting in undirected de-Bruijn and Kautz Networks Shingo OMURA, Zheng HUA, Koichi WADA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	This paper considers a neighborhood broadcasting protocol in undirected de-Bruijn and Kautz networks. The neighborhood broadcasting problem(NBP) is the problem of disseminating a message from an originator vertex to only its neighbors. Our protocol works under the single-port and half-duplex model and solves NBP in 5log_2(n+1)+0(1) time units on the undirected de-Bruijn graph UB(n,d) with n^d vertices and the undirected Kautz graph UK(n, d] with n^d + n^ vertices, where 2n is the maximum degree of these graphs. This completion time is asymptotically optimal in this model.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	neighborhood broadcast / de-Bruiin. Kautz / interconnection network
Paper #	COMP2004-3
Date of Issue

Conference Information
Committee	COMP
Conference Date	2004/4/15(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)	Neighborhood Broadcasting in undirected de-Bruijn and Kautz Networks
Sub Title (in English)
Keyword(1)	neighborhood broadcast
Keyword(2)	de-Bruiin. Kautz
Keyword(3)	interconnection network
1st Author's Name	Shingo OMURA
1st Author's Affiliation	Nagoya Institute of Technology()
2nd Author's Name	Zheng HUA
2nd Author's Affiliation	Nagoya Institute of Technology
3rd Author's Name	Koichi WADA
3rd Author's Affiliation	Nagoya Institute of Technology
Date	2004/4/15
Paper #	COMP2004-3
Volume (vol)	vol.104
Number (no)	16
Page	pp.pp.-
#Pages	7
Date of Issue