Based On The Hypercube Petersen Graphs Connect Internet Research

With the growing of cloud computing and high-performace computing technology, demands on computer become much higher. Parallel computer network, as a branch of the field of high performance computing, is a research hot spot at home and abroad. Based on the Hypercube and Petersen Graph, which are two popular Internet, this article has built a novel interconnection networks—PHP(n), and has discussed some topological properties of the network and communication performance.The main contributions of this paper are summarized as follows:1. Based on Hypercube and Petersen graph, to construct the novel interconnection network—PHP(n) and discuss its topology and encoding.2. To research the topological properties of PHP (n).3. To research the unicast and broadcast routing algorithm and to prove their communication efficiency.4. To compare respectively the properties of PHP(n) with the proper-ties of other kinds of networks in the number of node, connection degree, regularity, symmetry, internet diameter, cost of construction.5. To research the Minimum Spanning Tree (MST) of PHP(n).It illustrates that PHP (n) does not only possess the good properties of Petersen graph and Hypercube, but also its own peculiar properties, such as it has better scalability than Hypercube. In addition, the scale of the network node is relatively large, but the diameter growth is not very obvious in comparison with other networks, so the construction of the network has certain advantages. In summary, PHP(n) is an intercom nection network of better topological structures and communication characteristics.