Routing Properties of a Recursive Interconnection Network

@article{Chang2001RoutingPO,
  title={Routing Properties of a Recursive Interconnection Network},
  author={Rocky K. C. Chang and Hong Y. Wang},
  journal={J. Parallel Distrib. Comput.},
  year={2001},
  volume={61},
  pages={838-849}
}
In this paper, we consider a highly recursive interconnection network known as the fully connected cubic network (FCCN). By exploiting its recursive properties, we thoroughly analyze the performance of a simple routing algorithm for the FCCN. We show that at least 800 of the routes obtained from this simple algorithm are shortest paths, and this percentage increases further with the network size. Subsequently, we obtain the network diameter and average internodal distance, taking into account… CONTINUE READING