One-to-All Broadcasting in Petersen-Torus Networks for SLA and MLA Models

In a network, broadcasting is the dissemination of a message from a source node holding a message to all the remaining nodes through a call. This letter proposes a one-to-all broadcasting algorithm in the Petersen- torus network PT(n, n) for the single-link-available and multiple-link-available models. A PT(n, n) is a regular network whose degree is 4 and number of nodes is 10n 2 , where the Petersen graph is set as a basic module, and the basic module is connected in the form of a torus. A broadcasting algorithm is developed using a divide-and-conquer technique, and the time complexity of the proposed algorithm approximates n+4, the diameter of PT(n, n), which is the lower bound of the time complexity of broadcasting.

[1]  Hyeong-Ah Choi,et al.  Circuit-Switched Broadcasting in Torus and Mesh Networks , 1996, IEEE Trans. Parallel Distributed Syst..

[2]  Jung-hyun Seo,et al.  Petersen-Torus Networks for Multicomputer Systems , 2008, 2008 Fourth International Conference on Networked Computing and Advanced Information Management.

[3]  Thomas Sauerwald,et al.  Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs , 2007, STACS.

[4]  Zhizhang Shen.  A generalized broadcasting schema for the mesh structures , 2007, Appl. Math. Comput..

[5]  Yu-Chee Tseng,et al.  Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori , 2000, IEEE Trans. Computers.

[6]  Seo Jung-hyun,et al.  Optimal Routing and Hamiltonian Cycle in Petersen-Torus Networks , 2008, 2008 Third International Conference on Convergence and Hybrid Information Technology.

[7]  Philip K. McKinley,et al.  A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks , 1996, IEEE Trans. Parallel Distributed Syst..

[8]  Sang Kyu Lee,et al.  Optimal broadcast in /spl alpha/-port wormhole-routed mesh networks , 1997, Proceedings 1997 International Conference on Parallel and Distributed Systems.