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.
Lin, Ming-Bo and Jan, Grene-Eu
"Routing and Broadcasting Algorithms for the Root-Folded Petersen etworks,"
Journal of Marine Science and Technology: Vol. 6:
1, Article 8.
Available at: https://jmstt.ntou.edu.tw/journal/vol6/iss1/8