On the channel congestion of the shortest-path routing for unidirectional hypercube networks

Abstract

Interconnection networks are emerging as an approach to solving system-level communication problems. An interconnection network is a programmable system that serves to transport data or messages between components/terminals in a network system. The hypercube is one of the most widely studied network structures for interconnecting a huge number of network components so that it is usually considered as the fundamental principle and method of network design. The unidirectional hypercube, which was proposed by Chou and Du (1990), is obtained by orienting the direction of each edge in the hypercube. Routing is crucial for almost all aspects of network functionalities. In this paper, we propose a dimension-ordered shortest-path routing scheme for unidirectional hypercubes and then analyze the incurred channel congestion from a worst-case point of view.