Summary: 
MLH: A HIERARCHICAL
HYPERCUBE NETWORK
Mokhtar A. Aboelaze *
Department of Computer Science
York University
4700 Keele st.
N.York, Ontario M3P 1J3 CANADA
E­mail aboelaze@cs.yorku.ca
ABSTRACT
In this paper, we present, and analyze, a new network called Multi Level Hypercube net­
work, or MLH. The MLH is a hierarchical network that is built from small size hypercube net­
works. The main advantage of the MLH over the hypercube is that it require less links than a
hypercube with the same number of nodes, and the node degree, for the majority of the nodes, is
less than the node degree in a comparable size hypercube, (few nodes have the same node
degree as a comparable size hypercube). The MLH also maintains the ease of routing enjoyed
by the hypercube networks. In this paper, we investigate the MLH, and introduce a simple and
efficient routing algorithm. We also introduce simple and efficient algorithms for broadcasting
and multicasting in the MLH. We study the average number of hops between two nodes in the
MLH assuming both uniform communication and clustered communication models. Finally, we

Source: Aboelaze, Mokhtar - Department of Computer Science, York University (Toronto)

Collections: Computer Technologies and Information Sciences