Please use this identifier to cite or link to this item:
Title: Panconnectivity of Eisenstein-Jacobi Networks
Authors: Mohammad A. Awadh 
Supervisor: Dr. Zaid Hussain
Degree Awarded: M. Sc Degree in: Computer Science
Keywords: Interconnection network, Parallel computing, Eisenstein-Jacobi Networks, Panconnectivity
Issue Date: 2019
Publisher: Β Kuwait university - college of graduate studies
Abstract: Eisenstein-Jacobi (EJ) Network was proposed in (Flahive & Bose, 2010) as an efficient interconnection network topology for parallel and distributed systems. It is based on EisensteinJacobi Integers modulo 𝛼=π‘Ž+π‘πœŒ, where 0β‰€π‘Žβ‰€π‘, and it is 6-regular symmetric networks, which are considered as a generalization of hexagonal networks. Most of the interconnection networks are modeled as graphs where the applications and functions of graph theory could be applied to. The cycles in a graph is one type of communications in interconnection networks that are considered as a factor to measure the efficiency and reliability of the networks’ topology. The network is panconnected if there are cycles of length 𝑙 for all 𝑙= 𝑑(𝑒,𝑣),𝑑(𝑒,𝑣)+1,𝑑(𝑒,𝑣)+2,…,π‘›βˆ’1 where 𝑑(𝑒,𝑣) is the shortest distance between nodes 𝑒 and 𝑣 in a given network. In this thesis, we investigate the problem of panconnectivity of Eisenstein-Jacobi Networks. The proposed algorithm shows the panconnectivity of a given Eisenstein-Jacobi Networks with its complexity of order 𝑂(𝑛6). Simulation results are given to support the correctness of this work.
Appears in Programs:1718 Computer Science

Files in This Item:
File Description SizeFormat 
Thesis.pdf15,34 MBAdobe PDFView/Open    Request a copy
Show full item record

Page view(s)

checked on Feb 27, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.