Routing and Broadcasting Algorithms for the Root-Folded Petersen etworks

Authors

Ming-Bo Lin, Associate Professor, Deparment of Electronic Engineerins. National Taiwan Unive rsiry of Science and Technology. 43 Keelung Road Section 4. Taipei. Taiwan.
Grene-Eu Jan, Associate Professor, Department of Computer Science. National Taiwan Ocean University, Keelung, Taiwan.Follow

Abstract

Petersen networks have been proposed as the alternatives for interconnecting highly parallel computers. The main advantages of Petersen networks are: regular topology, high scalability, and smaller diameters. In this paper, we propose a new node naming scheme for Petersen networks. Based on this scheme, two Petersen graph related networks, called root-folded Petersen network in type-I and type-II, are constructed. Furthermore, both O(1ogio N) routing and broadcasting algorithms for the proposed networks are developed, where N is the number of nodes.

Recommended Citation

Lin, Ming-Bo and Jan, Grene-Eu (1998) "Routing and Broadcasting Algorithms for the Root-Folded Petersen etworks," Journal of Marine Science and Technology: Vol. 6: Iss. 1, Article 8.
DOI: 10.51400/2709-6998.2521
Available at: https://jmstt.ntou.edu.tw/journal/vol6/iss1/8