17 citations · 30 across the 5 of their papers we have counts for
6 papers · 1 filter
Panconnectivity Algorithm for Eisenstein-Jacobi Networks
Mohammad Awadh, Zaid Hussain, Hesham Almansouri
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…
Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks
Hesham AlMansouri, Zaid Hussain
Disjoint paths are defined as paths between the source and destination nodes where the intermediate nodes in any two paths are disjoint. They are helpful in fault-tolerance routing…
Independent Spanning Trees in Eisenstein-Jacobi Networks
Zaid Hussain, Hosam AboElFotoh, Bader AlBdaiwi
Spanning trees are widely used in networks for broadcasting, fault-tolerance, and securely delivering messages. Hexagonal interconnection networks have a number of real life applic…
Node-Independent Spanning Trees in Gaussian Networks
Zaid Hussain, Bader AlBdaiwi, Anton Cerny
Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all t…
An Improved One-to-All Broadcasting in Higher Dimensional Eisenstein-Jacobi Networks
Zaid Hussain
Recently, a higher dimensional Eisenstein-Jacobi networks, has been proposed in [22], which is shown that they have better average distance with more number of nodes than a single…
Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks
Bader AlBdaiwi, Zaid Hussain, Anton Cerny +1
Independent trees are used in building secure and/or fault-tolerant network communication protocols. They have been investigated for different network topologies including tori. De…