论文信息 - Reliable broadcasting in double loop networks

Reliable broadcasting in double loop networks

Broadcast is the fundamental collective communication routine in which the same message is delivered from a single source to all the nodes in a network. The most efficient way to implement broadcast is through the construction of a broadcast tree. We introduce a revised definition of optimality for the i-port model broadcast tree based on fault-tolerance, and we construct optimal broadcast trees for interconnection networks modeled by Double Loop-Graphs for 1 ≤ i ≤ 4. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(2), 88–97 2005

Joseph G. Peters | Nenad Obradović | Goran Ružić

[1] Arthur L. Liestman,et al. Network Properties of Double and Triple Fixed Step Graphs , 1998, Int. J. Found. Comput. Sci..

[2] Alon Itai,et al. The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..

[3] D. J. Guan,et al. A Dynamic Fault-Tolerant Message Routing Algorithm for Double-Loop Networks , 1999, Inf. Process. Lett..

[4] Lali Barrière,et al. Fault-Tolerant Routings in Chordal Ring Networks , 2000 .

[5] Yue-Li Wang,et al. An Optimal Fault-Tolerant Routing Algorithm for Double-Loop Networks , 2001, IEEE Trans. Computers.

[6] Mateo Valero,et al. Discrete Optimization Problem in Local Networks and Data Alignment , 1987, IEEE Transactions on Computers.

[7] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[8] J.-C. Bermond,et al. An Optimization Problem in Distributed Loop Computer Networks , 1989 .

[9] Juraj Hromkovič,et al. Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping) , 1996 .

[10] Miquel Àngel Fiol Mora,et al. The Diameter of undirected graphs associated to plane tessellations , 1985 .

[11] Bernard Mans,et al. On Routing in Circulant Graphs , 1999, COCOON.

[12] D. Frank Hsu,et al. Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..