Panconnectivity algorithm for Eisenstein-Jacobi networks
The cycles in an interconnection network are one of the communication types that are considered as a factor to measure the efficiency and reliability of the networks’ topology. The network is said to be panconnected if there are cycles of length l between two nodes u and v, for all l = d(u, v), d(...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2023-10-01
|
| Series: | Kuwait Journal of Science |
| Subjects: | |
| Online Access: | https://www.sciencedirect.com/science/article/pii/S2307410823001189 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850225211539980288 |
|---|---|
| author | Mohammad Awadh Zaid Hussain Hesham Almansouri |
| author_facet | Mohammad Awadh Zaid Hussain Hesham Almansouri |
| author_sort | Mohammad Awadh |
| collection | DOAJ |
| description | The cycles in an interconnection network are one of the communication types that are considered as a factor to measure the efficiency and reliability of the networks’ topology. The network is said to be panconnected if there are cycles of length l between two nodes u and v, for all l = d(u, v), d(u, v) + 1, d(u, v) + 2, …, n − 1 where d(u, v) is the shortest distance between u and v in a given network, and n is the total number of nodes in the network. In this paper, we propose an algorithm that proves the existence of panconnectivity of Eisenstein-Jacobi networks by constructing all cycles between any two nodes in the network of length l such that 3 ≤ l < n. The correctness of the proposed algorithm is given with the time complexity O(n4). The proposed algorithm adopts and modifies the idea of Dynamic Source Routing (DSR) to find all possible shortest paths. The results of some test cases using the proposed algorithm are provided. |
| format | Article |
| id | doaj-art-0a19a42e9e8d4f9eb9efcd11df359ec2 |
| institution | OA Journals |
| issn | 2307-4116 |
| language | English |
| publishDate | 2023-10-01 |
| publisher | Elsevier |
| record_format | Article |
| series | Kuwait Journal of Science |
| spelling | doaj-art-0a19a42e9e8d4f9eb9efcd11df359ec22025-08-20T02:05:25ZengElsevierKuwait Journal of Science2307-41162023-10-01504485491https://doi.org/10.1016/j.kjs.2023.03.008Panconnectivity algorithm for Eisenstein-Jacobi networksMohammad Awadh0Zaid Hussain1Hesham Almansouri2Computer Science Department, Kuwait University, KuwaitComputer Science Department, Kuwait University, KuwaitKuwait Institute for Scientific Research, KuwaitThe cycles in an interconnection network are one of the communication types that are considered as a factor to measure the efficiency and reliability of the networks’ topology. The network is said to be panconnected if there are cycles of length l between two nodes u and v, for all l = d(u, v), d(u, v) + 1, d(u, v) + 2, …, n − 1 where d(u, v) is the shortest distance between u and v in a given network, and n is the total number of nodes in the network. In this paper, we propose an algorithm that proves the existence of panconnectivity of Eisenstein-Jacobi networks by constructing all cycles between any two nodes in the network of length l such that 3 ≤ l < n. The correctness of the proposed algorithm is given with the time complexity O(n4). The proposed algorithm adopts and modifies the idea of Dynamic Source Routing (DSR) to find all possible shortest paths. The results of some test cases using the proposed algorithm are provided.https://www.sciencedirect.com/science/article/pii/S2307410823001189eisenstein-jacobi networksfault-tolerantinterconnection networkpanconnectivitypancyclic |
| spellingShingle | Mohammad Awadh Zaid Hussain Hesham Almansouri Panconnectivity algorithm for Eisenstein-Jacobi networks Kuwait Journal of Science eisenstein-jacobi networks fault-tolerant interconnection network panconnectivity pancyclic |
| title | Panconnectivity algorithm for Eisenstein-Jacobi networks |
| title_full | Panconnectivity algorithm for Eisenstein-Jacobi networks |
| title_fullStr | Panconnectivity algorithm for Eisenstein-Jacobi networks |
| title_full_unstemmed | Panconnectivity algorithm for Eisenstein-Jacobi networks |
| title_short | Panconnectivity algorithm for Eisenstein-Jacobi networks |
| title_sort | panconnectivity algorithm for eisenstein jacobi networks |
| topic | eisenstein-jacobi networks fault-tolerant interconnection network panconnectivity pancyclic |
| url | https://www.sciencedirect.com/science/article/pii/S2307410823001189 |
| work_keys_str_mv | AT mohammadawadh panconnectivityalgorithmforeisensteinjacobinetworks AT zaidhussain panconnectivityalgorithmforeisensteinjacobinetworks AT heshamalmansouri panconnectivityalgorithmforeisensteinjacobinetworks |