DocumentCode
3497540
Title
Optimal Routing and Hamiltonian Cycle in Petersen-Torus Networks
Author
Jung-hyun, Seo ; HyeongOk, Lee ; Moon-suk, Jang
Author_Institution
Dept. of Comput. Eng., Nat. Univ. of Sunchon, Sunchon
Volume
2
fYear
2008
fDate
11-13 Nov. 2008
Firstpage
303
Lastpage
308
Abstract
In this paper, we develop optimal routing algorithm and Hamiltonian cycle in Petersen-Torus network based on well-known Petersen graph. PT(m,n) is a regular graph where the number of nodes is 10 mn, the number of edges 20 mn and degree 4. Hamiltoinan cycle is made by using Hamiltonian path in Petersen graph. Optimal routing algorithm is made by using PT´s diameter edge and node pairs.
Keywords
graph theory; telecommunication network routing; Hamiltonian cycle; Hamiltonian path; Petersen graph; Petersen-Torus network; optimal routing; Computer networks; Equations; Hypercubes; Information technology; Joining processes; Multiprocessor interconnection networks; Parallel algorithms; Pipelines; Routing; hamiltonian cycle; interconnection network; optimal routing; petersen-torus;
fLanguage
English
Publisher
ieee
Conference_Titel
Convergence and Hybrid Information Technology, 2008. ICCIT '08. Third International Conference on
Conference_Location
Busan
Print_ISBN
978-0-7695-3407-7
Type
conf
DOI
10.1109/ICCIT.2008.53
Filename
4682258
Link To Document