The search functionality is under construction.

The search functionality is under construction.

Multi-source broadcasting is one of the information dissemination problems on interconnection networks such that some (but not all) units disseminate distinct information to all other units. In this paper, we discuss multi-source broadcasting on the Kautz digraph which is one of the models of interconnection networks. We decompose the Kautz digraph *K*(*d*,*n*) into isomorphic cycle-rooted trees whose root-cycle has length 2, then we present an algorithm for multi-source broadcasting using these cycle-rooted trees. This algorithm is able to treat *d*(*d*+1) messages simultaneously and takes the same order for required times as lower bound.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.10 pp.1800-1805

- Publication Date
- 2010/10/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.E93.A.1800

- Type of Manuscript
- PAPER

- Category
- Graphs and Networks

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Takahiro TSUNO, Yukio SHIBATA, "An Algorithm for Multi-Source Broadcasting on Kautz Digraphs Using 2-Cycle Rooted Trees" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 10, pp. 1800-1805, October 2010, doi: 10.1587/transfun.E93.A.1800.

Abstract: Multi-source broadcasting is one of the information dissemination problems on interconnection networks such that some (but not all) units disseminate distinct information to all other units. In this paper, we discuss multi-source broadcasting on the Kautz digraph which is one of the models of interconnection networks. We decompose the Kautz digraph *K*(*d*,*n*) into isomorphic cycle-rooted trees whose root-cycle has length 2, then we present an algorithm for multi-source broadcasting using these cycle-rooted trees. This algorithm is able to treat *d*(*d*+1) messages simultaneously and takes the same order for required times as lower bound.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1800/_p

Copy

@ARTICLE{e93-a_10_1800,

author={Takahiro TSUNO, Yukio SHIBATA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={An Algorithm for Multi-Source Broadcasting on Kautz Digraphs Using 2-Cycle Rooted Trees},

year={2010},

volume={E93-A},

number={10},

pages={1800-1805},

abstract={Multi-source broadcasting is one of the information dissemination problems on interconnection networks such that some (but not all) units disseminate distinct information to all other units. In this paper, we discuss multi-source broadcasting on the Kautz digraph which is one of the models of interconnection networks. We decompose the Kautz digraph *K*(*d*,*n*) into isomorphic cycle-rooted trees whose root-cycle has length 2, then we present an algorithm for multi-source broadcasting using these cycle-rooted trees. This algorithm is able to treat *d*(*d*+1) messages simultaneously and takes the same order for required times as lower bound.},

keywords={},

doi={10.1587/transfun.E93.A.1800},

ISSN={1745-1337},

month={October},}

Copy

TY - JOUR

TI - An Algorithm for Multi-Source Broadcasting on Kautz Digraphs Using 2-Cycle Rooted Trees

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1800

EP - 1805

AU - Takahiro TSUNO

AU - Yukio SHIBATA

PY - 2010

DO - 10.1587/transfun.E93.A.1800

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E93-A

IS - 10

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - October 2010

AB - Multi-source broadcasting is one of the information dissemination problems on interconnection networks such that some (but not all) units disseminate distinct information to all other units. In this paper, we discuss multi-source broadcasting on the Kautz digraph which is one of the models of interconnection networks. We decompose the Kautz digraph *K*(*d*,*n*) into isomorphic cycle-rooted trees whose root-cycle has length 2, then we present an algorithm for multi-source broadcasting using these cycle-rooted trees. This algorithm is able to treat *d*(*d*+1) messages simultaneously and takes the same order for required times as lower bound.

ER -